Skip to content

beling/tczajka-octal-games

 
 

Repository files navigation

Solving octal games

The goal here is to solve octal games and Grundy's game.

To solve these games is to find the period, if any, of the sequence of nimbers (as defined by Sprague-Grundy theorem) for consecutive heap sizes.

Some results were published in the book "Winning Ways for Your Mathematical Plays".

More results were computed by Achim Flammenkamp.

There are however still a lot of unsolved games, including Grundy's Game.

We are going to verify those results and solve some more games.

Results

Many octal games are equivalent. Look up equivalent games in the game lookup tables.

Trivial games are those that can be solved by looking at the first 1000 nimbers.

Solved games contain confirmed nontrivial results.

Unsolved games are work in progress.

Mistakes found in other people's results

In Winning Ways game locator:

  • .27 should map to .26 (rather than .06).
  • .314 should not map to .31

In Achim Flammenkamp's tables:

  • .161 should not map to .36. The first difference between these two games is at heap size 519!

About

No description, website, or topics provided.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • C++ 75.8%
  • Rust 19.7%
  • Makefile 3.8%
  • CMake 0.7%