Perturbed hamiltonian-cycle-based algorithms to solve snake game
The snake game is an old classical game with simple rules that, to this date, has yet been completely solved with in the most efficient manner. The concept of Hamiltonian cycle allows to solve the snake game with perfect completion rate, albeit in an inefficient manner. We look into ways to use the...
Saved in:
Main Author: | Chen, Leonardus |
---|---|
Other Authors: | Chew Lock Yue |
Format: | Final Year Project |
Language: | English |
Published: |
Nanyang Technological University
2023
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/166541 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Finding Hamiltonian cycles: An algorithm
by: Macapagal, Rachel R., et al.
Published: (2008) -
Conflict Dissolution by Reframing Game Payoffs using Linear Perturbations
by: KWON, Young Koan, et al.
Published: (1983) -
On disjoint hamiltonian cycles in bipartite graphs
by: Briones, Ryan Louise M., et al.
Published: (2014) -
Iterative nonlinear beam propagation using Hamiltonian ray tracing and Wigner distribution function
by: Zhang, Baile, et al.
Published: (2012) -
A compact finite difference method for solving the general Rosenau-RLW equation
by: Wongsaijai,B., et al.
Published: (2015)