Beefy Boxes and Bandwidth Generously Provided by pair Networks Ovid
The stupid question is the question not asked
 
PerlMonks  

Re: Parsing Chess Algebra Notation

by oha (Friar)
on May 06, 2004 at 18:43 UTC ( [id://351322]=note: print w/replies, xml ) Need Help??

This is an archived low-energy page for bots and other anonmyous visitors. Please sign up if you are a human and want to interact.


in reply to Parsing Chess Algebra Notation

I wrote a Wiki using Parse::RecDescent and i think it would be nice to write something like for chess

the logic is that you can prepare each possible statement, and for each u have to check if it is a valid move _and_ only one piece move there

the possible grammar become to P::RD, than the move check an unicity is obtained from your logic. it would be easier to add a grammar "variant" this way

Oha

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://351322]
help
Sections?
Information?
Find Nodes?
Leftovers?
    Notices?
    hippoepoptai's answer Re: how do I set a cookie and redirect was blessed by hippo!
    erzuuliAnonymous Monks are no longer allowed to use Super Search, due to an excessive use of this resource by robots.