Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Hashkey collisions (typical numbers)

Author: Renze Steenhuisen

Date: 09:36:38 04/07/04

Go up one level in this thread


On April 07, 2004 at 12:16:05, Vincent Diepeveen wrote:

>On April 07, 2004 at 11:40:36, Renze Steenhuisen wrote:
>
>>
>>I understand your frustration completely! I am CS myself in Delft (as you might
>>remember) and know what you talk of...
>>
>>>Do you actually know what boundschecking means?
>>
>>However, in Delft we have (since last year) a course called Software Quality and
>>Testing of which I was the teaching assistant. So yes I know very well what
>>boundschecking is and means. And I have seen many students that didn't
>>understand what it was, or at least didn't grasp how to do it correctly!
>>
>>I could show you some code of those guys if you like, it is very shamefull!
>>
>>Cheers!
>
>I hope you give that to students in their first months when they start the
>course.
>
>Now using this course you should be able to do some debugging in your program
>and bugfix it all.

Yeah, but there are still A LOT of lines and checks to do. And I simply haven't
got the time the check it all right now... I use perft() for checking the
move-generator, do_move and undo_move on 4 positions to different depths so it
is crunching for 30 minutes or so. All tests pass.

I think I just tested the incremental hashkey as well. I have put a permanent
check in for returning to the original state, from which we were searching.

For now this is just part of my graduation project. It does not need to be
perfect and completely bug-free and monkey proof!




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.