2001__2001__2001
User
Newbie
| Posts: 3 |   |
Karma: 0
|
re:Thoughts on move tree storage methods - 2006/08/20 23:57
There isn`t much risk of a stack overflow at all. Just how deep do plan to search? Any search that would overflow the stack would probably take too long to finish anyway.  ) (or you`re using way too much local memory in your Move function
Remember that you only look at one position at a time, so if even you have searched N nodes that does not mean that there are N nodes on the stack waiting to be popped. At any given moment, the only nodes on the stack are the moves leading to the position being searched, from the current position. i.e., if you are searching 10 plies deep, then the stack will be no more than 10 entries deep.
As for pruning, check out the alpha-beta algorithm (web page as before). If you search moves in the right order, it can do quite a bit of pruning.
---------
The riddles of God are more satisfying than the solutions of man.
Popular posts by 2001__2001__2001
Copying a chess position as bitm...
|
post new topic