Changes

In his 1894 1984 Ph.D. thesis from [[University of Edinburgh]], supervised by [[Donald Michie]] <ref>[[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]</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]].