Computer Chess Club Archives

Search

Messages

Subject: Re: Writing a meta-language to describe eval function

Author: Dan Andersson

Date: 19:56:58 07/01/03

Go up one level in this thread

 I'm partial to PRECCX. It might not be developed any more. So it's stable ;)
But it is a fully functional *very* extended BNF. Its main selling point is
inherited and synthetic attributes. And meta-production rules are allowed. One
neat thing is that you could actually do almost everything in it. A-B and
Q-search, eval, extensions and pruning if you put in an effort to do it.
http://www.afm.sbu.ac.uk/precc/

MvH Dan Andersson

• Re: Writing a meta-language to describe eval function Andrei Fortuna 06:50:50 07/02/03
  • Re: Writing a meta-language to describe eval function Vincent Diepeveen 09:31:06 07/02/03
    • Re: Writing a meta-language to describe eval function Omid David Tabibi 09:41:18 07/02/03
      • Re: Writing a meta-language to describe eval function Andrei Fortuna 10:13:04 07/02/03

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.