This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
|
en:dydaktyka:ggp:game_tree_1 [2019/01/03 23:00] msl |
en:dydaktyka:ggp:game_tree_1 [2021/01/12 01:01] msl [Assignments] |
||
|---|---|---|---|
| Line 169: | Line 169: | ||
| - implement timeout handling | - implement timeout handling | ||
| - test the 'checkers' again | - test the 'checkers' again | ||
| - | - bonus assignments | + | - bonus assignment: implement the [[https://thimbleby.gitlab.io/algorithm-wiki-site/wiki/minimax_search/|NegaMax algorithm]] |
| - | - 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 [[https://thimbleby.gitlab.io/algorithm-wiki-site/wiki/minimax_search/|NegaMax algorithm]] | + | |
