LÖVE

http://www.ludumdare.com/compo/ludum-da ... &uid=10298

Say whaaat ...

SiENcE wrote:http://www.ludumdare.com/compo/ludum-da ... &uid=10298

It have some cutness on it. But You should remove the "full" map. Spoiling your own game?.

coffee wrote:

SiENcE wrote:http://www.ludumdare.com/compo/ludum-da ... &uid=10298

It have some cutness on it. But You should remove the "full" map. Spoiling your own game?.

Ah ... ahhhhh yes of couse

And here is the difficulty chart:

SiENcE wrote:

coffee wrote:

SiENcE wrote:http://www.ludumdare.com/compo/ludum-da ... &uid=10298

It have some cutness on it. But You should remove the "full" map. Spoiling your own game?.

Ah ... ahhhhh yes of couse

And here is the difficulty chart:
SPOILER SPOLER

I noticed you put a screen shot of the end stage in the dedicated thread. You really don't like people be surprised don't you?
About the game, I had some fun but after the girl change (not anymore a secret) one the guys had a lot of hard time jumping one particular plataform with spikes. I lost my temper and closed the browser, sorry. Because there's no fun in discover what's up in the game! ;D

Pathfinding with waypoints.

Whatever it is, it looks nice

AntonioModer wrote:Pathfinding with waypoints.

Capture-1.png

Looks nice. What specific algorithm do you use ? A*, Dijkstra, or something else ?

Roland_Yonaba wrote: Looks nice. What specific algorithm do you use ? A*, Dijkstra, or something else ?

A*.

So how is it doing ? Did you made some optimizations upon it, or did you just implemented a classical A* ?
How do you manage insertion/deletion in your openlist/closedlist collections ? With table.insert/table.remove ? Are they fast enough ?