computer chess programming

Article View: gnu.chess

Article #2321

#2321

From: Markus Bachmayr
Date: Sat, 26 Aug 2000 00:00

9 lines
1107 bytes

i am just writing on a computer chess program for my final exams. at the
moment i am using alpha-beta pruning, minimal window search, killer and
history heuristics, a transposition table and a rather simple evaluation
function. i already have to think a bit myself to beat it, but unfortunately
i also have fairly enough time to do so because it is quite slow - what can
i do to optimize the speed, and where can i find extensive information about
mtd(f)?

thanks, markus bachmayr

Technical Details

Message-ID: <8o905l$qvo$1@news.netway.at>

Path: arc1-ca.pugleaf.net!unknown!not-for-mail

Show Full Headers

Complete Article Headers

X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 10d71d,c52d0c2d8a332d40,start
X-Google-Attributes: gid10d71d,public
From: "Markus Bachmayr" <m.bachmayr@direkt.at>
Subject: computer chess programming
Date: 2000/08/26
Message-ID: <8o905l$qvo$1@news.netway.at>
X-Deja-AN: 662782459
X-Priority: 3
X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2919.6600
X-Complaints-To: abuse@netway.at
X-Trace: news.netway.at 967312373 27640 212.27.93.162 (26 Aug 2000 17:52:53 GMT)
Organization: NETWAY AG (Customer)
X-MSMail-Priority: Normal
NNTP-Posting-Date: 26 Aug 2000 17:52:53 GMT
Newsgroups: gnu.chess