11 | * for square maps this one side of the map, chosen randomly
| 11 | * for square maps this one side of the map, chosen randomly
|
---|
12 | * could (optionally) be somewhere in the middle (not sure why this is better though)
| 12 | * could (optionally) be somewhere in the middle (not sure why this is better though)
|
---|
13 | * companies are given a destination, this is the opposite side of the map
| 13 | * companies are given a destination, this is the opposite side of the map
|
---|
59 | * player can also 'bribe politicians' but may get caught (map-wide version of bribing towns) | 57 | * player can also 'bribe politicians' but may get caught (map-wide version of bribing towns)
|
---|
| | 58 |
|
---|
| | 59 |
|
---|
| | 60 |
|
---|
| | 61 | Check map dimensions
|
---|
| | 62 |
|
---|
| | 63 | If rectangular:
- choose long axis
|
---|
| | 64 | If square
|
---|
| | 65 | - choose random axis
|
---|
| | 66 |
|
---|
| | 67 | For each end of axis
|
---|
| | 68 | - find 3 towns nearest to axis end
|
---|
| | 69 | - if town size parameter is 'favour larger'
|
---|
| | 70 | - choose largest of the 3
|
---|
| | 71 | - if town size parameter is 'favour smaller'
|
---|
| | 72 | - choose smallest of the 3
|
---|
| | 73 | - if town size parameter is 'random'
|
---|
| | 74 | - choose 1 at random from the 3
|
---|
| | 75 |
|
---|
| | 76 | Primary goal is then to build a route providing continuous service between the two towns.
|
---|
| | 77 | Secondary goal is to connect n subsidiary towns.
|
---|
| | 78 |
|
---|
| | 79 | Unknowns
|
---|
| | 80 |
|
---|
| | 81 | - how to measure continuous service? Can a cargo monitor detect origin of cargo on delivery?
|
---|
| | 82 | - how to select towns for the secondary goals. |
---|