论文信息 - Using Chunking to Solve Chess Pawn Endgames - 字舞流文

Using Chunking to Solve Chess Pawn Endgames

Murray Campbell | Hans J. Berliner | H. Berliner | Murray Campbell

[1] A. J. Palay. Searching with probabilities , 1985 .

[2] M. Newborn. PEASANT: An endgame program for kings and pawns , 1983 .

[3] T. Anthony Marsland,et al. Parallel Search of Strongly Ordered Game Trees , 1982, CSUR.

[4] H. Simon,et al. A simulation of memory for chess positions. , 1973 .

[5] H. Simon,et al. Perception in chess , 1973 .

[6] James R. Slagle,et al. Experiments With Some Programs That Search Game Trees , 1969, JACM.