Proposal and generation of endgame puzzles for an imperfect information game Geister
Authors:
- Chu-Hsuan HsuehChu-Hsuan Hsueh
- Takefumi IshiiTITakefumi Ishii
- Tsuyoshi HashimotoTHTsuyoshi Hashimoto
- Kokolo IkedaKIKokolo Ikeda
- 31 May 2024
- journal article
- research article
- Published by Elsevier in Entertainment Computing
- Vol. 52
Abstract
No abstract availableKeywords
Funding Information
- Japan Society for the Promotion of Science (JP18H03347, JP20K12121, JP20K19946, JP22K12339)
This publication has 10 references indexed in Scilit:
- Acquiring Strategies for the Board Game Geister by Regret Minimization2019
- Procedural Puzzle Generation: A SurveyIEEE Transactions on Games, 2019
- A general reinforcement learning algorithm that masters chess, shogi, and Go through self-playScience, 2018
- Procedural Content Generation via Machine Learning (PCGML)IEEE Transactions on Games, 2018
- Bitboard Methods for GamesICGA Journal: The Journal of the Computer Games Community, 2014
- Game-Tree Search Using Proof Numbers: The First Twenty YearsICGA Journal: The Journal of the Computer Games Community, 2012
- Evaluating the Aesthetics of Endgame Studies: A Computational Model of Human Aesthetic PerceptionIEEE Transactions on Computational Intelligence and AI in Games, 2012
- Search-Based Procedural Content Generation: A Taxonomy and SurveyIEEE Transactions on Computational Intelligence and AI in Games, 2011
- A DEEP IMPROVER OF TWO-MOVE CHESS MATE PROBLEMSCybernetics and Systems, 2006
- Computers and Chess-Problem CompositionICGA Journal: The Journal of the Computer Games Community, 1988