コンテンツへ移動
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.
エディション/フォーマット:   書籍 : Englishすべてのエディションとフォーマットを見る
データベース: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 No.: 24129940
注記: "May 1991."
形態 19 p. : ill. ; 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のレビューを取得中…

タグ

まずはあなたから!

類似資料

リクエストの確認

あなたは既にこの資料をリクエストしている可能性があります。このリクエストを続行してよろしければ、OK を選択してください。

リンクデータ


<http://www.worldcat.org/oclc/24129940>
library:oclcnum"24129940"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/24129940>
rdf:typeschema:Book
rdfs:seeAlso
schema:about
schema:about
schema:about
schema:about
schema:about
schema:author
schema:contributor
schema:contributor
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."
schema:description"Our calculation supports the Sprouts Conjecture: The first player loses if n is 0, 1 or 2 modulo 6 and wins otherwise.""
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."
schema:exampleOfWork<http://worldcat.org/entity/work/id/25635671>
schema:inLanguage"en"
schema:name"Computer analysis of Sprouts"
schema:numberOfPages"19"
schema:publisher
rdf:typeschema:Organization
schema:name"School of Computer Science, Carnegie Mellon University"

Content-negotiable representations

ウインドウを閉じる

WorldCatにログインしてください 

アカウントをお持ちではないですか?簡単に 無料アカウントを作成することができます。.