25,161
edits
Changes
no edit summary
'''Erik van der Werf''',<br/>
a Dutch computer scientist, principal scientist in the [https://en.wikipedia.org/wiki/Hearing_aid hearing aid] industry, and master level [[Go]] player <ref>[http://erikvanderwerf.tengen.nl/ Homepage of Erik van der Werf]</ref>.
He received a M.Sc. degree in [https://en.wikipedia.org/wiki/Applied_physics applied physics] from [[Delft University of Technology]] in 1999, and defended his Ph.D. thesis on [[Artificial Intelligence|artificial intelligence]] for the gameof 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 [https://www.game-ai-forum.org/icga-tournaments/program.php?id=137 Magog] (started with [[Levente Kocsis]] and [[Mark Winands]]) <ref>[http://erikvanderwerf.tengen.nl/magog.html Magog]</ref>, [https://www.game-ai-forum.org/icga-tournaments/program.php?id=519 Steenvreter] <ref>[http://erikvanderwerf.tengen.nl/steenvreter.html About Steenvreter]</ref> and GridMaster <ref>[http://erikvanderwerf.tengen.nl/gridmaster.html About GridMaster]</ref>.
His Mini Go Solver ''Migos'' solved 5x5 Go in 2002 <ref>[http://erikvanderwerf.tengen.nl/5x5/5x5solved.html 5x5 Go is solved] October 20,2002</ref>,
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.
=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=
<ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf [ICGA Journal#RefDB|ICGA Reference Database] (pdf)]</ref> <ref>[http://erikvanderwerf.tengen.nl/publications.html Publications of Erik van der Werf]</ref> <ref>[https://dblp.org/pers/hd/w/Werf:Erik_C=_D=_van_der dblp: Erik C. D. van der Werf]</ref>
==1999==
* [[Erik van der Werf]] ('''1999'''). ''Non-linear target based feature extraction by diabolo networks.'' Masters thesis. Pattern Recognition Group, Department of Applied Physics, Faculty of Applied Sciences, [[Delft University of Technology]], [http://erikvanderwerf.tengen.nl/pubdown/diabolic_thesis.pdf pdf]
