Implement AI Logic #1

Open
opened 2014-05-19 04:30:13 +00:00 by lewismoten · 0 comments
lewismoten commented 2014-05-19 04:30:13 +00:00 (Migrated from github.com)

Implement AI logic based on the winning strategy in Newell and Simon's 1972 tic-tac-toe program. Executing the strategy in the order provided will result in a game where the AI can not be beat.

  • win
  • block win
  • fork
  • block fork
  • take center
  • take opponents opposite corner
  • take corner
  • take side
Implement AI logic based on the [winning strategy](http://en.wikipedia.org/wiki/Tic-tac-toe#cite_ref-8) in Newell and Simon's 1972 tic-tac-toe program. Executing the strategy in the order provided will result in a game where the AI can not be beat. - [x] win - [x] block win - [x] fork - [x] block fork - [x] take center - [x] take opponents opposite corner - [x] take corner - [x] take side
Sign in to join this conversation.
No milestone
No project
No assignees
1 participant
Notifications
Due date
The due date is invalid or out of range. Please use the format "yyyy-mm-dd".

No due date set.

Dependencies

No dependencies set.

Reference
lewismoten/tic-tac-toe#1
No description provided.