2026-09-19T05:38:17Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/920882026-06-06T00:55:35Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Charles E. Leiserson.
Wattanawaroon, Tana
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2014-12-08T18:48:02Z
2014-12-08T18:48:02Z
2014
2014
http://hdl.handle.net/1721.1/92088
895674162
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).
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.
by Tana Wattanawaroon.
M.Eng.
33 pages
eng
Massachusetts Institute of Technology
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.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
Local versus global tables in Minimax Game Search
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="b5847f40-5363-40fb-9232-05e50ffc5892">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Local versus global tables in Minimax Game Search</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2014</PublicationDate>
<Authors>
<Author>
<DisplayName>Wattanawaroon, Tana</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<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.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>