Game AI Pro 3

41

Leveraging Plausibility Orderings to Achieve Extremely Efficient Data Compression

Jeff Rollason

41.1    Introduction

41.2    The Core Requirement: A Klondike Solitaire App

41.3    Assessing the Space Requirement

41.4    Cutting the Space Requirements, Step 1: Bit Packing

41.5    Cutting the Space Requirements, Step 2: Table Lookup

41.6    Cutting the Space Requirements, Step 3: Plausibility + Morse/Huffman Encoding

41.7    Cutting the Space Requirements, Step 4: Plausibility + Run-Length Encoding

41.8    An Example Game Record and the Compressed Record

41.9    Beyond Data Compression: Plausibility Ordering as an AI Tool

41.10  Conclusion

References

41.1  Introduction

Data compression is often blind to the meaning of the data and instead ...