Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Can you try this?

"Can you give me an approach for a pathfinding algorithm on a 2D grid that will try to get me from point A to point B while staying under a maximum COST argument, and avoid going into tiles that are on fire, except if no other path is available under the maximum cost?"

I've never found an AI that could solve this, because there's a lot of literature online about A* and tiles with cost, and solving this requires a different approach



Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: