Differences

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

Link to this comparison view

Both sides previous revision Previous revision
en:dydaktyka:ggp:game_tree_1 [2018/01/23 20:13]
msl [Classical Game Theory Algorithms]
en:dydaktyka:ggp:game_tree_1 [2019/01/03 22:00] (current)
msl
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.1516738423.txt.gz · Last modified: 2018/01/23 20:13 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