This repository contains code for an experimental solver for octal games, and results generated by it. It uses the sparse space phenomenon to speed up the calculation speed for octal games.
This represents an ongoing effort to replicate and extend the work of Achim Flammenkamp, who maintains the only effort known to me to find periods in three digit octal games.
http://wwwhomes.uni-bielefeld.de/achim/octal.html
Values calculated so far:
| game | n | log2(n) | period found? | max(G(n)) |
|---|---|---|---|---|
| 0.014 | 68719476736 | 36 | no ❌ | 392 |
| 0.034 | 137438953472 | 37 | no ❌ | 256 |
| 0.161 | 274877906944 | 38 | no ❌ | 158 |
| 0.167 | 1099511627776 | 40 | no ❌ | 64 |
| 0.172 | 68719476736 | 36 | no ❌ | 387 |
Files in the results subdirectory are frequencies of Sprague-Grundy values of a game.
The results are files organized as follows:
- directory is named after the game,
- frequencies of Sprague-Grundy values of a game are stored in each of the files in the directory,
- the file name is the number of heapsizes calculated (so 68719476736 contains the frequencies after calculating values from 0 to 68719476736),,
- each line in each of the files is in the following format:
nimber frequency.