Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Mark H. M. Winands"'
Autor:
Maurice H. J. Bergsma, Jos W. H. M. Uiterwijk, Maarten P. D. Schadd, H. Jaap van den Jerik, Mark H. M. Winands
Publikováno v:
Information Sciences 2007, 635-642
STARTPAGE=635;ENDPAGE=642;TITLE=Information Sciences 2007
New Mathematics and Natural Computation, 4(3), 369-387. World Scientific Publishing Company
Information Sciences 2007 ISBN: 9789812709677
STARTPAGE=635;ENDPAGE=642;TITLE=Information Sciences 2007
New Mathematics and Natural Computation, 4(3), 369-387. World Scientific Publishing Company
Information Sciences 2007 ISBN: 9789812709677
Fanorona is the national board game of Madagascar. The game's complexity is approximately the same as that of checkers. In this article, we present a search-based approach for weakly solving this game. It is a well-chosen combination of Proof-Number
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642129926
ACG
Advances in Computer Games, 75-87
STARTPAGE=75;ENDPAGE=87;TITLE=Advances in Computer Games
ACG
Advances in Computer Games, 75-87
STARTPAGE=75;ENDPAGE=87;TITLE=Advances in Computer Games
Proof-number search (pns) is a powerful method for solving games and game positions. Over the years, the research on pns has steadily produced new insights and techniques. With multi-core processors becoming established in the recent past, the questi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d5c0a6d61cb90062eacd5e796e5d422d
https://doi.org/10.1007/978-3-642-12993-3_8
https://doi.org/10.1007/978-3-642-12993-3_8
Autor:
Jahn-Takeshi Saito, Mark H. M. Winands
Publikováno v:
Proceedings of the 2010 IEEE Conference on Computational Intelligence and Games, CIG2010, 203-210
STARTPAGE=203;ENDPAGE=210;TITLE=Proceedings of the 2010 IEEE Conference on Computational Intelligence and Games, CIG2010
CIG
STARTPAGE=203;ENDPAGE=210;TITLE=Proceedings of the 2010 IEEE Conference on Computational Intelligence and Games, CIG2010
CIG
Over the years, an increasing number of two-player games has been added to the list of solved games. However, solving multi-player games has so far received little, if any, attention. One of the reasons is that while two-player games have a unique ga
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5a72e145f8e36024d09445ddc2933165
https://doi.org/10.1109/ITW.2010.5593354
https://doi.org/10.1109/ITW.2010.5593354
Publikováno v:
Oppositional Concepts in Computational Intelligence ISBN: 9783540708261
Oppositional Concepts in Computational Intelligence
Oppositional Concepts in Computational Intelligence, 91-118
STARTPAGE=91;ENDPAGE=118;TITLE=Oppositional Concepts in Computational Intelligence
Oppositional Concepts in Computational Intelligence
Oppositional Concepts in Computational Intelligence, 91-118
STARTPAGE=91;ENDPAGE=118;TITLE=Oppositional Concepts in Computational Intelligence
Proof-number (pn) search is a best-first adversarial search algorithm especially suited for finding the game-theoretical value in game trees. The strategy of the algorithm may be described as developing the tree into the direction where the oppositio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ed036019aa9a4ff2b4d2679763585da5
https://doi.org/10.1007/978-3-540-70829-2_6
https://doi.org/10.1007/978-3-540-70829-2_6
Publikováno v:
Computers and Games ISBN: 9783540205456
Computers and Games
Computers and Games
The paper introduces a new proof-number (PN) search algorithm, called PDS-PN. It is a two-level search, which performs at the first level a depth-first Proof-number and Disproof-number Search (PDS), and at the second level a best-first PN search. Fir
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7e683a0b2061c938d01ea79f171c69b4
https://doi.org/10.1007/978-3-540-40031-8_5
https://doi.org/10.1007/978-3-540-40031-8_5
Publikováno v:
Theoretical Computer Science, 313, 511-525. Elsevier Science
The paper presents a new proof-number (PN) search algorithm, called PDS-PN. It is a two-level search (like PN2), which performs at the first level a depth-first proof-number and disproof-number search (PDS), and at the second level a best-first FIN s