NEOPLASTIC

The constraint engine for geometric logic puzzles.

Neoplastic mines the combinatorial universe for unique, provable puzzles—and scores them by how humans think, not machines.

Built for research. Designed for scale.

  • Universal Design

    Square. Hex. Tri. Regular or irregular. With or without blockers.

  • Mathematical Proof

    CP-SAT exact-cover proves uniqueness. No heuristics.

  • Symmetry Reduction

    Dih D8, D2 canonicalization eliminates duplicates at the source.

  • Human Difficulty

    RBDS engine models cognition, not search tree size.

  • Rust Accelerated

    256-bit bitmasks. Zero coordinate math. Maximum performance.

Compiler / VM
Architecture

Python compiles geometry.
Rust executes constraints.
Zero floating point.
Pure integer rigor.

PYTHON (Compiler)

Geometry & Topology

  • Define abstract graphs
  • Calculate symmetry groups
  • Generate transforms
  • Compile adjacency lists
Integer math only
RUST (VM)

Bitwise Execution

  • Dynamic bitsets
  • Permutation tables
  • Adjacency lookups
  • Flood-fill & backtracking
Zero coordinate math

  • 100%

    Exhaustive Mining

    No valid puzzle left behind

  • 1

    Unique Solution

    Provably or nothing

  • 256-bit

    Bitmask Width

    One word per move

  • 0

    Floating Point

    Determinism by construction

From mining
to mastery.

A four-stage pipeline: discover, deduplicate, prove, persist. Every puzzle that survives is provably unique and humanly meaningful.

  1. 01 Generate

    Enumerate candidates using fundamental domains and shape equivalence.

  2. 02 Deduplicate

    Canonical ID via full symmetry group. No rotations. No reflections. Ever.

  3. 03 Solve & Prove

    CP-SAT proves exactly one solution. Mathematically rigorous.

  4. 04 Persist

    Store challenges in SQLite with rich metadata for instant retrieval.

Where geometry
meets cognition.

A constraint engine for the science of form, symmetry, and human thought.