컨텐츠로 이동
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 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
schema:about
<http://id.worldcat.org/fast/1012120>
rdf:typeschema:Intangible
schema:name"Mathematical recreations"@en
schema:name"Mathematical recreations."@en
schema:about
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:name"Computer analysis of Sprouts"@en
schema:numberOfPages"19"
schema:publisher
schema:url

Content-negotiable representations

윈도우 닫기

WorldCat에 로그인 하십시오 

계정이 없으세요? 아주 간단한 절차를 통하여 무료 계정을 만드실 수 있습니다.