FIDE & Google Efficient Chess AI Challenge - Create agents to play chess with resource constraints
-
Updated
Jul 28, 2026 - C
FIDE & Google Efficient Chess AI Challenge - Create agents to play chess with resource constraints
Parallel computing with CUDA, OpenMP, MPI
Bitmap + rank-indexed vault sparse matrix in C — 4,000 bytes → 102. Beats COO by storing zero coordinates.
“DVTRGA is a real, proprietary graphics engine — signed, hardened, and weighing only 104KB. It is not a demo, not a mockup, not a concept: it is functional technology designed for Neuro‑OS Genesis. In a world where engines weigh gigabytes, DVTRGA proves that extreme efficiency is still possible.
A Lightweight AES-128/192/256 Implementation in C
A cross-platform system utility written in C that optimizes memory and CPU usage by automatically "freezing" (suspending) background applications. It interacts directly with the OS kernel (macOS/Windows/Linux) to detect active windows and manage process states in real-time.
Ordenação linear O(n) e filtragem de duplicatas via manipulação de Bit-Vector com otimização extrema de memória.
Dynamic programming implementation of the Biggest Square problem in C.
C discrete-time simulator for the inventory and order management of an industrial bakery: command-driven stream processing, expiry-aware stock handling, data structures tuned for strict time and memory limits. Algorithms and Data Structures final project at Politecnico di Milano.
An advanced multi-modal context synthesis and command routing engine in native C17 featuring deterministic data pipelines, semantic article clustering metrics, and proactive constraint planners.
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.
A lightweight C library for JSON parsing and dynamic typing. Optimizes arrays for cache-friendly access and minimal memory footprint. Rival to cJSON.
Efficient line-by-line file reading function with static variables - File descriptor management and memory optimization project
To associate your repository with the memory-optimization topic, visit your repo's landing page and select "manage topics."