Home * People * Kevin Coplan

Kevin P. Coplan,
a British computer scientist from the Department of Computing ^[1] at the University of Bradford, Bradford, England. His research interests covers search algorithms and the synthesis of endgame knowledge by recursive optimisation.

C*

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

Selected Publications

^[4]

• Kevin Coplan (1982). A Special-Purpose Machine for an Improved Search Algorithm for Deep Chess Combinations. Advances in Computer Chess 3
• Kevin Coplan (1998). Synthesis of Chess and Chess-like Endgames by Recursive Optimisation. ICCA Journal, Vol. 21, No. 3
• Kevin Coplan (2001). Synthesis of Chess and Chess-like Endgames: A Proof of Correctness. ICCA Journal, Vol. 24, No. 1
• Kevin Coplan (2001). Synthesis of Chess-like Endgames: Towards a Proof of Correctness. Advances in Computer Games 9

References

1. ^ Welcome to the Department of Computing at the University of Bradford
2. ^ Kevin Coplan (1982). A Special-Purpose Machine for an Improved Search Algorithm for Deep Chess Combinations. Advances in Computer Chess 3
3. ^ Jean-Christophe Weill (1991). Experiments With the NegaC* Search - An Alternative for Othello Endgame Search. Heuristic Programming in AI 2
4. ^ ICGA Reference Database (pdf)

What links here?

Up one level