Some little games implementation, and also, machine learning implementation.
-
Updated
Apr 9, 2022 - Python
Some little games implementation, and also, machine learning implementation.
Blender Python API scripting to create all hamiltonian paths through a mesh
Snake AI which utilizes Prim's Minimum Spanning Tree algorithm and Hamiltonian Cycles in order to find an optimal path around the game grid.
RouteXplorer is a lib developed to optimize routes in Complete Graphs.
The classic game of snake created using pygame, including a feature to watch an AI play the game.
This snake game solver is represented by an undirected graph and the Hamiltonian Cycle algorithm that generates path visiting each vertex exactly once. This approach ensures that the snake will never collide and maximum score will be achieved.
This is a college work for Project and Analysis of Algorithms.
A simple game to learn about hamiltonian cycles, by doing. Find hamiltonian paths in 5 platonic graphs and a 6th derived from a polycube of an octahedron.
Snake played using Hamiltonian Cycles
Eulerian and Hamiltonian cycles for Algorithms and Data Structures classes
Python program to benchmark quantum annealed solutions of the travelling salesman problem against classical bruteforce and heuristic methods.
Add a description, image, and links to the hamiltonian-cycles topic page so that developers can more easily learn about it.
To associate your repository with the hamiltonian-cycles topic, visit your repo's landing page and select "manage topics."