Jos Uiterwijk

Home * People * Jos Uiterwijk

Jos Uiterwijk [1] Jos Uiterwijk,

a Dutch chemist, computer games scientist, associate professor and coordinator of the computer games research group at Maastricht University [2], chess player and chair of MSV-VSM chess-club in Maastricht [3]. He holds a Ph.D. in physical chemistry in 1985, and a M.Sc. in artificial intelligence in 1988, both from University of Twente. Jos is author of the chess program Touch, co-author of the Connect Four program Victor and the Gomoku program Polygon, all competing at ICGA Tournaments [4]. In 1992, Jos introduced the Countermove Heuristic [5] and published a huge number of scientific papers on games and search topics.

Selected Publications#

[9] [10]

1985 …#

• Jos Uiterwijk (1985). Complexation of Crown Ethers with Organic Molecules: an X-ray crystallographic and molecular mechanics study. Ph.D. thesis, University of Twente, advisor Dirk Feil
• Jos Uiterwijk (1988). Conversion between Analytic and Non-Analytic Proofs in Artificial Intelligence. M.Sc. thesis University of Twente
• Jos Uiterwijk (1988). David N.L. Levy (Editor): Computer Games II. ICCA Journal, Vol. 11, No. 4
• Jos Uiterwijk (1989). Hermann Kaindl: Problemlösen durch heuristische Suche in der artificial Intelligence. ICCA Journal, Vol. 12, No. 3
• Jos Uiterwijk, Jaap van den Herik, Victor Allis (1989). A Knowledge-Based Approach to Connect Four: The Game is Over, White to Move Wins. Heuristic Programming in AI 1

1990 …#

• Jos Uiterwijk (1991). David Levy and Don Beal (eds.): Heuristic Programming in Artificial Intelligence 2. ICCA Journal, Vol. 14, No. 3
• Jos Uiterwijk (1991). Chess Results and Games of the 3rd Computer Olympiad. ICCA Journal, Vol. 14, No. 3 » 3rd Computer Olympiad
• Jos Uiterwijk (1992). Go-Moku still far from Optimality. Heuristic Programming in AI 3
• Jos Uiterwijk (1992). Knowledge and Strategies in Go-Moku. Heuristic Programming in AI 3
• Jos Uiterwijk (1992). The Countermove Heuristic. ICCA Journal, Vol. 15, No. 1
• Jos Uiterwijk (1992). Memory Efficiency in some Heuristics. ICCA Journal, Vol. 15, No. 2
• Jos Uiterwijk (1992). The AST 4th Conference on Computer Games. ICCA Journal, Vol. 15, No. 3 » 4th Computer Olympiad
• Hiroyuki Iida, Jos Uiterwijk (1992). How to Become a Shogi Grandmaster. Proceedings of The First European Shogi Workshop, Heidelberg, Germany, Vol. 1
• Dennis Breuker, Jos Uiterwijk (1992). The 12th Dutch Computer-Chess Championship. ICCA Journal, Vol. 15, No. 4 » DOCCC 1992
• Hiroyuki Iida, Jos Uiterwijk (1993). Thoughts on Grandmaster-like Strategies. Proceedings of The Second European Shogi Workshop. Shogi Deutschland and EMBL, Heidelberg, Germany.
• Hiroyuki Iida, Jos Uiterwijk, Jaap van den Herik (1993). Opponent-Model Search. Technical Reports in Computer Science, CS 93-03. Department of Computer Science, University of Limburg. ISSN 0922-8721.
• Hiroyuki Iida, Jos Uiterwijk, Jaap van den Herik, Bob Herschberg (1993). Potential Applications of Opponent-Model Search. Part 1: The Domain of Applicability. ICCA Journal, Vol. 16, No. 4
• Hiroyuki Iida, Jos Uiterwijk, Yoshiyuki Kotani (1994). Tutoring Strategy in Game Playing. Proceedings of the Game Programming Workshop in Japan ‘94 (ed. H. Matsubara), Computer Shogi Association, Kanagawa (Japanese)
• Hiroyuki Iida, Jos Uiterwijk, Jaap van den Herik, Bob Herschberg (1994). Potential Applications of Opponent-Model Search. Part 2. Risks and strategies. ICCA Journal, Vol. 17, No. 1
• Hiroyuki Iida, Jos Uiterwijk, Jaap van den Herik, Bob Herschberg (1994). Thoughts on the Application of Opponent-Model Search. Advances in Computer Chess 7
• Jos Uiterwijk, Jaap van den Herik (1994). Speculative Play in Computer Chess. Advances in Computer Chess 7
• Martin Schijf, Victor Allis, Jos Uiterwijk (1994). Proof-Number Search and Transpositions. ICCA Journal, Vol. 17, No. 2
• Dennis Breuker, Jos Uiterwijk, Jaap van den Herik (1994). Replacement Schemes for Transposition Tables. ICCA Journal, Vol. 17, No. 4

1995 …#

• Hiroyuki Iida, Yoshiyuki Kotani, Jos Uiterwijk (1995). Tutoring Strategies in Game-Tree Search. ICCA Journal, Vol. 18, No. 4, extended abstract as pdf
• Jos Uiterwijk (1996). The Kasparov - Deep Blue Match. ICCA Journal, Vol. 19, No. 1 » Kasparov versus Deep Blue 1996
• Dennis Breuker, Jos Uiterwijk, Jaap van den Herik (1996). Replacement Schemes and Two-Level Tables. ICCA Journal, Vol. 19, No. 3
• Hiroyuki Iida, Jos Uiterwijk, Jaap van den Herik (1996). A Game-Tree Model Including an Opponent Model. Proceedings of the Eighth Dutch Conference on Artificial Intelligence (NAIC'96) (eds. J.-J.Ch. Meyer and L.C. van der Gaag)
• Hitoshi Matsubara, Hiroyuki Iida, Jos Uiterwijk (1996). A Shogi-Computer Test Set. ACM Conference on Computer Science
• Dennis Breuker, Jos Uiterwijk, Jaap van den Herik (1997). Information in Transposition Tables. Advances in Computer Chess 8
• Hiroyuki Iida, Yoshiyuki Kotani, Jos Uiterwijk, Jaap van den Herik (1997). Gains and Risks of OM Search. Advances in Computer Chess 8
• Dennis Breuker, Jaap van den Herik, Jos Uiterwijk, Victor Allis (1998). A Solution to the GHI Problem for Best-First Search. CG 1998
• Xinbo Gao, Hiroyuki Iida, Jos Uiterwijk, Jaap van den Herik (1998). A Speculative Strategy. CG 1998
• Hiroyuki Iida, Jin Yoshimura, Kazuro Morita, Jos Uiterwijk (1998). Retrograde Analysis of the KGK Endgame in Shogi: Its Implications for Ancient Heian Shogi. CG 1998
• Jan van Reek, Jos Uiterwijk, Jaap van den Herik (1998). Planning a Strategy in Chess. ICCA Journal, Vol. 21, No. 3, pdf
• Jan van Reek, Jos Uiterwijk, Jaap van den Herik (1999). Two Strategic Shortcomings in Chess Programs. ICCA Journal, Vol. 22, No. 4, pdf

2000 …#

• Dennis Breuker, Jos Uiterwijk, Jaap van den Herik (2000). Solving 8 × 8 Domineering. Theoretical Computer Science, Vol. 230
• Jos Uiterwijk (ed.) (2000). The Fifth Computer Olympiad; Computer-Games Workshop Proceedings. Technical report CS 00-03, IKAT, Maastricht University

Patrick Hensgens, Jos Uiterwijk (2000). A Knowledge-Based Approach of Amazons. 5th Computer Olympiad Workshop Geoffrey Irving, Jeroen Donkers, Jos Uiterwijk (2000). Solving Kalah. 5th Computer Olympiad Workshop » Solving Kalah [11] Mark Winands, Jos Uiterwijk (2000). Analysis and Implementation of Lines of Action. 5th Computer Olympiad Workshop, pdf

• Jos Uiterwijk, Jaap van den Herik (2000). The advantage of the initiative. Information Sciences, Vol. 122, No. 1
• H. Watanabe, Hiroyuki Iida, Jos Uiterwijk (2000). Automatic Composition of Shogi Mating Problems. in Jaap van den Herik, Hiroyuki Iida (eds.) (2000). Games in AI Research.
• Hiroyuki Iida, Jos Uiterwijk, Jaap van den Herik. (2000). Cooperative Strategies for Pair Playing. in Jaap van den Herik, Hiroyuki Iida (eds.) (2000). Games in AI Research.
• Jeroen Donkers, Jos Uiterwijk, Jaap van den Herik (2000). Investigating Probabilistic Opponent-Model Search. Proceedings JCIS 2000 (ed. P.P. Wang)
• Jeroen Donkers, Alex de Voogt, Jos Uiterwijk (2000). Human versus Machine Problem Solving: Winning Openings in Dakon. Accepted for publication in Board Games studies.
• Geoffrey Irving, Jeroen Donkers, Jos Uiterwijk (2000). Solving Kalah. ICGA Journal, Vol. 23, No. 3, pdf » Solving Kalah
• Patrick Hensgens, Jos Uiterwijk (2000). 8QP wins Amazons Tournament. ICGA Journal, Vol. 23, No. 3 » 5th Computer Olympiad
• Jos Uiterwijk (2000). Report on The Computer-Games Workshop. ICGA Journal, Vol. 23, No. 3 » 5th Computer Olympiad Workshop
• Jos Uiterwijk (ed.) (2000). The Fifth Computer Olympiad; Computer-Games Workshop Proceedings. Technical report CS 00-03, IKAT, Maastricht University
• Levente Kocsis, Jos Uiterwijk, Jaap van den Herik (2000). Learning Time Allocation using Neural Networks. CG 2000
• Jan van Reek, Jos Uiterwijk, Jaap van den Herik (2000). The Innovated Art of Chess Analysis. ICGA Journal, Vol. 23, No. 4

2001

• Dennis Breuker, Jos Uiterwijk, Jaap van den Herik (2001). The PN2-Search Algorithm. Advances in Computer Games 9
• Nobusuke Sasaki, M. Hirasawa, Tsuyoshi Hashimoto, Hiroyuki Iida, Jos Uiterwijk, Jaap van den Herik (2001). Hira, a Four-handed Shogi Program. Advances in Computer Games 9
• Jan van Reek, Jos Uiterwijk (2001). The Match Van der Wiel vs. REBEL CENTURY 3.0. ICGA Journal, Vol. 24, No. 1 » Van der Wiel, Rebel
• Mark Winands, Jos Uiterwijk, Jaap van den Herik (2001). The Quad heuristic in Lines of Action. ICGA Journal, Vol. 24, No.1
• Diederik Wentink, Jos Uiterwijk (2001). GF1 wins Gipf tournament. ICGA Journal, Vol. 24, No. 3 » 6th Computer Olympiad
• Jos Uiterwijk (ed.) (2001). The CMG Sixth Computer Olympiad: Computer-Games Workshop Proceedings. IKAT, Maastricht University

Levente Kocsis, Jos Uiterwijk (2001). Learning Move Ordering in Chess. 6th Computer Olympiad Workshop [12] Mark Winands, Jos Uiterwijk (2001). PN, PN2 and PN* in Lines of Action. 6th Computer Olympiad Workshop, pdf

• Jeroen Donkers, Jos Uiterwijk, Jaap van den Herik (2001). Probabilistic Opponent-Model Search. Information Science, Vol. 135, Nos. 3-4
• Dennis Breuker, Jaap van den Herik, Jos Uiterwijk, Victor Allis (2001). A Solution to the GHI Problem for Best-First Search. Theoretical Computer Science, Vol. 252, Nos. 1-2
• Xinbo Gao, Hiroyuki Iida, Jos Uiterwijk, Jaap van den Herik (2001). Strategies anticipating a difference in search depth using opponent-model search. Theoretical Computer Science, Vol. 252, Nos. 1–2
• Masahiro Seo, Hiroyuki Iida, Jos Uiterwijk (2001). The PN*-Search Algorithm: Applications to Tsume-Shogi. Artificial Intelligence, Vol. 129, Nos. 1-2
• Levente Kocsis, Jos Uiterwijk, Jaap van den Herik (2001). Search-independent Forward Pruning. Proceedings of the 13th Belgium-Netherlands Conference on Artificial Intelligence (BNAIC 2001) (eds. B. Kröse, M. de Rijke, G. Schreibver and M. van Someren), ps
• Levente Kocsis, Jos Uiterwijk, Jaap van den Herik (2001). Move Ordering using Neural Networks. IEA/AIE 2001, LNCS 2070
• Jeroen Donkers, Jos Uiterwijk, Jaap van den Herik (2001). Admissibility in Opponent Model Search. Proceedings BNAIC 2001 (ed. B. Kröse, M. de Rijke, G. Schreiber and M. van Someren), pdf

2002

• Erik van der Werf, Jos Uiterwijk, Jaap van den Herik (2002). Solving Ponnuki-Go on Small Boards. BNAIC’02, pdf
• Jeroen Donkers, Jos Uiterwijk, Jaap van den Herik (2002). Learning Opponent-Type Probabilities for PrOM Search. BNAIC 2002
• Mark Winands, Levente Kocsis, Jos Uiterwijk, Jaap van den Herik (2002). Temporal difference learning and the Neural MoveMap heuristic in the game of Lines of Action. GAME-ON 2002, pdf
• Jos Uiterwijk (2002). The 7th Computer Olympiad - Report on the Computer-Games Workshop. ICGA Journal, Vol. 25, No. 4 » 7th Computer Olympiad Workshop
• Jos Uiterwijk (ed.) (2002). The Seventh Computer Olympiad: Computer-Games Workshop Proceedings. CS 02-03, IKAT, Maastricht University

Mark Winands, Levente Kocsis, Jos Uiterwijk, Jaap van den Herik (2002). Learning in Lines of Action. 7th Computer Olympiad Workshop [13] [14] Jeroen Donkers, Jos Uiterwijk (2002). Programming Bao. 7th Computer Olympiad Workshop, pdf » Bao

• Mark Winands, Jos Uiterwijk, Jaap van den Herik (2002). PDS-PN: A New Proof-Number Search Algorithm: Application to Lines of Action. CG 2002
• Levente Kocsis, Jos Uiterwijk, Eric Postma, Jaap van den Herik (2002). The Neural MoveMap Heuristic in Chess. CG 2002
• Erik van der Werf, Jos Uiterwijk, Eric Postma, Jaap van den Herik (2002). Local Move Prediction in Go. CG 2002
• Jeroen Donkers, Jos Uiterwijk, Alex de Voogt (2002). Mancala Games - Topics in Artificial Intelligence and Mathematics. In Jean Retschitzki, Rosita Haddad-Zubel (eds.) (2002). Step by step. Proceedings of the 4th colloquium Board games in academia. Edition Universitaires Fribourg Suisse
• Jaap van den Herik, Jos Uiterwijk, Jack van Rijswijck (2002). Games Solved: Now and in the Future. Artificial Intelligence, Vol. 134, Nos.1-2, zipped ps
• Makoto Sakuta, Tsuyoshi Hashimoto, Jun Nagashima, Jos Uiterwijk, Hiroyuki Iida (2002). Application of the killer-tree heuristic and the lambda-search method to lines of action. [15]

2003

• Jan van Reek, Jos Uiterwijk (2003). The Match Bareev vs. Hiarcs X. ICGA Journal, Vol. 26, No. 1 » Bareev versus HIARCS 2003
• Tsuyoshi Hashimoto, Jun Nagashima, Makoto Sakuta, Jos Uiterwijk, Hiroyuki Iida (2003). Automatic realization-probability search. Internal report, Dept. of Computer Sciences, University of Shizuoka, Hamamatsu, Japan.
• Jeroen Donkers, Jos Uiterwijk, Jaap van den Herik (2003). Admissibility in Opponent-Model Search. IS Journal, in press.
• Erik van der Werf, Jaap van den Herik, Jos Uiterwijk (2003). Solving Go on Small Boards. ICGA Journal, Vol. 26, No. 2
• Levente Kocsis, Jaap van den Herik, Jos Uiterwijk (2003). Two Learning Algorithms for Forward Pruning. ICGA Journal, Vol 26, No. 3, ps
• Mark Winands, Jaap van den Herik, Jos Uiterwijk, Erik van der Werf (2003). Enhanced forward pruning. JCIS 2003
• Jeroen Donkers, Jaap van den Herik, Jos Uiterwijk (2003), Opponent Models in Bao: Conditions of a Successfull Application, Advances in Computer Games 10, pdf
• Erik van der Werf, Jaap van den Herik, Jos Uiterwijk (2003). Learning to Score Final Positions in the Game of Go. Advances in Computer Games 10, pdf

2004

• Erik van der Werf, Jaap van den Herik, Jos Uiterwijk (2004). Learning to Estimate Potential Territory in the Game of Go. CG 2004, pdf
• Jeroen Donkers, Jaap van den Herik, Jos Uiterwijk (2004). Dao: A Benchmark Game. CG 2004
• Mark Winands, Erik van der Werf, Jaap van den Herik, Jos Uiterwijk (2004). The Relative History Heuristic. CG 2004, pdf
• Jan van Reek, Jos Uiterwijk (2004). The Complete-Chess Match Stellwagen vs. Baramidze. ICGA Journal, Vol. 27, No. 2
• Jeroen Donkers, Jaap van den Herik, Jos Uiterwijk, (2004). Probabilistic Opponent-Model Search in Bao. (M. Rauterberg, ed.) Proceedings International Conference on Entertainment Computing - ICEC 2004. LNCS 3166, Springer, Berlin, pdf
• Mark Winands, Jos Uiterwijk, Jaap van den Herik (2004). An Effective Two-Level Proof-Number Search Algorithm. Theoretical Computer Science, Vol. 313, No.3, ps

2005 …#

• Jan van Reek, Jos Uiterwijk (2005). The Complete-Chess Match Stellwagen vs. Van Wely. ICGA Journal, Vol. 28, No. 2
• Jeroen Donkers, Jos Uiterwijk, Jaap van den Herik (2005). Selecting Evaluation Functions in Opponent-Model Search. Theoretical Computer Science, Vol 349, No. 2
• Erik van der Werf, Jaap van den Herik, Jos Uiterwijk (2005). Learning to score final positions in the game of Go. Theoretical Computer Science, Vol. 349, No. 2, pdf preprint
• Erik van der Werf, Mark Winands, Jaap van den Herik, Jos Uiterwijk (2005). Learning to predict life and death from Go game records. Information Sciences, Vol. 175, No. 4
• Mark Winands, Jaap van den Herik, Jos Uiterwijk, Erik van der Werf (2005). Enhanced Forward Pruning. Information Sciences, Vol. 175, No. 4, pdf preprint
• Jeroen Donkers, Jaap van den Herik, Jos Uiterwijk (2005). Similarity Pruning in PrOM Search. Advances in Computer Games 11

2006

• Jaap van den Herik, Jeroen Donkers, Jos Uiterwijk, Guillaume Chaslot, Sander Bakkes, Jahn-Takeshi Saito (2006). Intelligent Search Techniques Proof-Number Search. MICC/IKAT Universiteit Maastricht, pdf
• Jahn-Takeshi Saito, Guillaume Chaslot, Jos Uiterwijk, Jaap van den Herik (2006). Monte-Carlo Proof-Number Search for Computer Go. CG 2006
• Maarten Schadd, Mark Winands, Maurice Bergsma, Jos Uiterwijk, Jaap van den Herik (2007). Fanorona is a Draw. ICGA Journal, Vol. 30, No. 1, pdf

2007

• Jaap van den Herik, Jos Uiterwijk, Mark Winands, Maarten Schadd (eds.) (2007). Computer Games Workshop 2007. Maastricht University, MICC Technical Report Series 07-06

François van Lishout, Guillaume Chaslot, Jos Uiterwijk (2007). Monte-Carlo Tree Search in Backgammon. CGW 2007 Jahn-Takeshi Saito, Mark Winands, Jos Uiterwijk, Jaap van den Herik (2007). Grouping Nodes for Monte-Carlo Tree Search. CGW 2007, pdf

• Jeroen Noomen, Jos Uiterwijk, Jaap van den Herik (2007). The 15th World Computer Chess Championship. ICGA Journal, Vol. 30, No. 2 » WCCC 2007

2008

• Maarten Schadd, Mark Winands, Jos Uiterwijk, Jaap van den Herik, Maurice Bergsma (2008). Best Play in Fanorona Leads to Draw. New Mathematics and Natural Computation, Vol. 4, No. 3, pdf
• Guillaume Chaslot, Mark Winands, Jos Uiterwijk, Jaap van den Herik, Bruno Bouzy (2008) Progressive Strategies for Monte-Carlo Tree Search. New Mathematics and Natural Computation, Vol. 4, No. 3
• Maarten Schadd, Mark Winands, Jaap van den Herik, Guillaume Chaslot, Jos Uiterwijk (2008). Single-Player Monte-Carlo Tree Search. CG 2008, pdf

2009

• Maarten Schadd, Mark Winands, Jos Uiterwijk (2009). ChanceProbCut: Forward Pruning in Chance Nodes. in IEEE Symposium on Computational Intelligence and Games (CIG 2009), pdf

2010 …#

• Jan Stankiewicz, Mark Winands, Jos Uiterwijk (2011). Monte-Carlo Tree Search Enhancements for Havannah. Advances in Computer Games 13
• Jos Uiterwijk (2013). Perfectly Solving Domineering Boards. Workshop on Computer Games - IJCAI 2013 [16]
• Jos Uiterwijk (2014). The Impact of Safe Moves on Perfectly Solving Domineering Boards - Part 1: Analysis of and Experiments with 1-Step Safe Moves. ICGA Journal, Vol. 37, No. 2 » Domineering
• Jos Uiterwijk (2014). The Impact of Safe Moves on Perfectly Solving Domineering Boards - Part 2: Analysis of and Experiments with Multi-Step Safe Moves. ICGA Journal, Vol. 37, No. 3
• Jos Uiterwijk (2014). The Impact of Safe Moves on Perfectly Solving Domineering Boards - Part 3: Theorems and Conjectures. ICGA Journal, Vol. 37, No. 4

2015 …#

• Jos Uiterwijk (2015). Crystallisation of Domineering Snowflakes. Advances in Computer Games 14
• Jos Uiterwijk (2016). 11 x 11 Domineering is Solved: The first player wins. CG 2016
• Jos Uiterwijk (2017). Set Matching: An Enhancement of the Hales-Jewett Pairing Strategy. Advances in Computer Games 15, arXiv:1703.10678
• Jos Uiterwijk (2018). Set Matching with applications: An enhancement of the Hales–Jewett pairing strategy. ICGA Journal, Vol. 40, No. 3
• Jos Uiterwijk (2018). Construction and investigation of Cram endgame databases. CG 2018, ICGA Journal, Vol. 40, No. 4 [17]
• Jos Uiterwijk (2019). Solving Cram Using Combinatorial Game Theory. Advances in Computer Games 16

2020 …#

• Jos Uiterwijk (2021). Solving Bicoloring-Graph Games on Rectangular Boards — Part 1: Partisan Col and Snort. Advances in Computer Games 17
• Jos Uiterwijk (2021). Solving Bicoloring-Graph Games on Rectangular Boards — Part 2: Impartial Col and Snort. Advances in Computer Games 17
• Jos Uiterwijk (2021). Solving narrow Konane boards. ICGA Journal, Vol. 43, No. 3 [18]

External Links#

• Website Jos Uiterwijk
• Jos Uiterwijk - Games and AI Group
• Jos Uiterwijk’s ICGA Tournaments
• Jos Uiterwijk | LinkedIn
• Jos Uiterwijk - Max Euwe chesstournament » Jos Uiterwijk on Euwe, Max Euwe
• Bericht van het front - CSVN Nieuwe pagina 1
• Man vs Machine, Zap!Chess vs Erwin L’Ami 1:1 by Eric van Reem, ChessBase News, March 08, 2007 » Zappa - Erwin l’Ami

References#

1. ↑ Jos Uiterwijk - Games and AI Group
2. ↑ Games and AI Group
3. ↑ MSV-VSM
4. ↑ Jos Uiterwijk’s ICGA Tournaments
5. ↑ Jos Uiterwijk (1992). The Countermove Heuristic. ICCA Journal, Vol. 15, No. 1
6. ↑ Lectures - Max Euwe chesstournament
7. ↑ Jos Uiterwijk - Max Euwe chesstournament
8. ↑ Susan Polgar Chess Daily News and Information: Max Euwe Tournament
9. ↑ ICGA Reference Database
10. ↑ dblp: Jos W. H. M. Uiterwijk
11. ↑ Geoffrey Irving, Jeroen Donkers, Jos Uiterwijk (2000). Solving Kalah. ICGA Journal, Vol. 23, No. 3, pdf
12. ↑ Levente Kocsis, Jos Uiterwijk, Jaap van den Herik (2001). Move Ordering using Neural Networks. IEA/AIE 2001, LNCS 2070, pdf
13. ↑ Publications - Maastricht University
14. ↑ Mark Winands, Levente Kocsis, Jos Uiterwijk, Jaap van den Herik (2002). Temporal difference learning and the Neural MoveMap heuristic in the game of Lines of Action. GAME-ON 2002, pdf
15. ↑ ScienceDirect - Information Sciences : Application of the killer-tree heuristic and the lambda-search method to lines of action
16. ↑ Domineering from Wikipedia
17. ↑ Cram (game) from Wikipedia
18. ↑ Kōnane from Wikipedia

Up one level