The Chess Variant Pages Menu



External Link

This is a link to an external site for: ChessV Universal Chess Program

ChessV Universal Chess Program: http://www.chessv.org/

ChessV is an open-source Universal Chess Program with graphical user-interface, capable of playing a potentially unlimited number of Chess variants, with opening book support for variants, and other features of traditional Chess programs.

Small Board Games
Standard Board (8 x 8)
  Historical Games Strange Board Games

20 Dec 2009: Link updated. Old link was:
http://www.chessv.com/

21 Nov 2016: Link updated. Old link was:
http://samiam.org/chessv


This 'link page' is meant to provide a link to another website. Note that we have no connection to, nor bear responsibility for the linked sites.

Author: Greg Strong.
Web page created: 2004-07-06. Web page last updated: 2016-11-21

Comments

This item is a computer program,
It belongs to categories: Orthodox chess, 
It was last modified on: 2016-11-21
 Author: Greg  Strong. ChessV Universal Chess ProgramThis item is a computer program,
It belongs to categories: Orthodox chess, 
It was last modified on: 2016-11-21
 Author: Greg  Strong..

Greg Strong Verified as Greg Strong wrote on None

The root folder of the source download should have the .sln Visual Studio solution file and associated project files (ChessV.vcproj).  You will need Visual Studio 2015 - the Community Edition is free.

The squares are identified by number, and they iterate first by file then by rank.  So adding 1 will go to the next file unless you are at the right edge of the board.  To advance one rank, add the number of files.

 

View

Aurelian Florea Verified as Aurelian Florea wrote on None

Hello Greg,

I don't understand the board representation.

What does nsquare +1 mean? Does it advance ranks or files? How do I advance the other one? I am assuming nsquare+nfiles for the next rank or something like this.

Thanks for your help!

View

Aurelian Florea Verified as Aurelian Florea wrote on None

Greg,

Well, there are two main reasons I'm doing this.

1. Implementing the correct promotion rule that fairy-max isn't able to do (i.e. promoting to a minor on 8th rank, also a rook at 9th rank and also a major piece (queen,griffin,aanca, archbishop,chancellor),at 10th rank)..

2. Adding the fool (imitator) that mimics the last move of the opponent.

Not sure how to do those now but I got hints for the second from the mimotaur implementation.

Technical question:

Where is the main and the .prj file? Both would help! I need the main to be able to test my creations.

View

Kevin Pacey Verified as Kevin Pacey wrote on None

Thanks Greg!

View

Greg Strong Verified as Greg Strong wrote on None

Good luck, Aurelian, that is ambitious.  Let me know if you have any questions.

For detecting Griffon/Aanaca attacks in IsSquareAttacked, I would not back up from the target square.  Instead, I would find all Griffons/Aanacas of the color, go through them one-by-one and step out from them to see if they reach the target square.  If they don't attack the target square, you can hand off to the base class implementation of IsSquareAttacked to handle everything else.

View

Number of ratings: 35, Average rating: Excellent, Number of comments: 211

List all comments and ratings for this item.

Add a comment or rating for this item.