Latest revision as of 22:06, 23 June 2020

Home * People * Jan-Jaap van Horssen

Jan-Jaap van Horssen ^[1]

Jan-Jaap van Horssen,
a Dutch computer scientist and as computer Draughts programmer, author of the Draughts program Maximus, Gold medal winner of the 16th Computer Olympiad 2011 ^[2], and Bronze medal winner at the 19th Computer Olympiad 2016 ^[3]. In April 2012, Maximus played a six game match versus international Draughts grandmaster Alexander Schwarzman, where Schwarzman won game two and all other five games were draws ^[4]. In his 2019 ICGAJ article Jan-Jaap van Horssen elaborates on how to obtain the best move and principal variation in MTD(f) by walking the TT, as applied in his Draughts program ^[5].

Fotos

Jan-Jaap van Horssen (2012). Schwarzman vs. MAXIMUS: A Man-Machine Match in International Draughts. ICGA Journal, Vol. 35, No. 2
Jan-Jaap van Horssen (2012). Schwarzman vs. MAXIMUS: Games 5 and 6 annotated. ICGA Journal, Vol. 35, No. 3
Jan-Jaap van Horssen (2013). The 27th Dutch Open Computer Rapid-Draughts Championship. ICGA Journal, Vol. 36, No. 4
Jan-Jaap van Horssen (2018). Handling Search Inconsistencies in MTD(f). pdf
Jan-Jaap van Horssen (2018). Complexity of checkers and draughts on different board sizes. ICGA Journal, Vol. 40, No. 4
Jan-Jaap van Horssen (2019). Move selection in MTD(f). ICGA Journal, Vol. 41, No. 1 ^[8]

@@ Line 25: / Line 25: @@
 =Postings=
 * [http://laatste.info/bb3/viewtopic.php?f=53&t=7817 Complexity of Checkers and Draughts on board sizes 6x6/8x8/10x10/12x12/14x14] by [[Jan-Jaap van Horssen]], [http://laatste.info/bb3/viewforum.php?f=53 World Draughts Forum], August 13, 2017
+* [http://laatste.info/bb3/viewtopic.php?f=53&t=7903 Handling search inconsistencies in MTD(f)] by [[Jan-Jaap van Horssen]], [http://laatste.info/bb3/viewforum.php?f=53 World Draughts Forum], February 26, 2018
 =External Links=