banh
Advanced Member level 1
micromouse algorithm
i'm glad u can share some experiences on implementing micromouse fast run algorithm..
i did use Bellman flood algorithm. quite simple, just need another array for storing costs. flood over a few iterations until it converges.
so basically, in terms of memory -> need at least 2 16x16 array: 1 for the maze itself, and 1 for bellman flood -> 512 bytes..
is there any algorithm taking less memory?
i'm glad u can share some experiences on implementing micromouse fast run algorithm..
i did use Bellman flood algorithm. quite simple, just need another array for storing costs. flood over a few iterations until it converges.
so basically, in terms of memory -> need at least 2 16x16 array: 1 for the maze itself, and 1 for bellman flood -> 512 bytes..
is there any algorithm taking less memory?