see Gigamic Quixo

see Quixo Is Solved or Quixoの強解決

We have two types of codes which solves quixo. One is in this directory.

The other one is written by François Bonnet. If you want to see the other one see here.

See Quixo Is Solved.

The total number of Win, Loss, and Draw states is written in here

You can change board size in global.cpp.

• size 4: 50 seconds
• size 3: soon
• size 2: soon

• g++ -std=c++17 -Wall -O3 from_back.cpp
• ./a.out

results are saved in results directory.

Compute the step to the end. The winner choose min, the loser choose max.
You need to run from_back.cpp at first with the same board size.

• size 4: 150 seconds
• size 3: soon
• size 2: soon

• g++ -std=c++17 -Wall -O3 search-step.cpp
• ./a.out

results are saved in results directory.

You need to run search-step.cpp at first with the same board size.
If you want to see all states result, change the comment out of the file convertResult.cpp.

• g++ -std=c++17 -Wall -O3 convertResult.cpp
• ./a.out

You can check the result using the different algorithm.
(But I think the checking algorithm is not perfect)
You need to run search-step.cpp at first with the same board size.

• g++ -std=c++17 -Wall -O3 check-result.cpp
• ./a.out

• g++ -std=c++17 -O3 -Wall reachable_state.cpp
• ./a.out

you can see the result using the function outputReachableStates or countNotReachableStates in convertResult.cpp