Abstract is missing.
- FairKalah: Towards Fair Mancala PlayTodd W. Neller, Taylor C. Neller. 3-13 [doi]
- Improving Search in Go Using Bounded Static SafetyOwen Randall, Ting-Han Wei, Ryan Hayward, Martin Müller 0003. 14-23 [doi]
- An Efficient Chinese Checkers Implementation: Ranking, Bitboards, and BMI2 pext and pdep InstructionsNathan R. Sturtevant. 24-35 [doi]
- Solving Chainmail JoustingDaniel R. Collins. 39-48 [doi]
- An Algorithm for Multiplayer Games Exploiting Opponents' Interactions with the PlayerKyle Sacks, Brayden Hollis. 49-58 [doi]
- Incentivizing Information Gain in Hidden Information Multi-Action GamesNathan Lervold, Gilbert L. Peterson, David W. King. 59-69 [doi]
- QBF Solving Using Best First SearchYifan He, Abdallah Saffidine. 73-86 [doi]
- Oware is Strongly SolvedXavier A. P. Blanvillain. 87-96 [doi]
- Solving Impartial SET Using Knowledge and Combinatorial Game TheoryJos W. H. M. Uiterwijk, Lianne V. Hufkens. 97-108 [doi]
- Which Rules for Mu Torere?Cameron Browne. 111-120 [doi]
- Measuring Board Game DistanceMatthew Stephenson, Dennis J. N. J. Soemers, Éric Piette, Cameron Browne. 121-130 [doi]
- Improving Computer Play in Skat with Hope CardsStefan Edelkamp. 133-145 [doi]
- Batch Monte Carlo Tree SearchTristan Cazenave. 146-162 [doi]
- Towards Transparent Cheat Detection in Online Chess: An Application of Human and Computer Decision-Making PreferencesThijs Laarhoven, Aditya Ponukumati. 163-180 [doi]
- Procedural Generation of Rush Hour LevelsGaspard de Batz de Trenquelleon, Ahmed Choukarah, Milo Roucairol, Maël Addoum, Tristan Cazenave. 181-190 [doi]