@Bradley_Wang
As I said, this is not an issue in this problem due to small board size.
But If the board becomes larger, such as 5 * 5, we need to consider this condition as well.
R
ryx
@ryx
18
Reputation
35
Posts
159
Profile views
0
Followers
0
Following
Posts made by ryx

RE: Valid TicTacToe State

RE: Valid TicTacToe State
Nice solution and explanation.
There is another condition: a player cannot win twice. For example[“XXX”, “ OO”, “XXX”]
is not valid because the first player wins twice.
This is not an issue in this problem due to small board size. If the board becomes larger, we need to consider this condition as well.
How do you think about this? 
RE: Cracking The Safe
@awice
In the second approach, why do we need to append zeros at the end of the algorithm?
Thanks. 
RE: Cracking The Safe
@chen806
It is a Euler Circuit problem on an (n − 1)dimensional de Bruijn graph.
So we need to cover all edges, not only all nodes.