Timeline for Randomly generated track
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 31, 2012 at 23:19 | comment | added | Adam | @Gajet The randomness comes from the 'random square' selection. If the algorithm gets to the end square too quickly it will keep searching until it either has to backtrack or it manages to extend the route to the correct length. The algorithm is essentially trying random routes till it finds one that fits the requirements, with extra tests to cut down the search space somewhat. | |
| May 29, 2012 at 17:06 | comment | added | Dominik T. | So what would you recommend @Gajet? | |
| May 29, 2012 at 5:22 | comment | added | Ali1S232 | @adam, there are some limitations on your algorithm. first of all where did you put the randomness? and then think about the situation when one starts and moves directly towards the target, what should the algorithm do if it get's at the target before desired distance? | |
| May 28, 2012 at 17:36 | vote | accept | Dominik T. | ||
| May 28, 2012 at 15:55 | comment | added | Dominik T. | Thanks, I'm not good with these graph algorithms, but I have the concept how to do it with DFS. A* is also looking good for that as @Jake said. | |
| May 28, 2012 at 15:47 | vote | accept | Dominik T. | ||
| May 28, 2012 at 15:56 | |||||
| May 27, 2012 at 17:56 | history | answered | Adam | CC BY-SA 3.0 |