Shannon-like games are difficult

Berge, 1973 Berlekamph, 1982 Even, 1975, A combinatorial problem which is complete in polynomial space, Proc. 7th ACM Symp. on the Theory of Computing Reisch, 1981, Hex ist PSPACE-vollständig, Acta Inform., 15, 10.1007/BF00288964 Yamasaki, 1978, Theory of division games, Publ. Res. Inst. Math. Sci., 17, 337, 10.2977/prims/1195189068 Yamasaki, 1989, Shannon switching games without terminals II, Graphs and Combin., 5, 275, 10.1007/BF01788679 Yamasaki, 1989 Y. Yamasaki, Shannon switching games without terminals III, submitted. Y. Yamasaki, A difficulty in particular Shannon-like games, Discrete Appl. Math., to appear.