Print

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

[zzedar]

One interesting thing about the pathfinding algorithm: if a dwarf (or anything else) is heading towards something on the same z-level, he'll go diagonally until he lines up with it orthogonally, and then go straight towards it. So when trying to get from point A to point B, he'll try for a path that looks something like this:

Spoiler (click to show/hide)

Code: [Select]

A
 .
  .
   .
    ...................B


The thing is, this isn't symmetrical. The path from B to A will be different than the path from A to B. In theory, this could be used to make one-way hallways to reduce traffic problems, though I haven't actually tested this.

[Meph]

That has been done before, make a 3 tile pathway that looks like this:

#################################################
   #                                                                                           
     #                                                                                     #
                                                                                              #
#################################################

Every dwarf coming from the left will walk the lowest tiles, every dwarf from the right will walk the highest tile. Center should remain free most of the time.