No-Swap Renju is Solved

No-Swap Renju Game is solved with a constructive proof that the game is a sure win for Black.

Proof Files

I have split the proof(a black win game tree with all possible white moves) into two files, which could be opened by the Renlib program. You may need a computer with at least 2 gigabytes of phisical memory to open the files.

D4 openning File
I7 openning File

In case you do not have a computer with 2 gigabytes memory, here are the files with only first a few moves.

D4 first 10 moves 256M memory needed to open the file

I7 first 10 moves 256M memory needed to open the file

D4 first 5 moves

I7 first 5 moves


Professional Renju is not solved yet!

Because professional renju has a SWAP rule, the second player could ask for exchanging of colors after the first player made the 3rd move on the board. The game has not been solved yet.

Acknowledgments

Lots of work was done by renju game professionals, without their help this project is impossible to finish.

July 23 2007
Xiangdong Wen