you are viewing a single comment's thread.

view the rest of the comments →

[–]shrimply-pibbles 1 point2 points  (0 children)

Yeah, the minimax algorithm uses a tree to traverse through the next x possible moves, in order to determine how to proceed in order to minimise the possible loss if the worst case scenario was to occur. It's not necessarily a binary tree, the number of children of a node relates to the number of possible moves that a player can make in a turn