Zobrazeno 1 - 10
of 95
pro vyhledávání: '"Jos W. H. M. Uiterwijk"'
Autor:
Jos W. H. M. Uiterwijk
Publikováno v:
ADVANCES IN COMPUTER GAMES, ACG 2021, 13262, 107-117
Lecture Notes in Computer Science ISBN: 9783031114878
Lecture Notes in Computer Science ISBN: 9783031114878
As a sequel to an investigation of the standard (partisan) versions of Col and Snort on rectangular boards, we defined impartial versions of both games (dubbed iCol and iSnort). These have the same coloring conditions as their partisan versions, but
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0f33eea3e0b51a716e9f39940fab441b
https://doi.org/10.1007/978-3-031-11488-5_10
https://doi.org/10.1007/978-3-031-11488-5_10
Publikováno v:
Computers and Games ISBN: 9783031340161
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d271146d227a9fe45732c0a707548e0d
https://doi.org/10.1007/978-3-031-34017-8_9
https://doi.org/10.1007/978-3-031-34017-8_9
Autor:
Jos W. H. M. Uiterwijk
Publikováno v:
ICGA Journal, 40(4), 425-437. IOS Press
In this paper we investigate the game of Cram, which is the impartial version of Domineering. We have built Cram endgame databases for all board sizes < 30 squares. We developed a program that fills the databases with their Combinatorial Game Theory
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::02b2c8c042c9c04a00f732c88c2b32e6
https://doi.org/10.3233/icg-180064
https://doi.org/10.3233/icg-180064
Autor:
Janis Griebel, Jos W. H. M. Uiterwijk
Publikováno v:
Communications in Computer and Information Science ISBN: 9783319674674
BNCAI
BNAIC 2016: Artificial Intelligence: 28th Benelux Conference on Artificial Intelligence, Amsterdam, The Netherlands, November 10–11, 2016, Revised Selected Papers, 765, 78-92
BNCAI
BNAIC 2016: Artificial Intelligence: 28th Benelux Conference on Artificial Intelligence, Amsterdam, The Netherlands, November 10–11, 2016, Revised Selected Papers, 765, 78-92
Combinatorial games are a special category of games sharingthe property that the winner is by denition the last player able to move.To solve such games two main methods are being applied. The rst is ageneral alpha-beta search with many possible enhan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d48caa962199e33d4614da0b32c77f0c
https://doi.org/10.1007/978-3-319-67468-1_6
https://doi.org/10.1007/978-3-319-67468-1_6
Autor:
Jos W. H. M. Uiterwijk
Publikováno v:
Theoretical Computer Science, 644, 143-158. Elsevier Science
In this paper we present a combinatorial game-theoretic analysis of special Domineering positions. In particular we investigate complex positions that are aggregates of simpler fragments, linked via bridging squares. We build on two theorems that exp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6596937850b56adf11deeaee709928e7
https://doi.org/10.1016/j.tcs.2016.06.030
https://doi.org/10.1016/j.tcs.2016.06.030
Autor:
Jos W. H. M. Uiterwijk
Publikováno v:
ICGA Journal, 40(3), 129-148. IOS Press
When solving k-in-a-Row games, the Hales–Jewett pairing strategy [Trans. Amer. Math. Soc. 106 (1963 ), 222–229] is a well-known strategy to prove that specific positions are (at most) a draw for the first player. For non-overlapping possible winn
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8b2d50af61466d1f1efc8950e0f453a9
https://cris.maastrichtuniversity.nl/en/publications/de1b618f-8663-4c3b-89e1-3be9a4401ce7
https://cris.maastrichtuniversity.nl/en/publications/de1b618f-8663-4c3b-89e1-3be9a4401ce7
Publikováno v:
ICGA Journal. 41:174-175
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3181adb4a2df4affd3b74219ed597265
https://doi.org/10.3233/icg-190119
https://doi.org/10.3233/icg-190119
Autor:
Michael Barton, Jos W. H. M. Uiterwijk
Publikováno v:
Theoretical Computer Science, 592, 72-86. Elsevier Science
We have constructed endgame databases for all single-component positions up to 15 squares for Domineering. These databases have been filled with exact Combinatorial Game Theory (CGT) values in canonical form. We give an overview of several interestin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f3299e8e9f76566aeb76ab2e1e3a9c66
https://doi.org/10.1016/j.tcs.2015.05.017
https://doi.org/10.1016/j.tcs.2015.05.017
Autor:
Jos W. H. M. Uiterwijk
Publikováno v:
ICGA Journal, 37(2), 97-105. IOS Press
In this article we elaborate on the importance of safe moves for perfectly solving Domineering boards. Previously we have defined perfectly solving as "solving without any search", i.e., finding a knowledge-based solution. We applied our method to th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3f176b4e25b59b2785922edb58246d07
https://doi.org/10.3233/icg-2014-37204
https://doi.org/10.3233/icg-2014-37204
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::40edcb3a946dfe700b3fb98527b628d3
https://doi.org/10.1142/S1793005708001124
https://doi.org/10.1142/S1793005708001124