Preliminaries

This first part has some convenient definitions from other work we've done on related problems.

Don't expect to find any enlightenment here in this section.  The only useful function is mzMoves[], which we use in this notebook to produce a structured list of all the legal moves in an octal game to a particular heap size, given its octal code as a list of integers.  For example, the code for Kayles is the list {0,7,7}.

All the code in the "Building explicit move lists from octal codes" subsection, below, could be radically simplified.  But since it works, why bother?