跳到内容
Computer analysis of Sprouts 预览资料
关闭预览资料
正在查...

Computer analysis of Sprouts

著者: David Applegate; Guy J Jacobson; Daniel D Sleator
出版商: Pittsburgh, Pa. : School of Computer Science, Carnegie Mellon University, [1991]
丛书: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-91-144.
版本/格式:   图书 : 英语查看所有的版本和格式
数据库:WorldCat
提要:
Abstract: "Sprouts is a two-player pencil-and-paper game with a topological flavor. It was invented in 1967 by Michael Paterson and John Conway, and was popularized by Martin Gardner in the Mathematical Games column of Scientific American magazine [6]. We have written a computer program to analyze the n-spot game of Sprouts for general n. Our program uses a number of standard techniques to expedite adversary
评估:

(尚未评估) 0 附有评论 - 争取成为第一个。

主题
更多类似这样的

 

在图书馆查找

&AllPage.SpinnerRetrieving; 正在查找有这资料的图书馆...

详细书目

文件类型:
所有的著者/提供者: David Applegate; Guy J Jacobson; Daniel D Sleator
OCLC号码: 24129940
注意: "May 1991."
描述: 19 pages : illustrations ; 28 cm.
丛书名: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-91-144.
责任: David Applegate, Guy Jacobson, Daniel Sleator.

摘要:

Abstract: "Sprouts is a two-player pencil-and-paper game with a topological flavor. It was invented in 1967 by Michael Paterson and John Conway, and was popularized by Martin Gardner in the Mathematical Games column of Scientific American magazine [6]. We have written a computer program to analyze the n-spot game of Sprouts for general n. Our program uses a number of standard techniques to expedite adversary searches such as cutting off the search as soon as the value can be determined, and hashing previously evaluated positions.

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."

评论

用户提供的评论
正在获取GoodReads评论...
正在检索DOGObooks的评论

标签

争取是第一个!

相似资料

确认申请

你可能已经申请过这份资料。如果还是想申请,请选确认。

链接数据


<http://www.worldcat.org/oclc/24129940>
library:oclcnum"24129940"
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:contributor
schema:contributor
schema:creator
schema:datePublished"1991"
schema:description"Abstract: "Sprouts is a two-player pencil-and-paper game with a topological flavor. It was invented in 1967 by Michael Paterson and John Conway, and was popularized by Martin Gardner in the Mathematical Games column of Scientific American magazine [6]. We have written a computer program to analyze the n-spot game of Sprouts for general n. Our program uses a number of standard techniques to expedite adversary searches such as cutting off the search as soon as the value can be determined, and hashing previously evaluated positions."@en
schema:description"Our calculation supports the Sprouts Conjecture: The first player loses if n is 0, 1 or 2 modulo 6 and wins otherwise.""@en
schema:description"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."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/25635671>
schema:inLanguage"en"
schema:isPartOf
schema:name"Computer analysis of Sprouts"@en
schema:publication
schema:publisher
wdrs:describedby

Content-negotiable representations

关闭窗口

请登入WorldCat 

没有张号吗?很容易就可以 建立免费的账号.