Mr. Ant by taotang
https://taotang.itch.io/mrant
Hi, This game is about one small ant going for a journey searching and moving food resource to its base. Be careful you don't have a lot energy to move :)
Control: - Mouse Click.
How to play:
- Click to the point you want to move.
- Get resource if that point has one.
- You can swap resource if you already have one on the back
- Get three same resource in a row will have bonus points.
- Use transport to save your energy.

| Link | https://taotang.itch.io/mrant |
| Link | https://github.com/taotang1984/LD56 |
| Original URL | https://ldjam.com/events/ludum-dare/56/mr-ant |
Ratings
| Given | 6🗳️ | 4🗨️ |
One thing that'd be cool would be the ability to walk past multiple steps on a single click. Other than that, I feel like this game has lots of potential gameplay-wise, it makes you think in unusual ways.
Also, I'm curious to know how the level procgen works, it seems pretty well thought.
Great job!
Thanks for your comment, I agree that the ability to past multiple steps is a nice thing to add. (I feel bored after playing for a while and I still have to click and move one step each turn)
About the map generation:
1.generate random points in an area.
2.conect each point to its closest point. Then calculate if it can reach to base point. If not, this point will connect to its closest point (not in its reachable points group) until it can reach to base.
I feel this approach may need to optimize since sometimes Unity freeze when clicking play button. It might lead to endless loop in the this generation process.
Haha, it is not your lack of skill. The level is generated randomly, and I don't have a solution yet to verify if it is possible to beat in later levels. :smile:
I probably should add more mechanics to make it possible in later level though. I think adding mechanics is easier than verifying the level.
You might be able to verify by first generating a solvable path, e.g. 20 points = 3 Kringles + some = ~4 paths that need to match energy usage. And then add additional path branches and items. An alternative is to apply a heuristic using the (distance - energy upgrade) / score to your solver, like a weight/heat map.