However, a working accurate simulation could not only help find better solutions, it could also do so by different methods e.g. And there's no way of telling what is the function that distributes new passengers across their stations of origin. There's no way of telling in what order the new stations show up on the map, with which symbols, in what intervals.
MINI METRO GAME CODE
The only problem is that I don't have access to the game source code so I can't know some of the very important details of the game. It would seem that the only way how I could refine solutions for the normal game mode would be to test them on accurate simulations of the game.
The algorithm should be able to tell the user which of the items will maximize their metro plan efficiency better.Īt this point I will have an algorithm that produces working solution leading to high scores in the endless mode of the game where the passengers don't overcrowd the stations (which in normal mode would cause the game to terminate) and where it is possible to redesign the metro plan at any point from the bottom up. They can be tunnels, new lines (up to the maximum line limit), trains and train cars. There are certain times when the game allows users to choose one new addition to their inventory from given options. I will not consider tunnels and interchanges at this point. This is because there are usually multiple stations denoted by the same symbol and passengers don't care at which specific station they finish their journey - as long as the station has passenger's symbol.įinally I will introduce optimization of train and train car counts on each line, their timing and direction - to minimize the average time it takes to get from one station to another. I will add this new constraint to my algorithm.Īfter that I will attempt to minimize the distance between any two types of stations.
This adds the issue of passengers not being able to reach a destination that lies on a different line that doesn't intersect with the line they're currently on. Then I will try to minimize sum of distances of multiple lines. It has three hundred and sixteen stations and nine lines, so there is a lot to run in the online game runner. At the beginning I will try to only minimize total distance of one line. He wants to experience the old metro, built-in 1974. it is also not known if passengers can get lost and travel forever.īefore trying to solve the game with all its nuances I will first attempt to intuitively solve parts of the problem that lead to the most robust solution. Draw lines between stations and start your trains running. Participate in the challenges and show off your skills Created Mar 3, 2014. Mini Metro is a strategy simulation game about designing a subway map for a growing city. Discuss strategies, ideas or (new) features. it is not known whether the passengers are able to decide their path based on its travel time or whether they choose first available train that will shorten distance between the passenger and their destination. Everything Mini Metro Post your GIFs and screencaps. passengers appear intelligent - they are capable of switching lines (if those lines intersect) to get to destinations that are not situated on the line(s) that their origin stations have available.distribution of passenger destinations at individual stations (may be completely random).distribution of passengers across station(may be completely random).distribution of stations on map by their symbol (may be completely random).distribution of stations by their symbol (squares, triangles and circles are much more common than stars, crosses, droplets).how fast new passengers arrive to their initial stations.What the metro designer may be able to infer: number of passengers waiting at a station and their individual destinations (denoted by a list station symbols).each station is marked on map by a symbol.location of stations and their distances between each other.
What is available to the metro designer explicitly:
0 kommentar(er)
