CPSC 370 — Doubling Nim Rules

This is a course web page of
David Casperson

Here is a binary file (executable) for a program written in C++ and compiled on galaxy.unbc.ca that plays Doubling Nim.
The program is a very simple cin/cout that reads pairs of integers representing a position, and then prints the best possible move in that situation.
Typical input consists of a pair of integers representing the last two pile sizes, for instance 36 33.
Output is typically one integer (4 in the above example) representing the winning move in that position. If there is none, NONE is output.
The code is not guaranteed to be bug-free. Thanks to Michael for finding an initial bug.