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

Re: Chess Moves

by gmax (Abbot)
on Jan 10, 2004 at 08:02 UTC ( #320315=note: print w/replies, xml ) Need Help??

in reply to Chess Moves

the board position exactly last 'x' moves before the check

Are you sure you are talking about chess? :) A "check" is just a move when one of the kings is attacked by a piece from the opposite side. A winning situation is when your opponent's king is "checkmated" (or when your opponent resigns).

The purpose is to create boards to solve in 'x' moves.

Those "boards" in chess are called "problems" and they propose situations where you can checkmate in X moves. Alternatively, there are situations where one side moves and achieves a winning advantage (without a given number of moves), and they are called "studies". Which ones are you referring to?

Anyway, it isn't clear what you want to achieve. If you are trying to create a program for solving a chess problem, then have a look at some chess engines (Crafty and Baby Chess in particular). If you only want to represent positions, then you may use Chess::PGN::EPD, which can validate chess positions and moves and Chess::PGN::Parse, which can parse a game annotated in Portable Game Notation.

For a sample complete chess program, try SCID, a GPL chess project written in C++.

Added references to more chess engines.

 _  _ _  _  
(_|| | |(_|><

Log In?

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://320315]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others perusing the Monastery: (3)
As of 2021-07-28 18:24 GMT
Find Nodes?
    Voting Booth?

    No recent polls found