Couldn't get the OS X binary to mount and I'll have to fire up a VM to try a different binary. However there is a nice txt file, Bootchess.txt that has some in

Couldn't get the OS X binary to mount and I'll have to fire up a VM to try a different binary. However there is a nice txt file, Bootchess.txt that has some interesting excerpts. I was curious if it has an AI, to which it does: " Usually the heart of any midly advanced computer chess games includes a MinMax function (or its unique call merging sister function NegaMax) called recursively evaluating both sides' possible moves and trying to minimize loss whilst maximizing captures : each evaluation pair rundown is called a "ply" in chess jargon. It can take Kasparov some 27 moves to battle a 3-ply and the champion programs competing with grandmasters usually have at least 5-ply. In the case of BootChess there is alas not enough space (512 bytes binary program size and 640 bytes RAM execution environment) for such level of sophistication. It uses a variant : while maximizing captures it tries to minimize the taxi/Manhattan distance to the opponent's black king rank. This weaker ai element combination will be named "TaxiMax" for the occasion and can be viewed as a half-ply plus."