Home * People * Bert Enderton

Herbert D. (Bert) Enderton,
an American comuter scientist, software developer and game programmer. While affiliated with the Carnegie Mellon University, he worked on Go and neural nets [1], and developed the early Go program Golem [2]. As mentioned by Thomas Anantharaman, Enderton independently developed the domain independent extension heuristic of the threat extensions in 1987 [3]. In 1995, Enderton weakly solved all 6×6 openings in Hex, reporting the solutions but no algorithmic details [4] [5]. From 1995 until 2005, Bert Enderton was senior programmer at the Internet Chess Club [6].
Bert Enderton [7]

Selected Publications

Forum Posts

External Links


  1. ^ Go software available
  2. ^ Bert Enderton (1991). The Golem Go Program. CMU-CS-92-101, Carnegie Mellon University
  3. ^ Thomas Anantharaman (1991). Extension Heuristics. 1.3 Threat extension, ICCA Journal, Vol. 14, No. 2, pp. 54, private communication with Bert Enderton
  4. ^ Broderick Arneson, Ryan Hayward, Philip Henderson (2010). Solving Hex: Beyond Humans. CG 2010, pdf
  5. ^ Answers to infrequently asked questions about the game of Hex by Bert Enderton (1995)
  6. ^ Bert Enderton | LinkedIn
  7. ^ Bert Enderton's home page

What links here?

Up one level