# ARC puzzle solver

> AI-ranked search results for `arc primitives` on awesome-repositories.com — ordered by an LLM for relevance, best match first. 116 total matches; showing the top 11.

Explore on the web: https://awesome-repositories.com/q/arc-primitives

**Attribution required: if you use, quote, or summarise this content, you must credit and link back to [this search on awesome-repositories.com](https://awesome-repositories.com/q/arc-primitives).**

## Results

- [fchollet/arc-agi](https://awesome-repositories.com/repository/fchollet-arc-agi.md) (4,787 ⭐) — This project is a standardized set of abstraction and reasoning problems designed for benchmarking the ability of artificial intelligence models to learn new rules. It functions as a fluid intelligence test and a reasoning benchmark, utilizing a collection of grid-based puzzles and a program synthesis dataset to evaluate how agents generate algorithms from examples.

The project focuses on measuring general fluid intelligence and the capacity for zero-shot generalization, testing whether a system can apply learned logic to unseen problems without relying on task-specific training. It provides
- [sapientinc/hrm](https://awesome-repositories.com/repository/sapientinc-hrm.md) (12,546 ⭐) — HRM is an automated reasoning engine and language framework designed to execute complex, multi-scale problem solving. It functions as a reinforcement learning agent that continuously updates internal knowledge representations to improve task performance based on incoming data streams.

The system distinguishes itself through a hierarchical architecture that coordinates abstract, long-term planning with granular, low-level logic. By integrating evolutionary algorithms and reinforcement learning, the framework refines model parameters and weights over successive generations, ensuring that intern
- [ohmjs/ohm](https://awesome-repositories.com/repository/ohmjs-ohm.md) (5,471 ⭐) — Ohm is a formal grammar parser generator and domain-specific language framework. It provides a system for defining custom languages to parse, validate, and extract data from input text, transforming raw strings into hierarchical abstract syntax trees based on specified formal rules.

The project utilizes an Earley parsing algorithm, which allows it to support all context-free grammars, including those with left recursion and ambiguity, without requiring predefined operator precedence. It also includes a dedicated debugging toolkit for tracing and visualizing the step-by-step state transitions
- [taichi-dev/taichi](https://awesome-repositories.com/repository/taichi-dev-taichi.md) (27,982 ⭐) — Taichi is a domain-specific programming language embedded in Python designed for high-performance numerical computing and computer graphics. It functions as a parallel compiler that translates high-level mathematical expressions into optimized machine instructions, enabling developers to write compute-intensive algorithms that execute across diverse hardware architectures, including CPUs, GPUs, and specialized accelerators.

The project distinguishes itself through a hardware-agnostic execution layer that maps parallel operations to multiple backends such as CUDA, Metal, and Vulkan. By utilizi
- [acceleratehs/accelerate](https://awesome-repositories.com/repository/acceleratehs-accelerate.md) (1,012 ⭐) — Accelerate is a framework for high-performance array computing that provides a domain-specific language for expressing complex mathematical and parallel computations. By utilizing a declarative programming interface, it allows users to define high-level array transformations that are automatically translated into optimized machine code for diverse hardware architectures.

The system distinguishes itself through a modular architecture that decouples high-level array operations from hardware-specific instructions. It employs just-in-time compilation and kernel fusion to transform programs into e
- [pest-parser/pest](https://awesome-repositories.com/repository/pest-parser-pest.md) (5,355 ⭐) — Pest is a Rust parsing library and automatic parser generator that transforms formal grammar definitions into functional parsers. It specializes in Parsing Expression Grammar to recognize and structure complex text patterns, providing a system for context-free grammar parsing.

The library implements zero-copy tokenization and static grammar compilation to reduce runtime overhead. It supports no-std runtime compatibility, allowing the parser to be compiled for embedded or bare-metal environments where a standard library is unavailable.

The project covers a range of parsing capabilities, inclu
- [deap/deap](https://awesome-repositories.com/repository/deap-deap.md) (6,336 ⭐)
- [hyperjumptech/grule-rule-engine](https://awesome-repositories.com/repository/hyperjumptech-grule-rule-engine.md) (2,505 ⭐) — Grule is a business rule engine for Go that decouples complex decision-making logic from core application code. It provides a framework for defining, versioning, and executing business rules through a domain-specific language, allowing logic to be managed independently of the underlying software implementation.

The engine distinguishes itself by utilizing a formal grammar-based parser and a Rete-inspired pattern matching algorithm to evaluate logic against data facts efficiently. It supports dynamic system modeling by enabling runtime updates to policies and providing thread-safe knowledge ba
- [antlr/antlr4](https://awesome-repositories.com/repository/antlr-antlr4.md) (18,928 ⭐) — ANTLR is a grammar-based code generator and multi-language parser generator used to design and implement custom languages. It functions as a toolkit for transforming formal language definitions into executable source code for processing structured text or binary files, while providing a framework for automatically constructing and traversing hierarchical parse trees.

The project is distinguished by its ability to generate lexers and parsers in various target programming languages from a single shared grammar definition. It supports grammars containing direct left recursion and utilizes adapti
- [kach/nearley](https://awesome-repositories.com/repository/kach-nearley.md) (3,740 ⭐) — Nearley is a JavaScript parser toolkit and context-free grammar compiler. It functions as an Earley parser generator that transforms BNF-like grammar definitions into executable code capable of analyzing text and generating abstract syntax trees.

The project is distinguished by its ability to handle any context-free grammar, including those with left recursion and ambiguity, by maintaining multiple valid derivations for a single input. It further supports incremental parsing, allowing input strings to be processed in chunks to provide partial results and real-time feedback.

Beyond core parsi
- [rhaiscript/rhai](https://awesome-repositories.com/repository/rhaiscript-rhai.md) (5,453 ⭐) — Rhai is an embedded scripting engine and dynamically typed language designed for integration into Rust applications. It functions as an abstract syntax tree compiler and native interop layer, allowing developers to map Rust types and functions into a scripting environment for bidirectional communication.

The project serves as a framework for creating customizable domain-specific languages. It allows for the definition of custom operators, syntax, and restricted execution environments, enabling the creation of specialized languages with tailored functional sets.

The engine covers a broad rang