Full chess retrieval

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.