{"type":"ScholarlyArticle","title":"Relative Efficiency of Alpha-Beta Implementations","authors":[{"name":"T. Anthony Marsland","slug":"t-anthony-marsland","given":"T. Anthony","family":"Marsland","affiliation":""}],"abstract":"Most of the data on the relative efficiency of different implementations of the alpha-beta algorithm is neither readily available nor in a form suitable for easy comparisons. In the present study four enhancements to the alpha-beta algorithm--iterative deepening, aspiration search, memory tables and principal variation search--are compared separately and in various combinations to determine the most effective alpha-beta implementation. The rationale for this work is to ensure that new parallel algorithms incorporate the best sequential techniques. Rather than relying on simulation or searches of specially constructed trees, a simple chess program was used to provide a uniform basis for comparisons.","doi":null,"url":"https://ijcai.org/proceedings/1983/184","pdf":"https://ijcai.org/proceedings/1983/0184.pdf","markdown":"https://ijcai.org/proceedings/1983/184.md","bibtex":"https://ijcai.org/proceedings/1983/bibtex/184","volume":{"slug":"1983","title":"Proceedings of the Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1983","url":"https://ijcai.org/proceedings/1983/","year":1983,"location":"Karlsruhe, West Germany","dates":"","editors":"Alan Bundy","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Planning and Search","track":"Planning and Search","number":184,"pages":{"first":763,"last":765},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}