Using deep reinforcement learning to play Snake game. The used algorithm is PPO for discrete! It has the brilliant performance in the field of discrete action space just like in continuous action space. You just need half an hour to train the snake and then it can be as smart as you.|使用深度强化学习玩蛇游戏。 使用的算法是离散的 PPO！ 它在离散动作空间领域有着与连续动作空间一样的出色表现。
Traveling salesman problem solved using genetic algorithm
An automated snake game solver using a Hamiltonian cycle generated by Prim's algorithm
Implementation of the Held Bellman Karp (Held-Karp) algorithm for the Travelling Salesman Problem
Eulerian and Hamiltonian cycles for Algorithms and Data Structures classes
Algorithms and data structures assignments from university
Code for VN-Solver: Vision-based Neural Solver for Combinatorial Optimization over Graphs
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.
Add a description, image, and links to the hamiltonian-cycle topic page so that developers can more easily learn about it.
To associate your repository with the hamiltonian-cycle topic, visit your repo's landing page and select "manage topics."