ข้ามไปที่เนือ้หา
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.
ครั้งที่พิมพ์/รูปแบบ:   Print book : ภาษาอังกฤษดูครั้งที่พิมพ์และรูปแบบ
ฐานข้อมูล: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 Number: 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 บทวิจารณ์

แท็ก

เป็นคนแรก.

รายการคล้ายกัน

หัวเรื่องที่เกี่ยวข้อง:(2)

ยืนยันคำขอนี้

คุณอาจะร้องขอรายการนี้แล้. โปรดเลือก ตกลง ถ้าคุณต้องการดำเนินการคำขอนี้ต่อไป.

เชิ่อมโยงข้อมูล


Primary Entity

<http://www.worldcat.org/oclc/24129940> # Computer analysis of Sprouts
    a schema:CreativeWork, schema:Book ;
    library:oclcnum "24129940" ;
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/pau> ;
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/25635671#Place/pittsburgh_pa> ; # Pittsburgh, Pa.
    schema:about <http://id.worldcat.org/fast/1012120> ; # Mathematical recreations
    schema:about <http://dewey.info/class/510.7808/> ;
    schema:about <http://id.worldcat.org/fast/937501> ; # Game theory
    schema:bookFormat bgn:PrintBook ;
    schema:contributor <http://experiment.worldcat.org/entity/work/data/25635671#Person/jacobson_guy_j> ; # Guy J. Jacobson
    schema:contributor <http://viaf.org/viaf/54241399> ; # Daniel Dominic Sleator
    schema:creator <http://viaf.org/viaf/200951665> ; # David Applegate
    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 <http://experiment.worldcat.org/entity/work/data/25635671#Series/research_paper_carnegie_mellon_university_school_of_computer_science> ; # Research paper (Carnegie Mellon University. School of Computer Science) ;
    schema:name "Computer analysis of Sprouts"@en ;
    schema:productID "24129940" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/24129940#PublicationEvent/pittsburgh_pa_school_of_computer_science_carnegie_mellon_university_1991> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/25635671#Agent/school_of_computer_science_carnegie_mellon_university> ; # School of Computer Science, Carnegie Mellon University
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/24129940> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/25635671#Agent/school_of_computer_science_carnegie_mellon_university> # School of Computer Science, Carnegie Mellon University
    a bgn:Agent ;
    schema:name "School of Computer Science, Carnegie Mellon University" ;
    .

<http://experiment.worldcat.org/entity/work/data/25635671#Person/jacobson_guy_j> # Guy J. Jacobson
    a schema:Person ;
    schema:familyName "Jacobson" ;
    schema:givenName "Guy J." ;
    schema:name "Guy J. Jacobson" ;
    .

<http://experiment.worldcat.org/entity/work/data/25635671#Place/pittsburgh_pa> # Pittsburgh, Pa.
    a schema:Place ;
    schema:name "Pittsburgh, Pa." ;
    .

<http://experiment.worldcat.org/entity/work/data/25635671#Series/research_paper_carnegie_mellon_university_school_of_computer_science> # Research paper (Carnegie Mellon University. School of Computer Science) ;
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/24129940> ; # Computer analysis of Sprouts
    schema:name "Research paper (Carnegie Mellon University. School of Computer Science) ;" ;
    schema:name "[Research paper] / Carnegie Mellon University. School of Computer Science ;" ;
    .

<http://id.worldcat.org/fast/1012120> # Mathematical recreations
    a schema:Intangible ;
    schema:name "Mathematical recreations"@en ;
    .

<http://id.worldcat.org/fast/937501> # Game theory
    a schema:Intangible ;
    schema:name "Game theory"@en ;
    .

<http://viaf.org/viaf/200951665> # David Applegate
    a schema:Person ;
    schema:familyName "Applegate" ;
    schema:givenName "David" ;
    schema:name "David Applegate" ;
    .

<http://viaf.org/viaf/54241399> # Daniel Dominic Sleator
    a schema:Person ;
    schema:birthDate "1953" ;
    schema:familyName "Sleator" ;
    schema:givenName "Daniel Dominic" ;
    schema:givenName "Daniel D." ;
    schema:name "Daniel Dominic Sleator" ;
    .


Content-negotiable representations

Close Window

กรุณาลงชื่อเข้าสู่ระบบ WorldCat 

ยังไม่มีบัญชีผู้ใช้? คุณสามารถสร้างได้อย่างง่ายดาย สร้างบัญชีผู้ใช้ฟรี.