Little research has been done for turn-based games of this kind such as financial games that involve buying and selling on the stock market in no specific order (For games with shared resources (e.g., financial games) or simultaneously-played move games, one could alternatively consider multi-player AI algorithms to be those that treat the game with each opponent as a separate game. While this is meaningful for ordered turn-based games, there are a host of scenarios where the players need not be constrained to make their moves in such a manner. All of these methods make decisions by modelling the game by assuming that there is some predetermined play ordering for the players. The best reported methods for turn-based multi-player game playing AI algorithms include Max \(^n\), Paranoid and Best Reply Search.
