Kevin Coplan

From Chessprogramming wiki
Jump to: navigation, search

Home * People * Kevin Coplan

Kevin P. Coplan,
a British computer scientist at times affiliated with the School of Computing and Mathematics at the University of Bradford, Bradford, England [1]. His research interests in the field of computerchess covers search algorithms and the synthesis of endgame knowledge by recursive optimization.


In his 1982 contribution A Special-Purpose Machine for an Improved Search Algorithm for Deep Chess Combinations [2], Kevin Coplan introduced the C* algorithm [3], to utilize Null Window searches of Fail-Soft Alpha-Beta in a bisection scheme.


In his 1984 Ph.D. thesis from University of Edinburgh, supervised by Donald Michie [4], Kevin Coplan further elaborates on search algorithms making leaf nodes of trees bi-valued by using an inequality test, as implemented and tested inside a chess machine dubbed Virgo.

Selected Publications

[5] [6]


Up one level