Local versus global tables in Minimax Game Search
Name
895674162-MIT.pdf
Description
Full printable version
Size
232.2 KB
Format
Adobe PDF
Checksum (MD5)
0d7e4bd329f7d455e57bd6e5f6f3a36b
Author(s)
Wattanawaroon, Tana
Advisor(s)
Charles E. Leiserson.
Date Issued
2014
Publisher
Massachusetts Institute of Technology
Abstract
Minimax Game Search with alpha-beta pruning can utilize heuristic tables in order to prune more branches and achieve better performance. The tables can be implemented using different memory models: global tables, worker-local tables and processor-local tables. Depending on whether each heuristic table depends on locality in the game tree, a memory model might be more suitable than others. This thesis describes an experiment that shows that local tables are generally preferable to global tables for two game heuristics used in chess-like games: killer move and best move history. The experiment is evidence that local tables might be useful for multithreaded applications, particularly ones that involve caching and exhibit locality.
Description
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014.
Cataloged from PDF version of thesis.
Includes bibliographical references (page 33).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
Persistent DSpace Link
