LÖVE

I was played with Lovë and want to show a multimap demo for a 2d RPG like game.

The demo load a 3x3 grid of 1024x1024pixels maps, and when the player cross the current grid, it updates the 3x3 grid.

Also the demo show, inside/outside maps.

https://github.com/zhensydow/rtown/tree/0.1.0

This shows some promise. I noticed that it has some form of pathfinding, that's cool. What I could like to see, if you plan on keeping the click-to-move method, is non-grid based movement. It seems a little odd at the moment. If you want to keep the grid going at least put diagonal movement in.

Very much looking forward to see where this goes, any information on your plans with it?

Lafolie wrote:This shows some promise. I noticed that it has some form of pathfinding, that's cool. What I could like to see, if you plan on keeping the click-to-move method, is non-grid based movement. It seems a little odd at the moment. If you want to keep the grid going at least put diagonal movement in.

I havea A* pathfinding. My idea is, in the future, have a smooth-path process after A* for put diagonal movement using the current generated path.

Lafolie wrote:Very much looking forward to see where this goes, any information on your plans with it?

I don't have a final plan. I want to use it as a sandboxing of game develop. I'll want yo try the thinks usually seen in a RPG game, eg:

• Dialogs
  select, getting Objects
  Resource gathering, mining, lumberjacking
  static npc, moving npc
  ...etc

Also I want to have it opensourced to discuss or show others.

Great job!

Your Astar should be a bit more independant from your game, though. For instance, instead of hardcoding the world bounds inside, you should provide an init function where you pass the worlds bounds. Then the Astar class will process regards to these bounds.

A-star have been discussed lots of time here, here are some relevant threads, maybe you can find some valuable information there.

• Inny's Astar
• LuAstar, by me.
• MarekkPie's loveAstar, with binary heaps
• Bartoleo's MRPAS+Length of sight+Astar
• Kikito's Pulsar
• Jumper, a faster implementation consisting of mix of Astar+Binary heaps and Jump Point Search, by me.

Good luck, watching this on Github.

I just incorporated on develop branch the smooth function.
https://github.com/zhensydow/rtown/tree/develop

Also, I'll look the Astar threads, sure I found something interesting