도서관에서 사본 찾기
해당항목을 보유하고 있는 도서관을 찾는 중
|모든 저자 / 참여자:||
David Applegate; Guy J Jacobson; Daniel D Sleator
|설명:||19 p. : ill. ; 28 cm.|
|일련 제목:||Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-91-144.|
|책임:||David Applegate, Guy Jacobson, Daniel Sleator.|
But the truly innovative feature is our representation of game positions, which provides enough information to generate moves and has the property that many different planar graphs collapse into the same representation. This has an enormous impact on the speed of the search. The complexity of n-spot Sprouts grows extremely rapidly with n. According to Gardner [7, page 7], Conway estimated that analysis of the eight-spot game was beyond the reach of present-day computers. Before our program, even the value of the seven-spot game was unknown; we have calculated the value of all games up to and including eleven spots.
Our calculation supports the Sprouts Conjecture: The first player loses if n is 0, 1 or 2 modulo 6 and wins otherwise."