Difference between revisions of "Erik van der Werf"

From Chessprogramming wiki
Jump to: navigation, search
Line 10: Line 10:
 
using [[Iterative Deepening|iterative deepening]] [[Alpha-Beta|alpha-beta]] search ([[Principal Variation Search|PVS]]), with [[Transposition Table|transposition tables]], [[Enhanced Transposition Cutoff|enhanced transposition cut-offs]],
 
using [[Iterative Deepening|iterative deepening]] [[Alpha-Beta|alpha-beta]] search ([[Principal Variation Search|PVS]]), with [[Transposition Table|transposition tables]], [[Enhanced Transposition Cutoff|enhanced transposition cut-offs]],
 
two [[Killer Move|killer moves]], [[History Heuristic|history heuristic]], Benson's algorithm for unconditional [https://en.wikipedia.org/wiki/Life_and_death live] <ref>[https://senseis.xmp.net/?BensonsDefinitionOfUnconditionalLife%2FVersion20100208 Benson's Definition of Unconditional Life / Version 20100208 at Sensei's Library]</ref> <ref>[[David B. Benson]] ('''1976'''). ''Life in the Game of Go''. [https://en.wikipedia.org/wiki/Information_Sciences_(journal) Information Sciences], Vol. 10, [https://webdocs.cs.ualberta.ca/~games/go/seminar/2002/020717/benson.pdf pdf]</ref>, and domain specific evaluation heuristics, futher elaborated  in his Ph.D. thesis and [[ICGA Journal]] papers.
 
two [[Killer Move|killer moves]], [[History Heuristic|history heuristic]], Benson's algorithm for unconditional [https://en.wikipedia.org/wiki/Life_and_death live] <ref>[https://senseis.xmp.net/?BensonsDefinitionOfUnconditionalLife%2FVersion20100208 Benson's Definition of Unconditional Life / Version 20100208 at Sensei's Library]</ref> <ref>[[David B. Benson]] ('''1976'''). ''Life in the Game of Go''. [https://en.wikipedia.org/wiki/Information_Sciences_(journal) Information Sciences], Vol. 10, [https://webdocs.cs.ualberta.ca/~games/go/seminar/2002/020717/benson.pdf pdf]</ref>, and domain specific evaluation heuristics, futher elaborated  in his Ph.D. thesis and [[ICGA Journal]] papers.
 +
 +
=Photos=
 +
[[FILE:magog_team_smaller.jpg|none|border|text-bottom|640px|link=http://erikvanderwerf.tengen.nl/magog.html]]
 +
The [https://www.game-ai-forum.org/icga-tournaments/program.php?id=137 Magog] team at the [[7th Computer Olympiad#Go9x9|7th Computer Olympiad 2002]]. [[Mark Winands]], [[Levente Kocsis]], [[Erik van der Werf]] <ref>[http://erikvanderwerf.tengen.nl/magog.html  MAGOG]</ref>
 +
 +
=See also=
 +
* [[Enhanced Forward Pruning]]
 +
* [[Relative History Heuristic]]
 +
* [[Jaap van den Herik#Video|Jaap van den Herik Interview]] at the [[12th Computer Olympiad#Go|12th Computer Olympiad]] June 2007
  
 
=Selected Publications=  
 
=Selected Publications=  

Revision as of 23:05, 2 November 2019

Home * People * Erik van der Werf

Erik van der Werf [1]

Erik van der Werf,
a Dutch computer scientist, principal scientist in the hearing aid industry, and master level Go player [2]. He received a M.Sc. degree in applied physics from Delft University of Technology in 1999, and defended his Ph.D. thesis on artificial intelligence for the game of Go at Maastricht University in 2005 under supervision of Jaap van den Herik and Jos Uiterwijk. Erik van der Werf is author of the Go playing programs Magog (started with Levente Kocsis and Mark Winands) [3], Steenvreter [4] and GridMaster [5]. His Mini Go Solver Migos solved 5x5 Go in 2002 [6], using iterative deepening alpha-beta search (PVS), with transposition tables, enhanced transposition cut-offs, two killer moves, history heuristic, Benson's algorithm for unconditional live [7] [8], and domain specific evaluation heuristics, futher elaborated in his Ph.D. thesis and ICGA Journal papers.

Photos

Magog team smaller.jpg

The Magog team at the 7th Computer Olympiad 2002. Mark Winands, Levente Kocsis, Erik van der Werf [9]

See also

Selected Publications

[10] [11] [12]

1999

2000 ...

2005 ...

External Links

References

Up one level