algorithm - Alpha Beta Searching and Transposition Tables -


I have alpha beta search and want to apply transpization table to make it faster i am having problems In that table the entries and current status are being evaluated.

The literature I have read so far is to tell you how to store the status type, score, and some other information? Can not you use the score only until the entry in the table is more deeply recorded than the previous search?

Shows some sample code to do this, but I have not figured out that AB search returns beta when alpha> = beta will not return alpha to you?

If your hash function can produce conflicts, then you can store the situation. To make sure that the score is from a deep search, you will also need to store the position depth. And of course, you have to store the score.

For your second question ... which is known as beta cutoff, the base is that your opponent has already found a better line for himself in search and that digit is beta (negatives) Alpha, as beta for you) has been started ... When your move is tested, if you can beat the beta at any point, he does not care how much you can beat it and He left the rest in that branch H will recover. The easiest way to do this is just return the beta.


Comments

Popular posts from this blog

c# - How to capture HTTP packet with SharpPcap -

php - Multiple Select with Explode: only returns the word "Array" -

php - jQuery AJAX Post not working -