I have only 20-50 new hash table items per second during solution search in my Gomoku program. Is it correct? Should I store already taken structure and reuse it? I won't do anything without advice -- it saves me a lot of time as I noticed. Thanks.

Correction: I have only 20-50 RECURRENT hash table items per second.
I'm totally wrecked.... :(

1. Arn't you using Binary trees?

2. Stress test your program.
Take the input it can recieve (Like the checkers hash, that i told you about a few posts ago). and give it maybe a few million random ones.
See how it fares, How long it usually takes per entry, whats it collision rate?, ect.

From,
Nice coder

Perhaps you could give us a little more background information on what you are doing, and so open the thread up to help from others, who would otherwise not have a clue what you're talking about.

I understand and have played the Gomoku game, but others may not be familiar with it.
What is your board size?
What is the hash-table used for?
What do you mean by recurrences?
Are you using the minimax algorithm to find the best move?
If so, does that include alpha/beta pruning?
Are you discounting moves that aren't even touching any of the existing counters on the board to speed things up?

We'll get there, just help us to help you.

Hi imalc.

I've been helping problemsolver for a few topics now.

He's writing a go-moku game (checkers).

Recurrences is a little strange, since i adviced Problemsolver, that he/she should use a binary search tree to store the data.

Problemsolver is using minimax with alphabeta, and best-first. (i don't know how problemsolver is sorting the nodes, tho).

From,
Nice coder