Mark Winands

From Chessprogramming wiki
Jump to: navigation, search

Home * People * Mark Winands

Mark Winands [1]

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, and an associate editor of IEEE Transactions on Computational Intelligence and AI in Games [2]. He is author of various game playing programs, most notably his Lines of Action program MIA [3] [4], successfully competing at ICGA tournaments [5]. Mark researched on Proof-Number Search, and introduced Enhanced Forward Pruning [6], 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 [7] 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's Programs

Selected Publications

[9] [10] [11]

2000 ...

2001

2002

2003

Mark Winands (2003). MIA IV wins Lines of Action tournament. ICGA Journal, Vol. 26, No. 4  » 8th Computer Olympiad

2004

2005 ...

2006

2007

Jahn-Takeshi Saito, Mark Winands, Jos Uiterwijk, Jaap van den Herik (2007). Grouping Nodes for Monte-Carlo Tree Search. CGW 2007
Mark Winands (2007). SIA wins Surakarta tournament. ICGA Journal, Vol. 30, No. 3 » 12th Computer Olympiad
Mark Winands (2007). 8QP wins Amazons tournament. ICGA Journal, Vol. 30, No. 3 » 12th Computer Olympiad

2008

Mark Winands (2008). SIA wins Surakarta tournament. ICGA Journal, Vol. 31, No. 3  » 13th Computer Olympiad

2009

Mark Winands (2009). Many Faces of Go wins 9x9 and 19x19 Go tournaments. ICGA Journal, Vol. 32, No. 1 » 13th Computer Olympiad

2010 ...

2011

2012

Pim Nijssen, Mark Winands (2012). An Overview of Search Techniques in Multi-Player Games. ECAI CGW 2012
Niek Den Teuling, Mark Winands (2012). Monte-Carlo Tree Search for the Simultaneous Move Game Tron. ECAI CGW 2012pdf

2013

2014

Hendrik Baier, Mark Winands (2014). Monte-Carlo Tree Search and Minimax Hybrids with Heuristic Evaluation Functions. ECAI CGW 2014
Tom Pepels, Tristan Cazenave, Mark Winands, Marc Lanctot (2014). Minimizing Simple and Cumulative Regret in Monte-Carlo Tree Search. ECAI CGW 2014

2015 ...

External Links

References

Up one level