This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
en:dydaktyka:ggp:game_tree_1 [2019/01/03 23:00] msl |
en:dydaktyka:ggp:game_tree_1 [2021/01/12 01:02] (current) msl [MiniMax] |
||
|---|---|---|---|
| Line 98: | Line 98: | ||
| * [[https://www.youtube.com/watch?v=OkP8BAwfO24|a video presenting the algorithm]] | * [[https://www.youtube.com/watch?v=OkP8BAwfO24|a video presenting the algorithm]] | ||
| - | Please make sure that you understant the algorithm. | + | Please make sure that you understand the algorithm. |
| ==== Assignments ==== | ==== Assignments ==== | ||
| Line 167: | Line 167: | ||
| - test if the MiniMax wins with other bots in 'tic-tac-toe' | - test if the MiniMax wins with other bots in 'tic-tac-toe' | ||
| - the same with 'checkers' | - the same with 'checkers' | ||
| - | - implement timeout handling | + | - implement timeout handling (return a random move) |
| - 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]] | + | |
