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！ 它在离散动作空间领域有着与连续动作空间一样的出色表现。

Algorithm for solving the Hamiltonian cycle problem deterministically and in linear time on all instances of discocube graphs (tested for graphs with over 8 billion vertices). Discocube graphs are 3-dimensional grid graphs derived from: a polycube of an octahedron | a Hauy construction of an octahedron with cubes as identical building blocks...

Traveling salesman problem solved using genetic algorithm

C++ program to find and print either an euler path, euler circuit, hamiltonian path, hamiltonian circuit from a given graph.

Golang circular linked list with array backend

An algorithm for solving the Hamiltonian cycle problem deterministically and in linear time on all instances of discocube graphs (tested for over graphs with 1 billion vertices).

An automated snake game solver using a Hamiltonian cycle generated by Prim's algorithm

Tests the, still open, Ruskey-Savage Conjecture (1993) for small values of n. Searches for Hamiltonian cycle with constraints. (Final project for Non-procedural programming course.)

A rust translation of my easy_dc algorithm and very first rust program.

Implementation of the Held Bellman Karp (Held-Karp) algorithm for the Travelling Salesman Problem

a classic snake game that using hamiltonian cycle algorithm for snake movement

Inverse Snake game where the player acts as the food running away from the snake

Some graph algorithms implemented in C/C++ and Python

Eulerian and Hamiltonian cycles for Algorithms and Data Structures classes

Walking Bus Challenge

Game of snake which plays itself based off an algorithm-generated hamiltonian circuit

PWr, kurs Projektowanie efektywnych algorytmów, projekt nr 2

Implementation of algorithm Roberts and Flores to verify if the graph have a Hamiltonian Cycle.

Hamiltonian Cycle Problem Implementation

Sequential and parallel solutions for the Hamiltonian cycle problem.