A parallelized brute-force program for finding and plotting all shortest paths that touch every square in an n by n grid
-
Updated
Oct 15, 2025 - C++
#
hamiltonian-path
Here are 16 public repositories matching this topic...
Machine-checked Lean 4 proofs for "Minimal Topologies of Forward-Local Failure in AI Systems: The Hamiltonian Microscope" — hamiltonian-path as abstract ConstraintSystem instance (inheriting Sudoku-Microscope theorems) and Layer 2 silent-commit signature formalization with provider-agnostic well-definedness.
theorem-proving artificial-intelligence language-models formal-verification ai-safety claude mathlib hamiltonian-path lean4 llm chatgpt constraint-systems cross-provider admissibility-dynamics catastrophic-commitment
-
Updated
May 19, 2026 - Lean
cool Fortran implementation of linked lists for traversing through nodes and finding the hamiltonian path (dynamically)
linked-list fortran nodes graph-traversal linked-lists hamiltonian-path hamiltonian-path-problem graph-traversal-algorithm
-
Updated
Nov 18, 2023 - Fortran
Python implementation of the backtracking approach to find a Hamiltonian path in a given graph.
-
Updated
Apr 5, 2025 - Python
A K4-engine cybernetic runtime for AI swarms. Replaces semantic theater with thermodynamic constraint. Uses the K4 Algebra of Four-Fold Distinction to achieve phase-lock, prevent trajectory loss, and execute structurally coherent agent instantiation.
topology thermodynamics cybernetics complex-systems constraint-satisfaction epistemology swarm-intelligence ai-agents cognitive-architecture multi-agent-system ai-alignment markov-blanket hamiltonian-path llm-orchestration agentic-architecture topological-ai k4-algebra four-fold-distinction k4-topology multiway-graph
-
Updated
Jul 31, 2026 - TypeScript
Implement a Hamiltonian path algorithm, and Design a tour for visiting all cities of a country. (PHP)
-
Updated
Jul 19, 2022 - PHP
DSA Graph Analysis Project
graph-analysis strongly-connected-components graph-center shortest-path-algorithm hamiltonian-path djikstra-algorithm
-
Updated
May 23, 2023 - Java
Lean 4 proof and reproducible verification artifact for Written on the Wall II, Conjecture 198a
-
Updated
Jul 23, 2026 - Lean
Complex algorithms in Python
job-scheduler fibonacci-generator knapsack-problem dijkstra-algorithm christmas-tree pythagorean-triples floyd-warshall-algorithm least-common-multiple hamiltonian-path non-consecutive
-
Updated
Jun 16, 2017 - Python
Mind game where you drag through numbered dots to fill the grid - 400 daily levels generated offline in python, played in the browser.
-
Updated
Jul 31, 2026 - TypeScript
RU: C++ инструмент/эксперимент по графам и гамильтоновым маршрутам. EN: a C++ graph-theory tool/experiment for Hamiltonian routes.
-
Updated
Jun 9, 2026 - C++
一笔画网页解谜小游戏 · 网格哈密顿路径触控解谜(原生 HTML/CSS/JS,无构建)
-
Updated
Jul 10, 2026 - JavaScript
This project aims to implement an algorithm to find a Hamiltonian Path in a graph (directed or undirected). A Hamiltonian Path is a path that visits each vertex exactly once.
-
Updated
Apr 13, 2025 - Python
Explicit 14-vertex counterexample to Written on the Wall II Conjecture 200, with proof, exact verifiers, and Lean 4 formalization
-
Updated
Jul 23, 2026 - Python
Generates Hamiltonian Paths/Cycles to Beat the Snake Game
game clojure grid snake hamiltonian-cycle hamiltonian-cycles hamiltonian-path hamiltonian-path-problem
-
Updated
Mar 31, 2024 - Clojure
AI-powered snake game using Python and Pygame with manual gameplay and intelligent algorithms like greedy and Hamiltonian path.
python ai algorithms game-development pathfinding pygame snake-game greedy-algorithms hamiltonian-path logic-building
-
Updated
Apr 2, 2026 - Python
Improve this page
Add a description, image, and links to the hamiltonian-path topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the hamiltonian-path topic, visit your repo's landing page and select "manage topics."