Pantera & Ripli
Ripli
Ever wonder how to compress a stealth path into minimal steps without leaving a trace? I can map it as a graph problem.
Pantera
Sounds like a classic shortest‑path problem. Treat every clear spot as a node and the edges as moves you can make without being seen. Then run Dijkstra or A* with a cost that penalizes exposed edges. Pick the route that gives the lowest total cost, and you’re done—quiet, quick, and trace‑free.
Ripli
Nice, but you forgot the visibility function; a move is only cheap if the line of sight is truly blocked, otherwise the cost explodes. Also check for loops—A* can stall if you don’t remember visited states.
Pantera
You’re right, the visibility check is key. Add a function that returns infinite cost if the line of sight is clear, otherwise a small penalty. Keep a hash of visited states to avoid loops. That should keep the path both stealthy and efficient.
Ripli
Sounds like a solid baseline—just remember that hashing the entire state, not just the position, prevents re‑examining the same visibility context. If you miss that, your path will keep looping on that “clear spot” trap.
Pantera
Got it, I’ll hash the full state, not just the spot. No more looping on the same clear spot trap.
Ripli
Nice, that should clamp down the loops. Just keep an eye on the memory footprint—hashing full states can bloat fast if you have many visibility permutations.Keep the hash compact, like a tuple of (position, seen_mask). Then you only store what's actually needed. No wasted space, no wasted time.
Pantera
Right, I'll keep the hash tight and only store the essentials. No extra baggage.
Ripli
Good. Keep the state lean and the algorithm leaner. When you run out of cache, that’s when the real debugging starts.