Author: Tord Romstad
Date: 06:30:25 12/02/03
Go up one level in this thread
On December 02, 2003 at 08:43:53, Steven Edwards wrote: >On December 02, 2003 at 08:09:18, Kim Roper Jensen wrote: >>On December 02, 2003 at 07:44:01, Steven Edwards wrote: > >>>My program Symbolic is a serious effort, although it has a long way to go. > >>From my hazy memory I think you once told that it will be written in LISP with >>the search-functions? etc. written in C++ ... >> >>Anything you can tell about it ?? > >Languages: > > ANSI C++ and Lisp; no assembly language > >Source: > > 1197207 bytes, 38666 lines, 318 files > >Platforms: > > Linux and OpenBSD > >Data structures: > > Moves, positions, many other types organized in lists instead of fixed >length arrays > > No predefined MAXPLY; search depth is limited by time and memory > >Search (low level): > > The usual bag of tricks and a few new ones > >Search (high level): > > Pattern recognition and planning > > Ability to explain move selection process live in natural language Sounds very interesting and ambitious. I hope to see it released some day ... >Strength: > > Solves 298/300 WAC (242/300 WAC in under 1 second each) 298/300 in how much time? What hardware? 242/300 at 1 second/position seems a bit low, unless you use a slow computer. My latest version gets 289/300 at 1 second/position when running on a PIV 2.4 GHz. Tord
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.