FIDE & Google Efficient Chess AI Challenge - Create agents to play chess with resource constraints
A sophisticated semantic network system capable of encoding inference rules within the network itself. Built for efficient memory usage and powerful logical reasoning, zelph can process the entire Wikidata knowledge graph (1.4TB) to detect contradictions and make logical deductions.
A Lightweight AES-128/192/256 Implementation in C
Efficient line-by-line file reading function with static variables - File descriptor management and memory optimization project
FIDE & Google Efficient Chess AI Challenge - Create agents to play chess with resource constraints
A lossless compression algorithm combining data compression with cryptographic properties, achieving 50% compression ratio with basic data security. Built in C and Python.
Add a description, image, and links to the memory-optimization topic page so that developers can more easily learn about it.
To associate your repository with the memory-optimization topic, visit your repo's landing page and select "manage topics."