Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Is this solvable by brute force?

Author: Russell Reagan

Date: 21:14:49 09/18/03

Go up one level in this thread


On September 18, 2003 at 21:04:19, Edward Seid wrote:

>Derived from Uri's game, and modified for the new rule #2.
>
>[D]4k3/pppppppp/8/8/8/8/PPPPPPPP/4K3 w - - 0 1

Hi Ed,

This has been an interesting thread to read. I think if you are going to include
kings, you should not have a rule about who reaches the last rank first (or the
2nd/7th rank). The reason that reaching the 2nd/7th rank first was meaningful is
because when there were only pawns, then the 2nd/7th ranks were as good as the
1st/8th, because no pawn could ever block another from "promoting". If you have
kings, I think it would make more sense to just see which side wins, just like
normal chess. This way, you can actually play your program against other
programs, and that is a huge part of the fun of computer chess programming! Of
course, if you allow promotion then you will have to include all of the pieces
in your move generation function, and you will basically end up writing a full
chess engine (but that's not so bad is it? you'll probably want to eventually
anyway). Anyway, good luck with your first chess playing program!



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.