2
\$\begingroup\$

For my data structures course, we were asked to create Tic Tac Toe(3x3)that:

1) Has two player - dumb and smart(computer plays both sides)
2) Dumb player - "X" , always makes first move, and all of his moves are random.
3) Smart player - "O" relies on reinforced learning. Basically, he looks through the hash table(transposition table) created from the different game states learned from prev games and finds good move. Project specifications page has no information on the implementation of the "intelligence"

I don't understand how to handle 3). At what stage of the game, board's hash needs to be inserted into table ? How Smart player decides on his next move ?

Thanks !

\$\endgroup\$
2
\$\begingroup\$

You can find something about your problem here. It's some theory about similar project (Reinforcement Learning in Tic-Tac-Toe Game and Its Similar Variations) as you are solving.

\$\endgroup\$
  • 4
    \$\begingroup\$ -1. A link alone isn't really an answer. Please outline what the paper is talking about or at least mention the relevant keywords in your answer, so somebody can search for them if your link goes down. \$\endgroup\$ – bummzack Dec 4 '11 at 21:37
  • \$\begingroup\$ @bummzack zacharmarz gives the full title and the keywords are in that title. Certainly a more helpful answer than a downvote. \$\endgroup\$ – Hackworth Dec 5 '11 at 9:21
  • 2
    \$\begingroup\$ @Hackworth He changed his answer.. I removed the downvote. \$\endgroup\$ – bummzack Dec 5 '11 at 9:38
1
\$\begingroup\$

I don't know what your course requires, but I can think of a simple approach. You need records of game states, moves, and wins. So the smart player looks up the current game state in the record of past games and makes the move that led to the most wins. (Apologies if this is too obvious.)

\$\endgroup\$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.