Full chess retrieval

Type of content
Discussion / Working Papers
Publisher's DOI/URI
Thesis discipline
Degree name
Publisher
University of Canterbury
Journal Title
Journal ISSN
Volume Title
Language
Date
1994
Authors
McKenzie, Peter
Abstract

Most chess programs utilise simple memory-based techniques that compliment the brute force search. These techniques utilise stored positions to increase program performance. The ability to efficiently store and retrieve positions is critical to the success of the memory-based approach. The use of data compression to increase the capacity of memory-based systems is investigated. A number of methods for compressing and indexing chess positions are presented and analysed.

Description
Citation
Keywords
Ngā upoko tukutuku/Māori subject headings
ANZSRC fields of research
Field of Research::10 - Technology::1006 - Computer Hardware::100604 - Memory Structures
Field of Research::08 - Information and Computing Sciences::0801 - Artificial Intelligence and Image Processing
Rights
All Rights Reserved