https://github.com/apozzi/game-of-alice-bot-hack
Game of Alice is Created Abstract Mathematical Puzzle with uses modified path finding algorithms for solution.
https://github.com/apozzi/game-of-alice-bot-hack
game-hacking hacking pathfinding pathfinding-algorithm puzzle
Last synced: about 1 month ago
JSON representation
Game of Alice is Created Abstract Mathematical Puzzle with uses modified path finding algorithms for solution.
- Host: GitHub
- URL: https://github.com/apozzi/game-of-alice-bot-hack
- Owner: Apozzi
- License: unlicense
- Created: 2022-06-08T21:27:23.000Z (almost 3 years ago)
- Default Branch: main
- Last Pushed: 2024-06-07T23:45:23.000Z (11 months ago)
- Last Synced: 2025-01-27T22:54:23.778Z (3 months ago)
- Topics: game-hacking, hacking, pathfinding, pathfinding-algorithm, puzzle
- Language: Python
- Homepage:
- Size: 54.7 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Game of Alice
What is the Game of Alice? the game of alice is mathematical and numeric puzzle game based on the game "Alice and You in the planet of numbers", but simplified for a more general and primitive game without some "Special Mechanics".
The game is composed by a table of numbers here character move is defined by the numbers on the proximity.The game has two variations and can be played by two diferent ways, with different objectives.
1. First variation of the game you need to move character from point A to point B with minimum amount of movements.
2. Second variation of the game you need to visit every position(or squares) on the table making the table empty in the process.# Rules
1. Your character must move the quantity of squares defined by the adjancent number.
The first rule can be summarized by this simple image with 1D table with only 1 row.
2. Every time that character moves a specified amount every square in that the path of the move is deleted,
if the path of movement intersect a empty square the character dies.
With the second rule the ilustration of the movement looks more like this.
The game is made of a table of N x N numbers with randomized numbers and we can choose your initial character position randomized too, looking more like this:
(TO DO)
The only possible movements in this version of the game are Orthogonally Adjancent (Right and Straight Angles).
# Solving the Game of Alice and the Algorithms
For resolution of this game we need to use a Directional Graph and map every node of this graph being a represetation of moveable square in the Game.
The maximum number of out connections in a node must be 4 (Top, Bottom, Left, Right).After that is made a path finding Breath Search and is verified a possible intersection in the route.
# Hemiltonian Circle and the Second variation of the game
(TO DO)
# Hacking the original game.
You can see this algorithm solving the original game in this link: (TO DO)
And the code: (TO DO)