Author: Ricardo R Santana
Date: 06:54:46 11/13/02
Hello All I ve asked in this list about the performance of chess programs in Linux and Windows. So, It seems there a lot of variable to take into account, but the main conclusion seems to be something like: even if one of them is better than the other (because of OS or compiler) the gain is about nothing. So, I asked a friend of mine from a University to make a test for me, and here are the results: Windows: Athlon XP 1700, 256 MB RAM DDR 333. Linux: Athlon 1200, 256MB de RAM DDR 266 The program he was working on was a kind of vector ordering ( Mergesort, Quicksort, Insert and Heapsor). So, he complied the program in windows and Linux. In Linux he did not optimize the code, so the simulation took 11 minutes in windows and 9 minutes in Linux. I am not sure which was the compiler he used in windows ( I am trying to recover this information). So, when he optimize the code in linux the simulation now takes 2 minutes.It seems a great improvement. Ok, vector ordering seems nothing to do with chess at all, and reading the last discution about the compiler performance it seems the above result will change nothing. But for sure, I would really like to try !! So we have access to crafty C code. So, if I want to show that the program performs better in Linux than in Windows, I think I should try to better compile both. For linux I intend to use gcc: of course there is icc (intel compiler) but I did not got results much better than in gcc for my thesis simulation. But of course I can try. For windows, is there any suggestion ? After compiling, how can I make a crafty x crafty match in a IP network ?? thanks Ricardo Sant Ana
This page took 0.01 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.