An Etimo Diamonds Bot with Greedy Algoritm
Explore the docs »
·
Report Bug
Table of Contents
The greedy algorithm used to solve the diamond game seeks the best local solution at each step. In each iteration, the algorithm selects the most advantageous diamond based on certain criteria, such as closest distance or the number of points it offers. Additionally, the algorithm leverages additional features within the game, such as red buttons and teleporters, to gain even greater advantages.
The main algorithm we use is the DirectAttack
algorithm that can be found in game/logic/direct_attack.py
file
- Node.js
- Python Dependencies
cd src/tubes1-IF2211-bot-starter-pack-1.0.1
pip install -r requirement.txt
- Docker dekstop
- Yarn
npm install --global yarn
- Game Engine
- Download source code (.zip)
- Extract zip and open the file
- Go to root directory
cd tubes1-IF2110-bot-starter-pack-1.0.1
- Install dependencies using pip
pip install -r requirements.txt
- Run bot For 1 bot:
python main.py --logic DirectAttack --email=your_email@example.com --name=your_name --password=your_password --team etimo
For running more than 1 bots:
a. Edit run script in run-bots.bat
or run-bots.sh
b. Run script in the terminal
- Windows
./run-bots.bat
- Linux / macOS
./run-bots.sh
NOTE : email and name in the script must be different each other and never used before
Project status: complete
Room for improvement:
- Improve speed of process
- Improve code's efficiency