A New Hashing Method with Application for Game Playing1

Zobrist, A. L.

doi:10.3233/icg-1990-13203

Cited by 126 publications

(100 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…There are other methods, such as finite state machines [38], but they are not as generally applicable or as powerful as transposition tables. Table A Mapping a state to a transposition table entry is usually done by hashing the state to a large number (usually 64 bits or more) called the signature [39]. Some of the bits in the signature are used to index the table; the remaining bits (the tag) are used to distinguish different states that map to the same index.…”

Section: Parallel Ida*mentioning

confidence: 99%

A performance analysis of transposition-table-driven work scheduling in distributed search

Romein

Bal

Schaeffer

et al. 2002

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

This paper discusses a new work-scheduling algorithm for parallel search of single-agent state spaces, called Transposition-Table-Driven Work Scheduling, that places the transposition table at the heart of the parallel work scheduling. The scheme results in less synchronization overhead, less processor idle time, and less redundant search effort. Measurements on a 128-processor parallel machine show that the scheme achieves close-to-linear speedups; for large problems the speedups are even superlinear due to better memory usage. On the same machine, the algorithm is 1.6 to 12.9 times faster than traditional work-stealing-based schemes.

show abstract

Section: Parallel Ida*mentioning

confidence: 99%

A performance analysis of transposition-table-driven work scheduling in distributed search

Romein

Bal

Schaeffer

et al. 2002

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

show abstract

“…Zobrist [33] gives a hashing technique which predates [10] and essentially coincides with one method from [10]. Arnold and Coppersmith [2] give an interesting hashing technique which allows one to map a set of keys k i into a set of corresponding values v i using a table only slightly bigger than i v i .…”

Section: Introductionmentioning

confidence: 99%

Bucket Hashing and Its Application to Fast Message Authentication

Rogaway

1999

J. Cryptology

View full text Add to dashboard Cite

“…By doing this, the program can eliminate the time used to recalculate redundant positions (as there are often multiple ways to reach the same position) and can save approximately 25% to 50% of the search time in the midgame [7]. Implementing this feature is currently in progress.…”

Section: Transposition Tablementioning

confidence: 95%

Developing an artificial intelligence bot for Othello

Vijayakumar¹

2015

2015 IEEE Integrated STEM Education Conference

View full text Add to dashboard Cite

In this paper, I describe the Othello AI project completed during the 2014 summer Leap program at Carnegie Mellon University. I will first look at the basic components of two-player game AI. I will then look at basic properties of Othello AI design in the context of the project. Then I will examine the development of the Othello bot from the earliest to the latest versions. The performance of the bot relevant to humans and other bots will be analyzed and discussed. Finally I will look at future possible improvements to MyPlayer, the Othello Artificial Intelligence bot.

show abstract

A New Hashing Method with Application for Game Playing1

Cited by 126 publications

References 0 publications

A performance analysis of transposition-table-driven work scheduling in distributed search

A performance analysis of transposition-table-driven work scheduling in distributed search

Bucket Hashing and Its Application to Fast Message Authentication

Developing an artificial intelligence bot for Othello

Contact Info

Product

Resources

About