with a complete game tree, it is possible to "solve" the game – that is to say, find a sequence of moves that either the first or second player can follow that will guarantee the best possible outcome for that player (usually a win or a tie). the algorithm (which is generally called backward induction or retrograde analysis) can be described recursively as follows.