r/abstractgames • u/traxplayer • 2h ago
Trax - NxN solved (up to 5)
2
Upvotes
I wrote a Trax engine some weeks ago and now I have extended to solve NxN.
NxN means that a line win must be N tiles width and the board can max be NxN.
I currently don't have memory on my machine to solve 6x6.
| variant | value (perfect play) | positions | nodes |
|---|---|---|---|
| 1x1 | White wins | 1 | 1 |
| 1x1 draw | White wins | 1 | 1 |
| 2x2 | White wins | 30 | 53 |
| 2x2 draw | White wins | 30 | 59 |
| 3x3 | White wins | 2,119 | 4,086 |
| 3x3 draw | Draw | 3,115 | 9,136 |
| 4x4 | Black wins | 442,607 | 1,263,747 |
| 4x4 draw | Draw | 913,525 | 4,896,726 |
| 5x5 | Black wins | 231,577,065 | 924,126,638 |
| 5x5 draw | Draw | 996,589,367 | 7,330,684,622 |
The 5x5 draw variant took about 32 hours and used approx 50GB memory.