🚀 go-pugleaf

In article <1990Aug30.1...@nmt.edu> dbr...@nrao.edu (Daniel Briggs)
writes about the difficulty of writing a Go-playing program.

I quote from HAKMEM (MIT AI MEMO 239, February 29, 2972). The section
about "Proposed computer programs, in order of increasing running time
(Schroeppel)". The section begins with Problem 77, and ends with:

    PROBLEM 93: Solve checkers. There are about 10 ** 12 positions.
    (Computing time currently estimated (Scroeppel) at 1 year).

    Programs below this line are considered unfeasible.

    PROBLEM 94: Solve Hex on large boards (11 to 23 an a side);
    though order 7 have been analyzed by hand. There is a
    proof that in games where having an extra move can never
    (repeat: never) hurt you, the worst the first player can
    be forced to is a draw. Thus, with Hex, in which there
    is no draw, the first player can aways win.

    PROBLEM 95: Solve chess. There are about 10 ** 40 possible
    positions; in most of them, one side is hopelessly lost.

    PROBLEM 96: Solve Go. About 10 ** 170 positions.

Good luck, and happy hacking!


-- 
Per Lindberg (The Mad Programmer)   !      __!__
Front Capital Systems, Box 5727,    !  _____(_)_____  Ceci n'est pas une Piper
11487 Stockholm, Sweden. 8-6611510  !     !  !  !