Hacker News new | past | comments | ask | show | jobs | submit login

I just wrote a blog post about using A* to solve puzzles in my game: Mondrian. http://jefarmstrong.com/posts/building-mondrian2-astar/ I think you might find it interesting.



@jefarmstrong Mondrian sounds an awesome thing dude. I liked your both posts on it.

Can I ask, how can you miss the exact shortest path for puzzles in its version-1? I mean did you just used hard-coded levels or what?




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

Search: