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...

Full description

Saved in:
Bibliographic Details
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
id sg-ntu-dr.10356-166541
record_format dspace
spelling sg-ntu-dr.10356-1665412023-05-08T15:38:50Z Perturbed hamiltonian-cycle-based algorithms to solve snake game Chen, Leonardus Chew Lock Yue School of Physical and Mathematical Sciences lockyue@ntu.edu.sg Science::Mathematics::Applied mathematics 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 concept of Hamiltonian cycle in solving the game more efficiently. More specifically, we look into improving the ideas surrounding Perturbed Hamiltonian Cycle, and subsequently use the improved ideas to implement and optimize various algorithms. Lastly, we run simulations of the algorithms in action and evaluate the results both analytically and experimentally. Bachelor of Science in Physics 2023-05-04T07:51:42Z 2023-05-04T07:51:42Z 2023 Final Year Project (FYP) Chen, L. (2023). Perturbed hamiltonian-cycle-based algorithms to solve snake game. Final Year Project (FYP), Nanyang Technological University, Singapore. https://hdl.handle.net/10356/166541 https://hdl.handle.net/10356/166541 en application/pdf Nanyang Technological University
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic Science::Mathematics::Applied mathematics
spellingShingle Science::Mathematics::Applied mathematics
Chen, Leonardus
Perturbed hamiltonian-cycle-based algorithms to solve snake game
description 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 concept of Hamiltonian cycle in solving the game more efficiently. More specifically, we look into improving the ideas surrounding Perturbed Hamiltonian Cycle, and subsequently use the improved ideas to implement and optimize various algorithms. Lastly, we run simulations of the algorithms in action and evaluate the results both analytically and experimentally.
author2 Chew Lock Yue
author_facet Chew Lock Yue
Chen, Leonardus
format Final Year Project
author Chen, Leonardus
author_sort Chen, Leonardus
title Perturbed hamiltonian-cycle-based algorithms to solve snake game
title_short Perturbed hamiltonian-cycle-based algorithms to solve snake game
title_full Perturbed hamiltonian-cycle-based algorithms to solve snake game
title_fullStr Perturbed hamiltonian-cycle-based algorithms to solve snake game
title_full_unstemmed Perturbed hamiltonian-cycle-based algorithms to solve snake game
title_sort perturbed hamiltonian-cycle-based algorithms to solve snake game
publisher Nanyang Technological University
publishDate 2023
url https://hdl.handle.net/10356/166541
_version_ 1770564933519409152