Difference between revisions of "Kevin Coplan"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) |
||
| Line 14: | Line 14: | ||
<ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref> <ref>[https://dblp.org/pers/hd/c/Coplan:K=_P= dblp: K. P. Coplan]</ref> | <ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref> <ref>[https://dblp.org/pers/hd/c/Coplan:K=_P= dblp: K. P. Coplan]</ref> | ||
* [[Kevin Coplan]] ('''1982'''). ''[https://www.sciencedirect.com/science/article/pii/B9780080268989500061 A Special-Purpose Machine for an Improved Search Algorithm for Deep Chess Combinations]''. [[Advances in Computer Chess 3]] | * [[Kevin Coplan]] ('''1982'''). ''[https://www.sciencedirect.com/science/article/pii/B9780080268989500061 A Special-Purpose Machine for an Improved Search Algorithm for Deep Chess Combinations]''. [[Advances in Computer Chess 3]] | ||
| − | * [[Kevin Coplan]] ('''1984'''). ''[https://www. | + | * [[Kevin Coplan]] ('''1984'''). ''[https://www.era.lib.ed.ac.uk/handle/1842/6645 The experimental and theoretical validation of a new search algorithm with a note on the automatic generation of causal explanations]''. Ph.D. thesis, [[University of Edinburgh]], [https://www.era.lib.ed.ac.uk/bitstream/handle/1842/6645/Coplan1984.pdf pdf] |
* [[Kevin Coplan]] ('''1998'''). ''[https://content.iospress.com/articles/icga-journal/icg21304 Synthesis of Chess and Chess-like Endgames by Recursive Optimisation]''. [[ICGA Journal#21_3|ICCA Journal, Vol. 21, No. 3]] | * [[Kevin Coplan]] ('''1998'''). ''[https://content.iospress.com/articles/icga-journal/icg21304 Synthesis of Chess and Chess-like Endgames by Recursive Optimisation]''. [[ICGA Journal#21_3|ICCA Journal, Vol. 21, No. 3]] | ||
* [[Kevin Coplan]] ('''2001'''). ''[https://content.iospress.com/articles/icga-journal/icg24103 Synthesis of Chess and Chess-like Endgames: A Proof of Correctness]''. [[ICGA Journal#24_1|ICCA Journal, Vol. 24, No. 1]] | * [[Kevin Coplan]] ('''2001'''). ''[https://content.iospress.com/articles/icga-journal/icg24103 Synthesis of Chess and Chess-like Endgames: A Proof of Correctness]''. [[ICGA Journal#24_1|ICCA Journal, Vol. 24, No. 1]] | ||
Revision as of 18:53, 4 May 2019
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.
Contents
C*
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.
Virgo
In his 1894 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
- Kevin Coplan (1982). A Special-Purpose Machine for an Improved Search Algorithm for Deep Chess Combinations. Advances in Computer Chess 3
- Kevin Coplan (1984). The experimental and theoretical validation of a new search algorithm with a note on the automatic generation of causal explanations. Ph.D. thesis, University of Edinburgh, pdf
- 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
- ↑ Kevin Coplan (2001). Synthesis of Chess and Chess-like Endgames: A Proof of Correctness. ICCA Journal, Vol. 24, No. 1
- ↑ Kevin Coplan (1982). A Special-Purpose Machine for an Improved Search Algorithm for Deep Chess Combinations. Advances in Computer Chess 3
- ↑ Jean-Christophe Weill (1991). Experiments With the NegaC* Search - An Alternative for Othello Endgame Search. Heuristic Programming in AI 2
- ↑ Kevin Coplan (1984). The experimental and theoretical validation of a new search algorithm with a note on the automatic generation of causal explanations. Ph.D. thesis, University of Edinburgh, pdf
- ↑ ICGA Reference Database (pdf)
- ↑ dblp: K. P. Coplan
