摘要:
sci-hub.st 参考文章(9)
David Harel, Computers Ltd: What They Really Can't Do ,(2000)
Yishai Feldman, David Harel, Algorithmics: The Spirit of Computing ,(1987)
M. J. Friedrich, Practice Makes Perfect JAMA. ,vol. 288, pp. 2808- 2812 ,(2002) , 10.1001/JAMA.288.22.2808-JMN1211-2-1
Shigeki Iwata, Takumi Kasai, The Othello game on an n × n board is PSPACE-complete Theoretical Computer Science. ,vol. 123, pp. 329- 340 ,(1994) , 10.1016/0304-3975(94)90131-7
Aviezri S Fraenkel, David Lichtenstein, Computing a perfect strategy for n × n chess requires time exponential in n Journal of Combinatorial Theory, Series A. ,vol. 31, pp. 199- 214 ,(1981) , 10.1016/0097-3165(81)90016-9
Aviezri S. Fraenkel, M. R. Garey, T. Schaefer, Yaacov Yesha, David S. Johnson, The Complexity of Checkers on an N * N Board - Preliminary Report foundations of computer science. pp. 55- 64 ,(1978)
David Lichtenstein, Michael Sipser, GO Is Polynomial-Space Hard Journal of the ACM. ,vol. 27, pp. 393- 401 ,(1980) , 10.1145/322186.322201
Shannon, Programming a computer for playing chess Philosophical Magazine. ,vol. 41, pp. 256- 275 ,(1950)
David Harel, The Science of Computing: Exploring the Nature and Power of Algorithms ,(1989)