Author: Ian Osgood
Date: 16:46:44 04/15/03
Has there been any research to cast the core search algorithms of a chess program into a functional programming context? By functional, I mean using a language such as OCaml, Haskell, Erlang, Clean, etc. Lisp and dialects might qualify if not simply implementing an imperative alpha-beta search. The only mention I can find is some questions asked by Dan Anderson and David Rassmussen on rgcc a few years ago. Ian
This page took 0.01 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.