Print

Please login or register.
1 Hour 1 Day 1 Week 1 Month Forever
Login with username, password and session length

[The Rookie]

EDIT: alexandertnt explained it much better in the post below.

[alexandertnt]

I am not familier with libtcod, but I can guess that...

Again, that's... kind of only useful if you know what it already is...

Code: [Select]

    # Create path.
    path = lib.path_new_using_map(fov_map, 1.41)
I only know that 1.41 is the cost of a diagonal move by the info on another page.

Im assuming this sets up the map nodes/edge list. Path would be something to store this information. If that is what this is, it is probably best to do this only once after the map has been created or whenever the map changes, and store the result.

Code: [Select]

    # Compute path.
    lib.path_compute(path, obj.x, obj.y, target.x, target.y)
I really have no idea what this actually does.  I mean, I can see that it's your starting position and your target position, but I don't know what it does and that would be really helpful if I want to use it reliably.

This probably does the actual path finding (A*, there is apparently a seperate function for Dijkstra's).

Code: [Select]

    testx, testy = lib.path_walk(path, False)
I really have no idea about this one at all.  Where did testx and testy come from?  What is this doing?  What is False?

This probably gets the next closest position (node) along the computed path. If you called this every update and set whatever-is-moving's X and Y to testx and testy, it would probably start moving along the path. The second argument is whether it should recalculate the path if needed. Im guessing if your map doesn't change, it is safe to leave this at false.

Code: [Select]

    # Make sure tile isn't blocked by any other objects.
    if not is_blocked(testx, testy):

        obj.x, obj.y = testx, testy
Same as above, I've gotten lost now.

testx and testy are the next position that the thing needs to move to. Im assuming that not_is_blocked is some function you have to provide to check that nothing is in it's way when it tries to move.

If the python version of libtcod is set up for it, you can try running help(lib.path_walk) in the interactive shell (and with other functions).

also this might help (The next 2 pages are also relevant).

[The Rookie]

alexandertnt explained it much better than I did. Thanks!

[Girlinhat]

Ok, that makes some sense.  So, how would I like, keep the info?  In DF, a dwarf does pathing when it takes a job, and then follows the path.  It only recalculates the path if it's interrupted (by a mason building surprise walls).  How would that work?

[alexandertnt]

Ok, that makes some sense.  So, how would I like, keep the info?  In DF, a dwarf does pathing when it takes a job, and then follows the path.  It only recalculates the path if it's interrupted (by a mason building surprise walls).  How would that work?

When your is_blocked function returns true, you will probably need to recalculate the "path" variable, so the pathfinder is now aware of this blockage (path = lib.path_new_using_map(fov_map, 1.41)). Then, just do lib.path_compute(path, obj.x, obj.y, target.x, target.y) again.

something like:

Code: [Select]

   
if not is_blocked(testx, testy):
        obj.x, obj.y = testx, testy
else:
        # The route is blocked, recalculate path (So that path_compute will be aware of this blockage). This is a function defined by you.
        update_path_variable()
        # Using the new path, work out a route.
        lib.path_compute(path, obj.x, obj.y, target.x, target.y)



[Biag]

Ok, that makes some sense.  So, how would I like, keep the info?  In DF, a dwarf does pathing when it takes a job, and then follows the path.  It only recalculates the path if it's interrupted (by a mason building surprise walls).  How would that work?

Are you asking how an actor "remembers" the path? I'm not sure if this is the most memory-efficient way of doing it, but I'd just have an instance variable in the AI to hold onto that path- MonsterBrain.currentPath or something.

[alexandertnt]

Ok, that makes some sense.  So, how would I like, keep the info?  In DF, a dwarf does pathing when it takes a job, and then follows the path.  It only recalculates the path if it's interrupted (by a mason building surprise walls).  How would that work?

Are you asking how an actor "remembers" the path? I'm not sure if this is the most memory-efficient way of doing it, but I'd just have an instance variable in the AI to hold onto that path- MonsterBrain.currentPath or something.

The ammount of memory it would take to store the path would be quite insignicant. The speed gained would easily outway the slight reduction in memory efficiency.

[Girlinhat]

Yeah, the path should be just a list of x,y coordinates, right?  That's paltry.  Although my currently planned game should never have more than two dozen actors in the busiest scene, and many of them standing still fighting/farming/fishing/etc so it shouldn't be a huge issue anyways.

[Girlinhat]

DOUBLEPOST COMBO!
so this is my current (very basic) terrain generation:

Spoiler (click to show/hide)

Code: [Select]

    for x in range(MAP_HEIGHT):
        for y in range(MAP_WIDTH):
            if libtcod.random_get_int(0,0,100) < 25:
                map[x][y].char='^'
                map[x][y].lit_color=libtcod.green
                map[x][y].dark_color=libtcod.dark_green
                map[x][y].blockm=True
                map[x][y].blocks=True
                map[x][y].name='Tree'

How would I go about making this a bit more straightforward?  For instance, if I previously defined a tile (probably in another file so I could keep it orderly, and then import it) could I do this?

Spoiler (click to show/hide)

Code: [Select]

    for x in range(MAP_HEIGHT):
        for y in range(MAP_WIDTH):
            if libtcod.random_get_int(0,0,100) < 25:
                map[x][y]=tiles.tree

[da dwarf lord]

DOUBLEPOST COMBO!
so this is my current (very basic) terrain generation:

Spoiler (click to show/hide)

Code: [Select]

    for x in range(MAP_HEIGHT):
        for y in range(MAP_WIDTH):
            if libtcod.random_get_int(0,0,100) < 25:
                map[x][y].char='^'
                map[x][y].lit_color=libtcod.green
                map[x][y].dark_color=libtcod.dark_green
                map[x][y].blockm=True
                map[x][y].blocks=True
                map[x][y].name='Tree'

How would I go about making this a bit more straightforward?  For instance, if I previously defined a tile (probably in another file so I could keep it orderly, and then import it) could I do this?

Spoiler (click to show/hide)

Code: [Select]

    for x in range(MAP_HEIGHT):
        for y in range(MAP_WIDTH):
            if libtcod.random_get_int(0,0,100) < 25:
                map[x][y]=tiles.tree

I'm not sure, seeing as I haven't used python in 6 months, but if you just defined a tile like that and then for some reason had to change the tile ( cutting the tree down etc.) I think that would affect all of the tree tiles because they all reference to one instance of tile.tree... so you would have to make a child class of the tile class used in map[][], and set the default values to the tree values. I hope this helps 

[Girlinhat]

Hmm, yes, Python has a tendency to change everything at once.  Well, I could make it slightly more modular, at least, right?

Code: [Select]

    for x in range(MAP_HEIGHT):
        for y in range(MAP_WIDTH):
            if libtcod.random_get_int(0,0,100) < 25:
                set_tile(x,y,tiletype.tree)and then

Code: [Select]

def set_tile(x,y,tile):
  map[x][y].name=tile.name
  map[x][y].color=tile.color
  map[x][y].char=tile.char
  ...That would be an easier way of transcribing data, at least.  And that way, when I need to cut down a tree, just set_tile(x,y,tile.stump) and it's smooth.

Any other good ways to handle this?

[da dwarf lord]

Hmm, yes, Python has a tendency to change everything at once.  Well, I could make it slightly more modular, at least, right?

Code: [Select]

    for x in range(MAP_HEIGHT):
        for y in range(MAP_WIDTH):
            if libtcod.random_get_int(0,0,100) < 25:
                set_tile(x,y,tiletype.tree)and then

Code: [Select]

def set_tile(x,y,tile):
  map[x][y].name=tile.name
  map[x][y].color=tile.color
  map[x][y].char=tile.char
  ...That would be an easier way of transcribing data, at least.  And that way, when I need to cut down a tree, just set_tile(x,y,tile.stump) and it's smooth.

Any other good ways to handle this?

I would say that would be the best way to do it, plus you get to have the fun of dealing with pythons annoying importing system, consider it a learning experience

[Neonivek]

Dang programming super geniuses!

I'll show you! I'll show you someday!

[alexandertnt]

Is all this encapsulated in a class? If it is you can inherit this class and override set_tile to make different maps easily.

something along the line of:

Code: [Select]

class A_Map(object):
    # Generates trees. __init__ will be called when A_Map instance is created.
    def __init__(self):
        for x in range(MAP_HEIGHT):
            for y in range(MAP_WIDTH):
                if libtcod.random_get_int(0,0,100) < 25:
                    self.set_tile(x,y)
    def set_tile(self, x, y):
         # Use map[x][y] to set up trees
         pass

And can be adapted to place something like rocks easily:

Code: [Select]

# Map that places rocks. __init__ is inherited from A_Map
class A_Rocky_Map(A_Map):
    def set_tile(self, x, y):
        # Use map[x][y] to set up rocks
        pass

Then create them like

Code: [Select]

A_Forest = A_Map()
A_Mountain = A_Rocky_Map()

You could also have a look at Perlin Noise to make more interesting and natural maps. A 2D Perlin Noise generator could help with generating stuff like biomes.

Dang programming super geniuses!

I'll show you! I'll show you someday!

Start now. Programming is hard to begin learning, but once you start to get the hang of it, it becomes pretty easy to continue to learn more advanced concepts. Its a massive motivator when you can actually see a creation of yours doing something interesting, but before you get there you have to start printing "Hello World" on the screen in different ways.

[Neonivek]

The biggest barrier to learning many skills is simply that there is no starting point or spring board anyway.