Skip to main content
Software Engineering

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

10
  • Do you have any memory of where you've been? Commented Jul 8, 2015 at 17:38
  • Yes, memory of path, memory of "i'm blocked" etc ... are authorizeds Commented Jul 8, 2015 at 17:38
  • 1
    So you're essentially looking for a maze solver? Commented Jul 8, 2015 at 17:52
  • @Ordous It look like a solution yes. I don't know all maze algo. If one or more of them can resolve it in "robot"/"ant" conditions it will be good ! Commented Jul 8, 2015 at 18:03
  • How far can the ant/robot see? n distance units? Neighbouring tiles? Only the forward tile? You are looking for some algorithm that takes into account that only limited knowledge about the problem is available. It is clear that a local algorithm will not generally find the globally optimal solution, since it would likely be a “greedy” algorithm and thus be prone to “get stuck” in dead ends. This also reminds me of the “fog of war” in many computer strategy games. Commented Jul 8, 2015 at 18:19