On Efficiency of Fully Probing Mechanisms in Nonogram Solving Algorithm

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Advances in Computer Games Conference (16. : 2019 : Macau) Advances in computer games
1. Verfasser:	Guo, Yan-Rong (VerfasserIn)
Weitere Verfasser:	Huang, Wei-Chiao (VerfasserIn), Yeh, Jia-Jun (VerfasserIn), Chang, Hsi-Ya (VerfasserIn), Chen, Lung-Pin (VerfasserIn), Huang, Kuo-Chan (VerfasserIn)
Format:	UnknownFormat
Sprache:	eng
Veröffentlicht:	2020
Schlagworte:
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Titel	Jahr	Verfasser
A Further Investigation of Neural Network Players for Game 2048	2020	Matsuzaki, Kiminori
Making a Better Game: The History of Cluster	2020	Schmidt, Gregory
Improving Human Players’ T-Spin Skills in Tetris with Procedural Problem Generation	2020	Oikawa, Taishi
Solving Cram Using Combinatorial Game Theory	2020	Uiterwijk, Jos W. H. M.
Reducing Partner’s Cognitive Load by Estimating the Level of Understanding in the Cooperative Game Hanabi	2020	Sato, Eisuke
Advice is Useful for Game AI: Experiments with Alpha-Beta Search Players in Shogi	2020	Takeuchi, Shogo
New Hex Patterns for Fill and Prune	2020	Fabiano, Nicolas
On Efficiency of Fully Probing Mechanisms in Nonogram Solving Algorithm	2020	Guo, Yan-Rong
On Strongly Solving Chinese Checkers	2020	Sturtevant, Nathan R.
A Novel Application for Game Tree Search - Exploiting Pruning Mechanisms for Quantified Integer Programs	2020	Hartisch, Michael
Exploiting Game Decompositions in Monte Carlo Tree Search	2020	Hufschmitt, Aline
Designing Policy Network with Deep Leaming in Turn-Based Strategy Games	2020	Kimura, Tomihiro
À Practical Introduction to the Ludii General Game Syste	2020	Browne, Cameron
Net2Net Extension for the AlphaGo Zero Algorithm	2020	Hsieh, Hsiao-Chung