Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
Next revision Both sides next revision
en:dydaktyka:ggp:game_tree_1 [2018/01/23 14:12]
msl [Ćwiczenia]
en:dydaktyka:ggp:game_tree_1 [2019/01/03 23:00]
msl
Line 9: Line 9:
 {{ :​pl:​dydaktyka:​ggp:​tic-tac-toe-tree.png?​500 | }} {{ :​pl:​dydaktyka:​ggp:​tic-tac-toe-tree.png?​500 | }}
  
-We will use the '​ggp-base'​ framework, [[en:​dydaktyka:​ggp:​gdl|introduced together with the gdl language]].+We will use the '​ggp-base'​ framework, [[en:​dydaktyka:​ggp:​gdl#validation|introduced together with the gdl language]].
  
 ===== First Legal Move ===== ===== First Legal Move =====
Line 100: Line 100:
 Please make sure that you understant the algorithm. Please make sure that you understant the algorithm.
  
-==== Ćwiczenia ​====+==== Assignments ​====
  
   - Create a MiniMax player based on the code below: <code java>   - Create a MiniMax player based on the code below: <code java>
Line 171: Line 171:
   - bonus assignments   - bonus assignments
     - add possibility to cinstraint the search depth (several moves look-ahead) --- it's a classical method to scale the AI power. Why this method may be better than the timeout? ​       ​     - add possibility to cinstraint the search depth (several moves look-ahead) --- it's a classical method to scale the AI power. Why this method may be better than the timeout? ​       ​
-    - implement the  [[http://sandbox.thimbleby.net/algorithms/doku.php?​id=minimax_search|NegaMax algorithm]]+    - implement the  [[https://​thimbleby.gitlab.io/algorithm-wiki-site/​wiki/​minimax_search/|NegaMax algorithm]]
    
  
Line 181: Line 181:
 Ending of [[https://​www.youtube.com/​watch?​v=Ewh-rF7KSEg|the video]] shows an example of the Alpha-Beta pruning. Ending of [[https://​www.youtube.com/​watch?​v=Ewh-rF7KSEg|the video]] shows an example of the Alpha-Beta pruning.
  
-<WRAP center round tip 60%>[[http://will.thimbleby.net/algorithms/doku.php?​id=minimax_search_with_alpha-beta_pruning|Interactive Visualization of the algorithm]].+<WRAP center round tip 60%>[[https://​thimbleby.gitlab.io/algorithm-wiki-site/​wiki/​minimax_search_with_alpha-beta_pruning/|Interactive Visualization of the algorithm]].
 </​WRAP>​ </​WRAP>​
    
en/dydaktyka/ggp/game_tree_1.txt · Last modified: 2021/01/12 01:02 by msl
www.chimeric.de Valid CSS Driven by DokuWiki do yourself a favour and use a real browser - get firefox!! Recent changes RSS feed Valid XHTML 1.0