Develop a chess program

Article View: gnu.chess

Article #143

#143

From: Juergen Lang
Date: Mon, 16 Nov 1992 14:26

19 lines
1140 bytes

Hi everybody out there!

I am developing a chessprogram for quite a while now. I have passed all basic 
problems like testing for illegal moves, making a tree list and so on. The
program is now able to play "a game", but it is not too successful.

My question is: I am searching for useable algorithms to improve:

1. Alpha-Beta pruning
2. Hashing 
3. Valuation in certain situations. (stratetic moves). 
   Does anybody know the 'Opfermann'-strategie of playing chess?


Also I am interested to discuss cartain problems of playing chess and
chess-programing with anybody who is interested in.

Technical Details

Message-ID: <1992Nov16.152646@rbg.informatik.th-darmstadt.de>

Path:

arc1-ca.pugleaf.net!sparky!uunet!usc!sol.ctr.columbia.edu!ira.uka.de!math.fu-berlin.de!news.th-darmstadt.de!rbg.informatik.th-darmstadt.de!chess

Show Full Headers

Complete Article Headers

Newsgroups: gnu.chess
Path: arc1-ca.pugleaf.net!sparky!uunet!usc!sol.ctr.columbia.edu!ira.uka.de!math.fu-berlin.de!news.th-darmstadt.de!rbg.informatik.th-darmstadt.de!chess
From: chess@rbg.informatik.th-darmstadt.de (Juergen Lang)
Subject: Develop a chess program
Sender: news@news.th-darmstadt.de (The News System)
Message-ID: <1992Nov16.152646@rbg.informatik.th-darmstadt.de>
Date: Mon, 16 Nov 1992 14:26:46 GMT
Nntp-Posting-Host: rbhp21.rbg.informatik.th-darmstadt.de
Organization: TU Darmstadt
Keywords: Just do it!
Lines: 19