In article <83417j$bn...@news07.btx.dtag.de>, Peter J. Dobrovka says...
Josef Drexler schrieb in Nachricht ...
In article <832t88$69...@news03.btx.dtag.de>, Peter J. Dobrovka says...
What about a competition "who has the most complicated railway network
(that works)"?
Check out
http://www.ii.uib.no/~thor/Transport_Ty ... mplex.html
Hm... did you read that formula? - Why do bad ratings count positive to
complexity?
They don't
They count negative, if you look at the top of the page.
I don't know exactly how to measure complicity. Not complexity.
I don't see why you'd want to make a complicated network. Complex would
be equivalent to interconnectedness, maybe efficiency, and so on. Maybe
one could measure this with "average number of trains per segment +
average number of stations per segment", where a segment is a part of the
network where everything is connected to everything else. So if this is
true for the whole system, you only have a single segment. To be fair,
one would have to remove tracks that are never used - otherwise you could
easily connect two segments for no purpose other than to increase the
score.
If anybody wants to see what a JCN looks like (Josef's Complex Network),
I've put up one of my savegames at
http://publish.uwo.ca/~jdrexler/ttdpatch/saves/
(It has to be loaded with TTDPatch or TTD will crash!)
Comments are welcome, but note that this is still very much in progress,
only about half the map is developed. It is basically a single segment,
there's only one line with a single train that's not connected. But it
very much works, trains never get lost, nor do I need checkpoints - I
only have one checkpoint to give the train a shorter route, and some to
force particular trains on particular platforms of a station.
--
Josef Drexler |
http://publish.uwo.ca/~jdrexler/
---------------------------------+---------------------------------------
Please Conserve Gravity: Don't | To email me, please change the country
hang your clothes - pile them up| code to .ca - Death to Spammers!
