BSP tree implementation
Find a file
Alex Wortega 84a82f6d58
Update README.md
God bless github mobile
2021-05-25 21:21:20 +03:00
.idea Initial commit 2021-04-21 21:51:43 +03:00
.gitignore Initial commit 2021-04-21 21:51:43 +03:00
game.json Initial commit 2021-04-21 21:51:43 +03:00
IMG_20210525_212016_977.jpg Add files via upload 2021-05-25 21:20:15 +03:00
LICENSE Initial commit 2021-04-21 21:51:43 +03:00
main.py Initial commit 2021-04-21 21:51:43 +03:00
Perlinmap.py Update Perlinmap.py 2021-05-24 21:37:14 +03:00
Player.py Initial commit 2021-04-21 21:51:43 +03:00
plitk.py Initial commit 2021-04-21 21:51:43 +03:00
random_bot.py Initial commit 2021-04-21 21:51:43 +03:00
README.md Update README.md 2021-05-25 21:21:20 +03:00
screenshot.png Initial commit 2021-04-21 21:51:43 +03:00
tileset.bin Initial commit 2021-04-21 21:51:43 +03:00
tileset.json Initial commit 2021-04-21 21:51:43 +03:00
user_bot.py Initial commit 2021-04-21 21:51:43 +03:00

DandyBot

А simple programming game. You write Python scripts to control your bot in a roguelike (or Dandy-like) world. The goal is to collect as much gold as possible in the presence of other bots.

The game uses only the Python standard library. Graphics assets are from here.

See random_bot.py and user_bot.py for API examples.

Procedural generation based on BSP tree realiasation from here

pi Rooms generation is based on random walker algorithm

Some hints

  1. You may check for "wall", "gold" and "player" at the specified position.
  2. Check for the current level number, but try to generalize your code.
  3. Do not use any global data or state.

screenshot