Skip to content

Instantly share code, notes, and snippets.

@FernandoBasso

FernandoBasso/tic-tac-toe.txt

Last active October 10, 2017 23:06
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save FernandoBasso/c045690fe4d69c56550418a341debb03 to your computer and use it in GitHub Desktop.
Save FernandoBasso/c045690fe4d69c56550418a341debb03 to your computer and use it in GitHub Desktop.
Download ZIP
Raw
tic-tac-toe.txt
In this problem we want you to design a function that produces all
possible filled boards that are reachable from the current board.
In actual tic-tac-toe, O and X alternate playing. For this problem
you can disregard that. You can also assume that the players keep
placing Xs and Os after someone has won. This means that boards that
are completely filled with X, for example, are valid.
NOTE: It was said that there would be 512 possible filled in boards
following the description above.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment