Author: Ian Osgood
Date: 22:03:49 04/15/03
Go up one level in this thread
On April 15, 2003 at 20:57:14, Dan Andersson wrote: > Functional languages and search is an old match. This is one great paper from >1984: >http://www.math.chalmers.se/~rjmh/Papers/whyfp.html > >MvH Dan Andersson Thanks, Dan! That was exactly what I was looking for. Recursive game searches should make a nice proving ground for functional methods, such as lazy evaluation. I'm surprised I haven't found mention of anyone implementing this functional algorithm in a real chess program. After all, functional programmers love to brag about how much better their favorite languages are. (Maybe making a real evaluation function is too daunting.) Ian
This page took 0 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.