Home * People * Mark Winands
photo_mark_small.jpg

Mark Henricus Maria Winands,
a Dutch computer scientist, games researcher and associate professor at Maastricht University. Along with I-Chen Wu and Tristan Cazenave, Mark is Editor-in-Chief of the ICGA Journal. He is author of various game playing programs, most notably his Lines of Action program MIA [1] [2], successfully competing at ICGA tournaments [3]. Mark researched on Proof-Number Search, and introduced Enhanced Forward Pruning [4], which applies Forward Pruning Techniques, like Null Move Pruning and Multi-Cut, not only at expected Cut-Nodes, but also at expected All-Nodes with slight modifications on a Principal Variation Search framework, and the Relative History Heuristic [5] in 2004 at the Computers and Games 2004 Conference in Ramat-Gan, an improvement of Schaeffer's History Heuristic considering Dap Hartmann's Butterfly Heuristic.
Mark Winands [6]

Mark's Programs


Selected Publications

[8] [9] [10]

2000 ...

2001
2002
2003
2004

2005 ...

2006
2007
2008
2009

2010 ...

2011
2012
2013
2014

2015 ...


External Links


References

  1. ^ Mark's LOA Homepage
  2. ^ ICGA: Lines of Action by Mark Winands
  3. ^ Mark Winands' ICGA Tournaments
  4. ^ Mark Winands, Jaap van den Herik, Jos Uiterwijk and Erik van der Werf (2003). Enhanced forward pruning. Accepted for publication. pdf
  5. ^ Mark Winands, Erik van der Werf, Jaap van den Herik, Jos Uiterwijk (2004). The Relative History Heuristic. CG 2004, pdf
  6. ^ Games and AI Group - Mark Winands
  7. ^ Mark's LOA Homepage
  8. ^ ICGA Reference Database (pdf)
  9. ^ dblp: Mark H. M. Winands
  10. ^ Mark Winands - Publications
  11. ^ Publications - Maastricht University
  12. ^ Monte Carlo in LOA by BB+, Open Chess Forum, December 30, 2010

What links here?


Up one level