|
|
Conferences in DBLP
(acg)
2003 (conf/acg/2003)
- Dave Gomboc, T. Anthony Marsland, Michael Buro
Evaluation Function Tuning via Ordinal Correlation. [Citation Graph (0, 0)][DBLP]
ACG, 2003, pp:1-18 [Conf]
- Albert Xin Jiang, Michael Buro
First Experimental Results of ProbCut Applied to Chess. [Citation Graph (0, 0)][DBLP]
ACG, 2003, pp:19-32 [Conf]
- Aleksander Sadikov, Ivan Bratko, Igor Kononenko
Search versus Knowledge: An Empirical Study of Minimax on KRK. [Citation Graph (0, 0)][DBLP]
ACG, 2003, pp:33-44 [Conf]
- Ernst A. Heinz
Static Recognition of Potential Wins in KNNKB and KNNKN. [Citation Graph (0, 0)][DBLP]
ACG, 2003, pp:45-64 [Conf]
- G. McC. Haworth, R. B. Andrist
Model Endgame Analysis. [Citation Graph (0, 0)][DBLP]
ACG, 2003, pp:65-80 [Conf]
- J. A. Tamplin, G. McC. Haworth
Chess Endgames: Data and Strategy. [Citation Graph (0, 0)][DBLP]
ACG, 2003, pp:81-96 [Conf]
- Markus Enzenberger
Evaluation in Go by a Neural Network using Soft Segmentation. [Citation Graph (0, 0)][DBLP]
ACG, 2003, pp:97-108 [Conf]
- R. Vilà, Tristan Cazenave
When One Eye is Sufficient: A Static Classification. [Citation Graph (0, 0)][DBLP]
ACG, 2003, pp:109-124 [Conf]
- Akihiro Kishimoto, Martin Müller 0003
DF-PN in Go: An Application to the One-Eye Problem. [Citation Graph (0, 0)][DBLP]
ACG, 2003, pp:125-142 [Conf]
- Erik C. D. van der Werf, H. Jaap van den Herik, Jos W. H. M. Uiterwijk
Learning to Score Final Positions in the Game of Go. [Citation Graph (0, 0)][DBLP]
ACG, 2003, pp:143-158 [Conf]
- Bruno Bouzy, Bernard Helmstetter
Monte-Carlo Go Developments. [Citation Graph (0, 0)][DBLP]
ACG, 2003, pp:159-174 [Conf]
- K. Nakamura
Static Analysis by Incremental Computation in Go Programming. [Citation Graph (0, 0)][DBLP]
ACG, 2003, pp:175-192 [Conf]
- Jonathan Schaeffer, Yngvi Björnsson, Neil Burch, Robert Lake, Paul Lu, Steve Sutphen
Building the Checkers 10-piece Endgame Databases. [Citation Graph (0, 0)][DBLP]
ACG, 2003, pp:193-210 [Conf]
- Ed Trice, Gil Dodgen
The 7-piece Perfect Play Lookup Database for the Game of Checkers. [Citation Graph (0, 0)][DBLP]
ACG, 2003, pp:211-230 [Conf]
- Darse Billings, Yngvi Björnsson
Search and Knowledge in Lines of Action. [Citation Graph (0, 0)][DBLP]
ACG, 2003, pp:231-248 [Conf]
- Mark H. M. Winands, H. Jaap van den Herik, Jos W. H. M. Uiterwijk
An Evaluation Function for Lines of Action. [Citation Graph (0, 0)][DBLP]
ACG, 2003, pp:249-260 [Conf]
- Ryan Hayward, Yngvi Björnsson, Michael Johanson, Morgan Kan, Nathan Po, Jack van Rijswijck
Solving 7x7 Hex: Virtual Connections and Game-State Reduction. [Citation Graph (0, 0)][DBLP]
ACG, 2003, pp:261-278 [Conf]
- Tomoyuki Kaneko, Kazunori Yamaguchi, Satoru Kawai
Automated Identification of Patterns in Evaluation Functions. [Citation Graph (0, 0)][DBLP]
ACG, 2003, pp:279-298 [Conf]
- Jens Lieberum
An Evaluation Function for the Game of Amazons. [Citation Graph (0, 0)][DBLP]
ACG, 2003, pp:299-308 [Conf]
- H. H. L. M. Donkers, H. Jaap van den Herik, Jos W. H. M. Uiterwijk
Opponent-Model Search in Bao: Conditions for a Successful Application. [Citation Graph (0, 0)][DBLP]
ACG, 2003, pp:309-324 [Conf]
- Andrea Bolognesi, Paolo Ciancarini
Computer Programming of Kriegspiel Endings: The Case of KR versus K. [Citation Graph (0, 0)][DBLP]
ACG, 2003, pp:325-342 [Conf]
- Bernard Helmstetter, Tristan Cazenave
Searching with Analysis of Dependencies in a Solitaire Card Game. [Citation Graph (0, 0)][DBLP]
ACG, 2003, pp:343-360 [Conf]
- Michael Buro
Solving the Oshi-Zumo Game. [Citation Graph (0, 0)][DBLP]
ACG, 2003, pp:361-366 [Conf]
- Aviezri S. Fraenkel
New Games Related to Old and New Sequences. [Citation Graph (0, 0)][DBLP]
ACG, 2003, pp:367-382 [Conf]
|
