## Sample Geomorphs

GreyKnight asked for some sample tiles that show ‘nonlinear features’, so I’ve done up three tiles.

Simple Cave

Water Caves

Lava Lake

## Sample Cave Tiles

I decided to do cave tiles because it was quick and easy (draw some squiggles, floodfill them, and call it done).  Drawing with a mouse sucks.

### Tile 1: Simple Cave

This is a very simple tile containing a cave with three entrances (NW, EN, SE).  No special features, but the cave walls in the NE, ES, SW, WS, and WN sides can be considered ‘nonlinear features’ by the definitions of the previous post because the cover the entire section.

### Tile 2: Water Caves

This  is a slightly more complex tile.  There are several linear connectors (river in the NW, tunnels in the EN and WS), and a lake covering the ES and SE sections.  Again, the stone of the caves in the NE and WN sections can be considered nonlinear features as well.

### Tile 3: Lava Lake

This may be the simplest tile of the three.  This might be found in a large cave, there is a lava lake in the NW and WN sections, a stream of lava running to the southeast, and it travels out the SE connector.  All the other connectors and sections (linear and nonlinear features) are empty space.

## Addendums and Changes to the Last Article

I am assuming a few changes since the original article yesterday.

• Nonlinear features use the entire section they are found in.  Alignment to the connectors was a decent idea at the time, but I had overlooked other layouts than conforming to a simple Cartesian grid (such as the offset grid, where each row is shifted half a tile to the side of the previous row).  This would not work with nonlinear features that only go from the connector to the corner.  Also, doing that would require specification of the content of the remaining section of that side (stone, empty space, etc.).  It is simpler to treat each side as having two sections, each of which has a single nonlinear feature.
• I will change ‘linear’ and ‘nonlinear’ labels, there must be a better way to describe the two parts of each section (the bit that populates the connector, and the bit that covers the rest of that section).  I am open to suggestions.
• The algorithm described yesterday was designed on assumptions from playing tile-placement games such as Carcassonne and looks for the best way to place tiles as they are drawn.  Instead, an algorithm can be devised that will examine all available tiles, determine the viability of each, and then randomly select from the short list of viable tiles based on a weighted measure (such as quality of connection).