Using lists of commands and a probably inefficient algorithm.. I've created something that can journey far away from a point in a maze... sort of.
The maze walls aren't solid, but the bot is punished for going through them, and will actively try to avoid it, the bot is also rewarded for getting as far away from the starting point as possible, so it will try to move from the starting location as well over time.
Feel free to watch and maybe even remix if you think you can do something interesting with this idea! Or maybe even make it to where it does something else?
Pretty amazing how it goes from not knowing any path to a pretty decent route?
Also for people who remix: If you make a map that is too narrow or claustrophobic at the start, it could hurt the bots progress significantly.
Yeah... I know, it's not the best thing out there but it is my best attempt, besides I still love and am fascinated watching it, so it was good enough for me. If you think you can, you could help improve it.
My robot decided that being lazy was the best course of action. Like the League of Legends bot server, who decided that both sides not getting points was better than a lose-win scenario.
This happens.. It will be stuck in a loop of deleting the first move (which is the move where they're moved back to the start), and then the project detecting that and fixing it, to where the bot just deletes it again.
