25,161
edits
Changes
Created page with "'''Home * People * Kevin Coplan''' '''Kevin P. Coplan''',<br/> a British computer scientist at times affiliated with the School of Computing and Mathematics..."
'''[[Main Page|Home]] * [[People]] * Kevin Coplan'''
'''Kevin P. Coplan''',<br/>
a British computer scientist at times affiliated with the School of Computing and Mathematics at the [https://en.wikipedia.org/wiki/University_of_Bradford University of Bradford], [https://en.wikipedia.org/wiki/City_of_Bradford Bradford], [https://en.wikipedia.org/wiki/England England] <ref>[[Kevin Coplan]] ('''2001'''). ''[http://ilk.uvt.nl/icga/journal/contents/content24-1.htm#SYNTHESIS%20OF%20CHESS Synthesis of Chess and Chess-like Endgames: A Proof of Correctness]''. [[ICGA Journal#24_1|ICCA Journal, Vol. 24, No. 1]]</ref>.
His research interests in the field of computerchess covers [[Search|search algorithms]] and the synthesis of [[Endgame|endgame]] [[Knowledge|knowledge]] by [[Recursion|recursive]] optimization.
=C*=
In his 1982 contribution ''A Special-Purpose Machine for an Improved Search Algorithm for Deep Chess Combinations'' <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]]</ref>, Kevin Coplan introduced the [[NegaC*|C*]] algorithm <ref>[[Jean-Christophe Weill]] ('''1991'''). ''Experiments With the NegaC* Search - An Alternative for Othello Endgame Search.'' [[2nd Computer Olympiad#Workshop|Heuristic Programming in AI 2]]</ref>, 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]] <ref>[[Kevin Coplan]] ('''1984'''). ''[https://www.researchgate.net/publication/34992637_The_experimental_and_theoretical_validation_of_a_new_search_algorithm_with_a_note_on_the_automatic_generation_of_causual_explanations 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]</ref>, Kevin Coplan further elaborates on search algorithms making [[Leaf Node|leaf nodes]] of trees bi-valued by using an inequality test, as implemented and tested inside a chess machine dubbed [[Virgo]].
=Selected Publications=
<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]] ('''1984'''). ''[https://www.researchgate.net/publication/34992637_The_experimental_and_theoretical_validation_of_a_new_search_algorithm_with_a_note_on_the_automatic_generation_of_causual_explanations 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]] ('''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'''). ''Synthesis of Chess-like Endgames: Towards a Proof of Correctness''. [[Advances in Computer Games 9]]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Researcher|Coplan]]
'''Kevin P. Coplan''',<br/>
a British computer scientist at times affiliated with the School of Computing and Mathematics at the [https://en.wikipedia.org/wiki/University_of_Bradford University of Bradford], [https://en.wikipedia.org/wiki/City_of_Bradford Bradford], [https://en.wikipedia.org/wiki/England England] <ref>[[Kevin Coplan]] ('''2001'''). ''[http://ilk.uvt.nl/icga/journal/contents/content24-1.htm#SYNTHESIS%20OF%20CHESS Synthesis of Chess and Chess-like Endgames: A Proof of Correctness]''. [[ICGA Journal#24_1|ICCA Journal, Vol. 24, No. 1]]</ref>.
His research interests in the field of computerchess covers [[Search|search algorithms]] and the synthesis of [[Endgame|endgame]] [[Knowledge|knowledge]] by [[Recursion|recursive]] optimization.
=C*=
In his 1982 contribution ''A Special-Purpose Machine for an Improved Search Algorithm for Deep Chess Combinations'' <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]]</ref>, Kevin Coplan introduced the [[NegaC*|C*]] algorithm <ref>[[Jean-Christophe Weill]] ('''1991'''). ''Experiments With the NegaC* Search - An Alternative for Othello Endgame Search.'' [[2nd Computer Olympiad#Workshop|Heuristic Programming in AI 2]]</ref>, 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]] <ref>[[Kevin Coplan]] ('''1984'''). ''[https://www.researchgate.net/publication/34992637_The_experimental_and_theoretical_validation_of_a_new_search_algorithm_with_a_note_on_the_automatic_generation_of_causual_explanations 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]</ref>, Kevin Coplan further elaborates on search algorithms making [[Leaf Node|leaf nodes]] of trees bi-valued by using an inequality test, as implemented and tested inside a chess machine dubbed [[Virgo]].
=Selected Publications=
<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]] ('''1984'''). ''[https://www.researchgate.net/publication/34992637_The_experimental_and_theoretical_validation_of_a_new_search_algorithm_with_a_note_on_the_automatic_generation_of_causual_explanations 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]] ('''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'''). ''Synthesis of Chess-like Endgames: Towards a Proof of Correctness''. [[Advances in Computer Games 9]]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Researcher|Coplan]]
