TOC - prev - next - javadoc tree

3.1. Determining a winner

A BusRider game is won, when

A player might have that much cash after receiving a fare, but that isn't enough to win. He must arrive at his Destination, and still have enough after paying fares. (The arrival-rule might seem arbitrary, but at least it prevents simultaneous victories, which could occur when a player pays two fares.)
By the way, the conductor checks the winning conditions after letting the player buy something. It is possible for a Strategy to be stupid, here.

It is not sufficient to be the sole non-bankrupted player. (One can imagine a contest of meandering players, none of which can reliably find its way to a Destination. As they drop out one-by-one, the last survivor might not be able to win, either.) It is possible, then, that a game have no winner.

Indeed, it is possible that a game endure forever, as the few remaining players (stupidly or deliberately) alternate between making a profit and squandering it on prolonged tours. The user would need to stop the Game manually.

TOC - prev - next - javadoc tree