Analysis of Transposition Tables and Replacement Schemes

@inproceedings{Lazar1995AnalysisOT,
  title={Analysis of Transposition Tables and Replacement Schemes},
  author={Sashi Lazar},
  year={1995}
}
A set of experiments were designed to measure the enhancement to alphabeta search using refutation and transposition tables. Results indicate that the use of transposition tables can reduce the size of the game tree by as much as 95%, significantly improving the algorithmic performance of αβ search. Seven replacement schemes to handle collisions in transposition tables were proposed and their performance measured. Based on the results of the experiment it can be concluded that for large-sized… CONTINUE READING
1 Citations
5 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-5 of 5 references

A new Hashing Method with Application for Game Playing

  • A. L. Zobrist
  • Technical report #88,
  • 1990
1 Excerpt

Notions of Evaluation Functions Tested Against Grandmaster Games

  • D. Hartmann
  • Advances in Computer Chess, Elsevier Science…
  • 1989
1 Excerpt

Similar Papers

Loading similar papers…