Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Computer(CPU)benchmark for chessprograms

Author: Bruce Moreland

Date: 13:26:52 01/16/98

Go up one level in this thread


If you allocate a hash table that is too large, you create the perfect
machine basher.  It will beat on your machine's virtual memory so hard
you won't be able to breathe.  Oh, and it will play chess badly, too,
assuming you can even move your mouse to enter moves.

When I was in college, every once in a while someone would do this to
the school's mini-computer for fun.  They'd make a program that would
act something like this, and it would prevent anyone from getting any
work done until the program stopped.  Sometimes the machine would get so
slugged that the program would take a very long time to figure out that
it was dead, so people would be pounding on this poor guy while he
frantically pressed ^C over and over.

If you use a hash table that is too small for the amount of time you are
searching,  the program will play less well (probably slightly less
well) than it should, but at least you can move your mouse.

bruce



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.