Selective Search in an Amazons Program
Throughout at least the first two thirds of an Amazons game the number of legal moves is so great that doing a full width search is impractical. This means we must resort to some sort of selective search and in this paper we study a number of algorithms to perform forward pruning. In particular we d...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buchkapitel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 141 |
|---|---|
| container_issue | |
| container_start_page | 123 |
| container_title | |
| container_volume | 2883 |
| creator | Avetisyan, Henry Lorentz, Richard J. |
| description | Throughout at least the first two thirds of an Amazons game the number of legal moves is so great that doing a full width search is impractical. This means we must resort to some sort of selective search and in this paper we study a number of algorithms to perform forward pruning. In particular we describe techniques for selecting from the set of all legal moves a small subset of moves for look-ahead evaluation, eliminating all other moves from consideration. We then study the effects of these techniques experimentally and show which have the most potential for producing the best Amazons-playing program. |
| doi_str_mv | 10.1007/978-3-540-40031-8_9 |
| format | Book Chapter |
| fullrecord | <record><control><sourceid>proquest_pasca</sourceid><recordid>TN_cdi_pascalfrancis_primary_15692268</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>EBC3088532_15_134</sourcerecordid><originalsourceid>FETCH-LOGICAL-p269t-56dc39d654dc6c3252551b655375bf46f55d26b2caf9e97be4288e776a23bc143</originalsourceid><addsrcrecordid>eNotkMtOwzAQRc1ThNIvYJMN7Ay2x3bsJap4SZVAKqwtx3HaQJoEOyDB1-M-ZjOauXfuSAehS0puKCHFrS4UBiw4wZwQoFgZfYDOIS22Mz1EGZWUYgCuj9A02TcaI4ILeYwyAoRhXXA4RZlOFkWUImdoGuMHSQWMUckydL3wrXdj8-PzhbfBrfKmy22X363tX9_F_DX0y2DXF-iktm30032foPeH-7fZE56_PD7P7uZ4YFKPWMjKga6k4JWTDphgQtBSCgGFKGsuayEqJkvmbK29LkrPmVK-KKRlUDrKYYKudrmDjc62dbCda6IZQrO24ddQITVjUiUf3flikrqlD6bs-89oKDEbeCbRMGASD7OFZRK8dAP77NB_ffs4Gr85cr4bg23dyg6jD9FAAiWApV-GAod_BqpqPg</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype><pqid>EBC3088532_15_134</pqid></control><display><type>book_chapter</type><title>Selective Search in an Amazons Program</title><source>Springer Books</source><creator>Avetisyan, Henry ; Lorentz, Richard J.</creator><contributor>Müller, Martin ; Schaeffer, Jonathan ; Björnsson, Yngvi ; Schaeffer, Jonathan ; Müller, Martin ; Björnsson, Yngvi</contributor><creatorcontrib>Avetisyan, Henry ; Lorentz, Richard J. ; Müller, Martin ; Schaeffer, Jonathan ; Björnsson, Yngvi ; Schaeffer, Jonathan ; Müller, Martin ; Björnsson, Yngvi</creatorcontrib><description>Throughout at least the first two thirds of an Amazons game the number of legal moves is so great that doing a full width search is impractical. This means we must resort to some sort of selective search and in this paper we study a number of algorithms to perform forward pruning. In particular we describe techniques for selecting from the set of all legal moves a small subset of moves for look-ahead evaluation, eliminating all other moves from consideration. We then study the effects of these techniques experimentally and show which have the most potential for producing the best Amazons-playing program.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540205456</identifier><identifier>ISBN: 3540205454</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540400311</identifier><identifier>EISBN: 9783540400318</identifier><identifier>DOI: 10.1007/978-3-540-40031-8_9</identifier><identifier>OCLC: 934980880</identifier><identifier>LCCallNum: QA75.5-76.95</identifier><language>eng</language><publisher>Germany: Springer Berlin / Heidelberg</publisher><subject>Applied sciences ; Artificial intelligence ; Board Position ; Candidate List ; Computer science; control theory; systems ; Evaluation Function ; Exact sciences and technology ; Good Move ; Legal Move ; Pattern recognition. Digital image processing. Computational geometry ; Software ; Speech and sound recognition and synthesis. Linguistics</subject><ispartof>Computers and Games, 2003, Vol.2883, p.123-141</ispartof><rights>Springer-Verlag Berlin Heidelberg 2003</rights><rights>2004 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttps://ebookcentral.proquest.com/covers/3088532-l.jpg</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/978-3-540-40031-8_9$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/978-3-540-40031-8_9$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,4050,4051,27925,38255,41442,42511</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=15692268$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Müller, Martin</contributor><contributor>Schaeffer, Jonathan</contributor><contributor>Björnsson, Yngvi</contributor><contributor>Schaeffer, Jonathan</contributor><contributor>Müller, Martin</contributor><contributor>Björnsson, Yngvi</contributor><creatorcontrib>Avetisyan, Henry</creatorcontrib><creatorcontrib>Lorentz, Richard J.</creatorcontrib><title>Selective Search in an Amazons Program</title><title>Computers and Games</title><description>Throughout at least the first two thirds of an Amazons game the number of legal moves is so great that doing a full width search is impractical. This means we must resort to some sort of selective search and in this paper we study a number of algorithms to perform forward pruning. In particular we describe techniques for selecting from the set of all legal moves a small subset of moves for look-ahead evaluation, eliminating all other moves from consideration. We then study the effects of these techniques experimentally and show which have the most potential for producing the best Amazons-playing program.</description><subject>Applied sciences</subject><subject>Artificial intelligence</subject><subject>Board Position</subject><subject>Candidate List</subject><subject>Computer science; control theory; systems</subject><subject>Evaluation Function</subject><subject>Exact sciences and technology</subject><subject>Good Move</subject><subject>Legal Move</subject><subject>Pattern recognition. Digital image processing. Computational geometry</subject><subject>Software</subject><subject>Speech and sound recognition and synthesis. Linguistics</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540205456</isbn><isbn>3540205454</isbn><isbn>3540400311</isbn><isbn>9783540400318</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>2003</creationdate><recordtype>book_chapter</recordtype><recordid>eNotkMtOwzAQRc1ThNIvYJMN7Ay2x3bsJap4SZVAKqwtx3HaQJoEOyDB1-M-ZjOauXfuSAehS0puKCHFrS4UBiw4wZwQoFgZfYDOIS22Mz1EGZWUYgCuj9A02TcaI4ILeYwyAoRhXXA4RZlOFkWUImdoGuMHSQWMUckydL3wrXdj8-PzhbfBrfKmy22X363tX9_F_DX0y2DXF-iktm30032foPeH-7fZE56_PD7P7uZ4YFKPWMjKga6k4JWTDphgQtBSCgGFKGsuayEqJkvmbK29LkrPmVK-KKRlUDrKYYKudrmDjc62dbCda6IZQrO24ddQITVjUiUf3flikrqlD6bs-89oKDEbeCbRMGASD7OFZRK8dAP77NB_ffs4Gr85cr4bg23dyg6jD9FAAiWApV-GAod_BqpqPg</recordid><startdate>2003</startdate><enddate>2003</enddate><creator>Avetisyan, Henry</creator><creator>Lorentz, Richard J.</creator><general>Springer Berlin / Heidelberg</general><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>FFUUA</scope><scope>IQODW</scope></search><sort><creationdate>2003</creationdate><title>Selective Search in an Amazons Program</title><author>Avetisyan, Henry ; Lorentz, Richard J.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p269t-56dc39d654dc6c3252551b655375bf46f55d26b2caf9e97be4288e776a23bc143</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>2003</creationdate><topic>Applied sciences</topic><topic>Artificial intelligence</topic><topic>Board Position</topic><topic>Candidate List</topic><topic>Computer science; control theory; systems</topic><topic>Evaluation Function</topic><topic>Exact sciences and technology</topic><topic>Good Move</topic><topic>Legal Move</topic><topic>Pattern recognition. Digital image processing. Computational geometry</topic><topic>Software</topic><topic>Speech and sound recognition and synthesis. Linguistics</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Avetisyan, Henry</creatorcontrib><creatorcontrib>Lorentz, Richard J.</creatorcontrib><collection>ProQuest Ebook Central - Book Chapters - Demo use only</collection><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Avetisyan, Henry</au><au>Lorentz, Richard J.</au><au>Müller, Martin</au><au>Schaeffer, Jonathan</au><au>Björnsson, Yngvi</au><au>Schaeffer, Jonathan</au><au>Müller, Martin</au><au>Björnsson, Yngvi</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>Selective Search in an Amazons Program</atitle><btitle>Computers and Games</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>2003</date><risdate>2003</risdate><volume>2883</volume><spage>123</spage><epage>141</epage><pages>123-141</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540205456</isbn><isbn>3540205454</isbn><eisbn>3540400311</eisbn><eisbn>9783540400318</eisbn><abstract>Throughout at least the first two thirds of an Amazons game the number of legal moves is so great that doing a full width search is impractical. This means we must resort to some sort of selective search and in this paper we study a number of algorithms to perform forward pruning. In particular we describe techniques for selecting from the set of all legal moves a small subset of moves for look-ahead evaluation, eliminating all other moves from consideration. We then study the effects of these techniques experimentally and show which have the most potential for producing the best Amazons-playing program.</abstract><cop>Germany</cop><pub>Springer Berlin / Heidelberg</pub><doi>10.1007/978-3-540-40031-8_9</doi><oclcid>934980880</oclcid><tpages>19</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Computers and Games, 2003, Vol.2883, p.123-141 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_15692268 |
| source | Springer Books |
| subjects | Applied sciences Artificial intelligence Board Position Candidate List Computer science control theory systems Evaluation Function Exact sciences and technology Good Move Legal Move Pattern recognition. Digital image processing. Computational geometry Software Speech and sound recognition and synthesis. Linguistics |
| title | Selective Search in an Amazons Program |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T16%3A34%3A40IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=Selective%20Search%20in%20an%20Amazons%20Program&rft.btitle=Computers%20and%20Games&rft.au=Avetisyan,%20Henry&rft.date=2003&rft.volume=2883&rft.spage=123&rft.epage=141&rft.pages=123-141&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540205456&rft.isbn_list=3540205454&rft_id=info:doi/10.1007/978-3-540-40031-8_9&rft_dat=%3Cproquest_pasca%3EEBC3088532_15_134%3C/proquest_pasca%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540400311&rft.eisbn_list=9783540400318&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=EBC3088532_15_134&rft_id=info:pmid/&rfr_iscdi=true |