cool Fortran implementation of linked lists for traversing through nodes and finding the hamiltonian path (dynamically)
Two different methods are being utilized to solve this famous puzzle. They are backtracking and genetic algorithms. The second approach is still in development. Backtracking method seems to be faster, but GA delivers more consistent results for a diverse palette of starting positions. All in all, a very interesting project to me personally.
Simple implementation and parallelization of the DPLL algorithm for the satisfiability problem.
Implement a Hamiltonian path algorithm, and Design a tour for visiting all cities of a country. (PHP)
WIP web implementation of Chrono math puzzle, with visualization of underlying game algorithm.
Algorithms for some classical problems
Given an n by m grid of vertices, draw a line between the vertices starting at a vertex v and finishing at another vertex w, visiting each exactly once.
Generates Hamiltonian Paths/Cycles to Beat the Snake Game
Add a description, image, and links to the hamiltonian-path-problem topic page so that developers can more easily learn about it.
To associate your repository with the hamiltonian-path-problem topic, visit your repo's landing page and select "manage topics."