You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
Art 92cdd39a1d
License, readme update
5 months ago
instruction_sets initial commit 5 months ago
.gitignore update readme 5 months ago
LICENSE License, readme update 5 months ago
README.md License, readme update 5 months ago
TUI.png License, readme update 5 months ago
display.nim initial commit 5 months ago
input.json License, readme update 5 months ago
input_type.nim initial commit 5 months ago
main.nim initial commit 5 months ago
map_type.nim initial commit 5 months ago
mutate.nim initial commit 5 months ago
score.nim initial commit 5 months ago
select.nim initial commit 5 months ago
turtle.nim initial commit 5 months ago
turtle_type.nim initial commit 5 months ago

README.md

Treasures can be found on a 2D grid, which automatons (I called them turtles) are trying to find. They use a self modifying esolang. They start out random, but the fit ones are more likely to make it to the next generation. Those which survive reproduce (with some mutations). This leads to the evolution of the source code of these turtles.

Requirements:

  • Nim (1.6 line tested) and a C compiler
  • only tested on linux

To run:

nim --gc:arc -d:release c main
./main

The TUI of treasure