I read this answer, and it just confused me: TicTacToe AI Making Incorrect Decisions
Could somebody help me understand how I could apply this to Tictactoe?
- How would I “work my way up through the tree?
- How do I even create a tree of moves?
Note: I currently have a Board class which stores state about the game (e.g. Is the game complete with the current moves?, Is there a winner?, etc.) Each move on the current board is stored as 1 – 9 (top left to bottom right in rows). I can make copies of the current board state with ease. I can return a list of current moves for “X” and “O”, as well as available moves from a Board.
Solving Tic-Tac-Toe: Game Tree Basics
Category: Game Theory
Posted on: July 30, 2008 11:38 AM, by Mark C. Chu-Carroll
The picture pretty much says it all, but here is a link to the blog post:
http://scienceblogs.com/goodmath/2008/07/30/solving-tictactoe-game-tree-ba/