Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Draw Detection by Move Repetition Procedure -- Comments

Author: vladan

Date: 06:05:55 08/02/04

Go up one level in this thread


On August 02, 2004 at 08:11:41, Gerd Isenberg wrote:

><snip>
>
>>The orthodox C programmers will never understand the difference between 1
>>million and 2 million positions per second :)   (or Deep Blue’s 200 millions
>>per.sec.)
>
>Have tried your algorithm with C?
>Todays compiler are aware of lot of optimization tricks as well
>- and it becomes harder and harder to outperform them with assembly,
>specially using pure 16-bit assembly code ;-)
>
>Gerd
>
>>
>>
>>regards,
>>
>>Vladan




Of course, just a small joke.

In Axon, believe or not,  everything else except the core engine functions is
written in Delphi !

My opinion is that hybrid software architecture : Pascal or C for higher
recursive functions, PVS,null move etc. and machine language for the move
generator, evaluator, Qsearch… is the right combination.

In Axon the about 4000 lines are written in Delphi.

But all crucial speed-depended functions are enclosed in 50000 assembly lines !



Vladan









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.