macOS Coding possible, non-repeating routes

[jsmwoolf]

Does anyone know a website on efficient path finding with grids, matrix, etc. that doesn't tend to repeat itself? Thanks.

 

[GorillaPaws]

I know that A star (aka A*) is commonly used. I'm uncertain of exactly how efficient it is, but it's widely used as far as I have read.

 

[jsmwoolf]

Thanks.

Another question would be could you implement special conditions such as non repeating path or never to overlap a spot when it was hit with A*? Also, can you also program it to find all paths, not just the quickest path?

 

[dmi]

For all non-repeating routes, depth-first search would seem to be the simplest approach.

 

[Starfox]

Have you read Jeff Orkin's publications on this problem?