Author: Bruce Moreland
Date: 21:17:30 07/25/01
Go up one level in this thread
On July 25, 2001 at 16:21:51, Iddo Bentov wrote:
>hola..
>
>we are 3 students starting a project in AI course at university..
>
>we're thinking about ideas for a project in computer chess, we tried
>to focus on ideas that involve chess endings..
>
>so far we haven't found interesting ideas that haven't been tried
>before..
>
>our request.. if anyone has any new/interesting ideas in computer
>chess that he thought about and are worth trying.. please reply
>and tell us? the ideas don't have to be of the kind that actually
>improve the current strong chess programs.. just ideas that are
>interesting..
>
>thanks..
> iddo, itay and yan
Get a KP vs K database, figure out how to dump all the values, and write a
function that produces the same basic values ("win" for won positions, "draw"
for drawn positions) in every case, by invoking rules.
This has already been done by Don Beal a long time ago, but it might be worth
trying to see if you could do it with fewer rules. Also, I'm not certain he
checked his against an endgame database.
You could do more complicated cases if you felt up to it, but I think the odds
are high that you'd end up producing nothing. The interesting cases are 5-man
endings, but I don't think anyone has had real success with rules for even 4-man
cases (KR vs KN, for instance).
Another possibility is to figure out a way to solve "wild 7". This was
supposedly done by Hans Berliner, but I've never seen an article.
[D] 4k3/5ppp/8/8/8/8/PPP5/3K4 w - - 0 1
White to move wins.
bruce
bruce
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.