Back track in JS code execution and find where a function was called
A package to generate mazes using the depth first or hunt and kill algorithm. Mazes can be generated with seed values for reproducibility
A maze generator
A maze generator
a simple maze generator
A tiny javascript module for creating legendary mazes ;-)
A library for generating mazes.
rustgym solutions
Backtracking solver with examples
Solve hard constraints easily
A simple implementation of a generic iterator with an item history, capable of backtracking and forgetting.
Iterate over Solutions using backtracking
Fast byte-pair encoding implementation.
An implementation of regexes, supporting a relatively rich set of features, including backreferences and look-around. Aims to be compatible with Oniguruma syntax when the relevant flag is set.
Blazing fast parser combinators: parse-while-lexing (zero-copy), deterministic LALR-style parsing, no backtracking. Flexible emitters for fail-fast runtime or greedy compiler diagnostics
A custom fork of the fancy-regex crate. You probably don't want to use this.
A game engine for generic puzzle design and problem solving
Non-backtracking fuzzy text matcher
Library for backtracking with customizable search for moves
Takes user or someone else back to previous path or url if needed
Backtracking bomb safety / timeouts for regular expressions
Makes it easier to provide a 'Cancel' or 'Back' link on web forms in Ruby on Rails
Ambit is a ruby non-deterministic programming system with backtracking and branch cut.
backtrack-xpath accepts a REXML::Element and returns the full XPath back to the root.
Ruby bindings to RE2, "a fast, safe, thread-friendly alternative to backtracking regular expression engines like those used in PCRE, Perl, and Python".
Solves the N-Queens problem using dynamically selected algorithms. Returns solution count and solutions array for small n.
The RCTP object queue for moving compiler tokens with nestable backtrack capability.
List::Matcher automates the creation of regular expressions from lists, including lists of other regular expressions. The expressions it generates from lists of strings are non-backtracking and compact.
Uses backtracking algorithm to generate random boards of specified difficulty and find solutions
Maze-like problem spaces for agentic reasoning — paths, dead ends, backtracking, breadcrumb trails, Ariadne's thread (guiding heuristic), and Minotaur encounters (dangerous misconceptions)