Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Endgame tablebase"'
Autor:
Dominique Ducard
Publikováno v:
Semiotica. 2017:199-217
The comparison between a game, in particular the game of chess, and language, has a long tradition in philosophy and in language sciences. Greimas was thus following in the wake of his predecessors Saussure, Hjelmslev, and Wittgenstein when he put fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b989bf975916185798da24565bee302a
https://doi.org/10.1515/sem-2016-0201
https://doi.org/10.1515/sem-2016-0201
Autor:
Predrag Janičić, Marko Maliković
Publikováno v:
Scopus-Elsevier
Chess endgame strategies describe, in a concise and intuitive way, the rules that a player should follow to ensure a win (or a draw). Endgame strategies are useful for both computer and human players. Their correctness can be proved in several ways.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4127a13dc7bc75cb7703f6761c45bca1
https://doi.org/10.3233/icg-2013-36203
https://doi.org/10.3233/icg-2013-36203
Autor:
Richard J. Lorentz, Andrew Isaac
Publikováno v:
Computers and Games ISBN: 9783319509341
Computers and Games
Computers and Games
In the game of Breakthrough the endgame is reached when there are still many pieces on the board. This means there are too many possible positions to be able to construct a reasonable endgame tablebase on the standard 8 \(\times \) 8 board, or even o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::faf663eb9b35245f6b61114e3afa3c16
https://doi.org/10.1007/978-3-319-50935-8_1
https://doi.org/10.1007/978-3-319-50935-8_1
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
Publikováno v:
The 27th Chinese Control and Decision Conference (2015 CCDC).
In recent years, along with the further study in incomplete information chess-military chess. How to express and address the incomplete information during the process of game, deciding certain moves strategies to obtain higher winning rate increasing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f0626ee17d71f32d96017f0d1eb1aa73
https://doi.org/10.1109/ccdc.2015.7161850
https://doi.org/10.1109/ccdc.2015.7161850
Autor:
Aleksander Sadikov, Ivan Bratko
Publikováno v:
Machine Learning. 63:329-340
We propose an approach to the learning of long-term plans for playing chess endgames. We assume that a computer-generated database for an endgame is available, such as the king and rook vs. king, or king and queen vs. king and rook endgame. For each
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f283b977dc69a160d82bc0e278d8d2a4
https://doi.org/10.1007/s10994-006-6747-7
https://doi.org/10.1007/s10994-006-6747-7
Autor:
Donald F. Beal, Ren Wu
Publikováno v:
Information Sciences. 135:207-228
This paper describes an improved retrograde algorithm used for work on constructing Chinese chess endgame databases. Significant differences from databases for (western) chess are examined, and their influence on database construction noted. Results
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5c6bb146dc0aebf174eccab30e29fbbd
https://doi.org/10.1016/s0020-0255(01)00137-2
https://doi.org/10.1016/s0020-0255(01)00137-2
Publikováno v:
ICGA Journal. 23:148-162
Chess endgame tables should provide efficiently the value and depth of any required position during play. The indexing of an endgame’s positions is crucial to meeting this objective. This paper updates Heinz’ previous review of approaches to inde
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8ad6f24a2d3e5c88547a14389916663d
https://doi.org/10.3233/icg-2000-23304
https://doi.org/10.3233/icg-2000-23304
Autor:
K. S. R. Anjaneyulu
Publikováno v:
Resonance. 1:59-65
There has recently been significant interest in the area of computer chess. In February this year, Garry Kasparov, the world chess champion played a six match chess tournament withDeep Blue, the current computer chess champion. Garry Kasparov won the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bf182069afa224d2c5dfb72ca150337a
https://doi.org/10.1007/bf02837782
https://doi.org/10.1007/bf02837782
Autor:
Bao-En Guo, Hal-Tao Liu
Publikováno v:
ICMLC
In the endgame stage of Chinese Chess Computer Game (CCCG), the complexity and diversity of positions make the endgame database always very huge. Thus, it is unsuitable and inefficient to develop an intelligent search engine based on the learning for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b4632f9247e7eb7aebb239cf8df903c9
https://doi.org/10.1109/icmlc.2012.6358980
https://doi.org/10.1109/icmlc.2012.6358980