Huberman

toc
 * Home * Engines * Huberman**

the Ph.D. thesis program by Barbara Liskov (née Huberman) written in 1968 at Stanford University, under supervision of John McCarthy, to play certain chess endgames with pieces versus the lonesome king. Barbara Huberman used heuristics to drive the lonesome king away from the center and for K,B,N into the right corner, and most notably already proposed the Killer Heuristic for early refutations of the alpha-beta search. She further elaborated on the implications of these endings with different board sizes, even an infinite board.
 * Huberman**, (Huberman's program)

=Quotes= Alex Bell in //Games Playing with Computers// on Huberman's program :

||

=Publications=
 * Barbara J. Huberman (**1968**). //A Program to Play Chess End Games//. Technical Report no. CS-106, Ph.D. thesis. Stanford University, Computer Science Department
 * Alex Bell (**1972**). //[|Games Playing with Computers]//. [|Allen & Unwin], ISBN-13: 978-0080212227, [|Chess programs: Huberman]
 * John McCarthy (**1990**). //Chess as the Drosophila of AI.// Computers, Chess, and Cognition, pp. 227-237

=Forum Posts=
 * [|evaluating KNNN-K] by Rafael B. Andrist, CCC, November 18, 2001

=References= =What links here?= include page="Huberman" component="backlinks" limit="40"
 * Up one Level**