Advances in Computer Games: Many Games, Many Challenges : Proceedings of the Icga/Ifip Sg16 10th Advances in Computer Games Conference (Acg 10) November 24-27, 2003, Graz, styria

by Icga; Ifip Sg16 Advances in Computer Games Conference 2003 Graz, Austr; Iida, Hiroyuki; Heinz, Ernst A.

• ISBN13: 9781402077098
• ISBN10: 1402077092
• Format: Hardcover
• Copyright: 2003-11-01
• Publisher: Springer Verlag

Summary

This book is the tenth in a well-established series, originally describing the progress of computer-chess research only. While chess has dominated AI work in intelligent game-playing for almost half a century, games presumably harder than chess, such as Go, have moved into the spotlight in recent years. The research reported on herein reflects this growing trend with just 6 out of the 24 works overall still focussing on chess, equally many concentrating on Go, and the remaining 12 relating to checkers, Lines of Action, and a variety of other games.Chess - automatic tuning of evaluation functions; modelling of, pattern recognition in, and strategies for endgame play; search and knowledge in endgames; selective pruning of the search; Go - evaluation by neural networks; incremental static analysis; machine learning for position scoring; Monte-Carlo experiments; special applications of DF-PN search; sufficiency of single eyes; Checkers and Lines of Action - endgame databases for checkers; evaluation, search, and knowledge in Lines of Action; Others - an evaluation function for Amazons; opponent-model search in Bao; searching with dependency analysis in Gaps; solving 7×7 Hex; programming of Kriegspiel endings; solving Oshi-Zumo; automatic pattern identification for Othello; new sequences and results for 2-pile subtraction games extending Wythoff's game. Advances in Computer Games: Many Games, Many Challenges comprises the proceedings of the 10th Advances in Computer Games Conference (ACG-10) that was generously sponsored by the European Union (EU), endorsed by the Specialist Group SG-16 of the International Federation for Information Processing (IFIP), organized in cooperation with Kurt Jungwirth from the University of Graz, and held in Graz, Styria, Austria, from November 24-27, 2003. Simultaneously, the 11th World Computer-Chess Championship and the 8th Computer Olympiad took place in Graz as well from November 22-30, 2003.

Table of Contents

Foreword	vii
Preface	ix
Evaluation Function Tuning via Ordinal Correlation	1	(18)
D. Gomboc, T.A. Marsland, M. Buro
First Experimental Results of ProbCut Applied to Chess	19	(14)
A.X. Jiang, M. Buro
Search versus Knowledge: An Empirical Study of Minimax on KRK	33	(12)
A. Sadikov, I. Bratko, I. Kononenko,
Static Recognition of Potential Wins in KNNKB and KNNKN	45	(20)
E.A. Heinz
Model Endgame Analysis	65	(16)
G.MCC. Haworth, R.B. Andrist
Chess Endgames: Data and Strategy	81	(16)
J.A. Tamplin, G.MCC. Haworth
Evaluation in Go by a Neural Network using Soft Segmentation	97	(12)
M. Enzenberger
When One Eye is Sufficient: A Static Classification	109	(16)
R. Vilà, T. Cazenave
DF-PN in Go: An Application to the One-Eye Problem	125	(18)
A. Kishimoto, M. Müller
Learning to Score Final Positions in the Game of Go	143	(16)
E.C.D. van der Werf, H.J. van den Herik, J.W.H.M. Uiterwijk
Monte-Carlo Go Developments	159	(16)
B. Bouzy, B. Helmstetter
Static Analysis by Incremental in Go Programming Computation	175	(18)
K. Nakamura
Building the Checkers 10-piece Endgame Databases	193	(18)
J. Schaeffer, Y Björnsson, N. Burch, R. Lake, P. Lu, S. Sutpheu
The 7-piece Perfect Play Lookup Database for the Game of Checkers	211	(20)
E. Trice, G. Dodgen
Search and Knowledge in Lines of Action	231	(18)
D. Billings, Y. Björnsson
An Evaluation Function for Lines of Action	249	(12)
M.H.M. Winands, H.J. van den Henk, J.W.H.M. Uiterwijk
Solving 7 X 7 Hex: Virtual Connections and Game-State Reduction	261	(18)
R. Hayward, Y. Björnsson, M. Johanson, M. Kan, N. Po, J. van Rijswijck
Automated Identification of Patterns in Evaluation Functions	279	(20)
T. Kaneko, K. Yamaguchi, S. Kawai
An Evaluation Function for the Game of Amazons	299	(10)
J. Lieberum
Search in Bao: Conditions for a Successful	309	(16)
H.H.L.M. Donkers, H.J. van den Henk, J.W.H.M. Uitenwijk
Computer Programming of Kriegspiel Endings: The Case of KR versus K	325	(18)
A. Bolognesi, P. Ciancarini
Searching with Analysis of Dependencies in a Solitaire Card Game	343	(18)
B. Helinstetter, T. Cazenave
Solving the Oshi-Zumo Game	361	(6)
M. Buro
New Games Related to Old and New Sequences	367
A.S. Fraenkel
Author Index	303