The experimental and theoretical validation of a new search algorithm, with a note on the automatic generation of causal explanation
An algorithm is presented for game-tree searching that is shown under fairly general but formally specifiable conditions to be more sparing of computational resource than classical alpha-beta minimax. The algorithm was programmed in POP-2 and compared experimentally with alpha-beta searching on rand...
| Main Author: | |
|---|---|
| Other Authors: | |
| Published: |
University of Edinburgh
1984
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.347983 |