From:	buers AT gmx DOT de (Dieter Buerssner)
Newsgroups:	comp.os.msdos.djgpp
Subject:	Re: UPX
Date:	24 May 2000 12:07:39 GMT
Lines:	22
Message-ID:	<8ggo2d.3vs4d07.0@buerssner-17104.user.cis.dfn.de>
References:	<Pine DOT SUN DOT 3 DOT 91 DOT 1000521083353 DOT 15757J-100000 AT is> <001101bfc2e7$86689ce0$5112ddcc AT lhaglund> <tPDW4.89825$55 DOT 1885086 AT news2 DOT rdc1 DOT on DOT home DOT com>
NNTP-Posting-Host:	pec-44-97.tnt3.s2.uunet.de (149.225.44.97)
Mime-Version:	1.0
X-Trace:	fu-berlin.de 959170059 1372349 149.225.44.97 (16 [17104])
X-Posting-Agent:	Hamster/1.3.13.0
User-Agent:	Xnews/03.02.04
To:	djgpp AT delorie DOT com
DJ-Gateway:	from newsgroup comp.os.msdos.djgpp
Reply-To:	djgpp AT delorie DOT com

AndrewJ wrote:

>> It was easier than it seemed. I just unziped it and draged it to upx.
>> I shrunk it too 200 kb so thats good. I sped crafty up a little bit.
>> Does anyone know any more ways to speed up crafty?

I think, that the speedup must have been due to other things (perhaps
less system load). What do you mean by a little bit?

>Rewrite the code using better methods and algorithms.  

Chess programming is probably not on topic here. So please don't
forget to CC your suggestions for better methods and algorithms
to my email adress ;) Many journal editors would also be happy
to publish them.

Seriously, IIRC, the ancestor of crafty was developed long time
ago (I believe in the 70s on cray in Fortran), and it is still
actively developed. It would be hard to find better algorithms.

-- 
Regards, Dieter

- Raw text -