This is Chapter 1 of The Boise Problem Book. The first paragraph reads:
The games considered here are all of infinite length and, given perfect information, determined. Being of infinite length, these games already severely tax the endurance and patience of the players. The requirement of perfect information puts an additional strain on the memory capacity of the winning player. One may ask if the winning player really requires a perfect memory.
Mathematics Subject Classification: 90D44, 03E05, 03E55, 03E60, 04A99
TeX processing requires: amssymb.sty, amsfonts.sty, euscript.sty
Editor's comment: The current version is at The Boise Problem Book.
Date received: February 16, 1996.
Date published: March 24, 1996.
Copyright © 1996 by the author. Distributed by Topology Atlas with permission of the author. Production Editor: K.P. Hart.