Lloyd Shapley and chess with imperfect information

Anyone who has ever studied game theory knows the name Lloyd Shapley. Just recall Matching, Deferred-Acceptance Algorithm, Core, Market Games, Stochastic Games, Shapley value, and Shapley vector.1 But Professor Shapley was also a great lover of chess with imperfect information. Upon our first encounter at Stony Brook in 1998, I was fortunate to investigate the chess problems he set before me. In this essay I analyze some of those problems, in commemoration of Lloyd Shapley's contributions to the study of chess and chess with imperfect information.