Back to Search
Start Over
Hash table in Chinese Chess
- Source :
- 2012 24th Chinese Control and Decision Conference (CCDC).
- Publication Year :
- 2012
- Publisher :
- IEEE, 2012.
-
Abstract
- Hash table is a very important technique in computer games. With the development of computer Chinese Chess, hash table is wildly used and some of implementations are innovational. Several notable hash table implementations are introduced, some of them being new, while some combing with the specific modification on traditional ones, all considering special characteristics of Chinese Chess. The two common methods, Zobrist hashing and lockless algorithm in parallel search, are also put forward. The experimental results reveal these hash tables are remarkable and essential, significantly improving the overall performance.
- Subjects :
- Primary clustering
Theoretical computer science
Universal hashing
Computer science
Dynamic perfect hashing
Hash buster
Hash function
Zobrist hashing
2-choice hashing
Linear hashing
Rolling hash
Hash table
Hopscotch hashing
Hash tree
Cuckoo hashing
Data_FILES
Hash chain
Cryptographic hash function
Consistent hashing
Perfect hash function
Double hashing
Tabulation hashing
Subjects
Details
- Database :
- OpenAIRE
- Journal :
- 2012 24th Chinese Control and Decision Conference (CCDC)
- Accession number :
- edsair.doi...........3dea5797bf935d04d169bb6ea439242d
- Full Text :
- https://doi.org/10.1109/ccdc.2012.6244521