{"type":"ScholarlyArticle","title":"The X-0-0 Heuristic in Game Tree Analysis","authors":[{"name":"J. Denbigh Starkey","slug":"j-denbigh-starkey","given":"J. Denbigh","family":"Starkey","affiliation":"Computer Science Department Wahington State University Pullman , Washington 99164"}],"abstract":"Programs for two-person games, such as chess or Go, are heavily dependent on Minimax evaluation of large game trees, which is combined with heuristics in an attempt to prune these trees as severely as possible. In particular, alpha-beta pruning, usually combined with the killer heuristic, is used in all major minimax-based programs. In this paper we shall propose a new heuristic which could be incorporated into minimax-based programs, and which should significantly increase the pruning possible during the analysis of game trees. This new heuristic, which can be combined with alpha-beta and the killer heuristic, is called the x-o-0 heuristic. The development of the heuristic was prompted by the difficulty of analyzing large game trees in Go, and is based on a formalism and extension of the Go proverb \"the enemy's play is my own key play\".","doi":null,"url":"https://ijcai.org/proceedings/1979/184","pdf":"https://ijcai.org/proceedings/1979/0184.pdf","markdown":"https://ijcai.org/proceedings/1979/184.md","bibtex":"https://ijcai.org/proceedings/1979/bibtex/184","volume":{"slug":"1979","title":"Proceedings of the Sixth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1979","url":"https://ijcai.org/proceedings/1979/","year":1979,"location":"Tokyo, Japan","dates":"August 20-23, 1979","editors":"Bruce G. Buchanan","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":184,"pages":{"first":null,"last":null},"keywords":[],"videos":[],"references":[{"position":1,"raw":"Aki S.G. and Newborn M.M. \"The principal continuation and the killer heuristic.\" Proc. of ACM National Conference, (Seattle 1977), 466-478.","title":"The principal continuation and the killer heuristic","authors":"S G Aki, M M Newborn","year":"1977","venue":"Proc. of ACM National Conference","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"Benson D.B., Starkey J.D. et. al. \"Compu- terizing the game of Go.\" Washington State Univ. Computer Science Dept. Tech. Report CS-76-031 (Pullman Wa 1976)","title":"Computerizing the game of Go","authors":"D B Benson, J D Starkey","year":"1976","venue":null,"doi":null,"url":null,"internal_url":null},{"position":3,"raw":"Davies J. 1972). \"Tesuj i.\" Is hi Press (Tokyo","title":"Tesuj i.\" Is hi Press","authors":"J Davies","year":"1972","venue":null,"doi":null,"url":null,"internal_url":null},{"position":4,"raw":"Knuth D.E. and Moore R.W. \"An alpha-beta pruning.\" Artificial 6,4 (Winter 1975), 293-326. analysis of Intelligence","title":"An alpha-beta pruning","authors":"D E Knuth, R W Moore","year":"1975","venue":"analysis of Intelligence","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"Tackett M.J. \"A pattern recognition ap- proach to tesuj i programming in Go. lt Proc. of ACM/CIPS Pacific Regional Symposium (Seattle 1976).","title":"A pattern recognition approach to tesuj i programming in Go","authors":"M J Tackett","year":"1976","venue":"Proc. of ACM/CIPS Pacific Regional Symposium","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}