Instance Method


Computes and returns the best possible move for the specified player.


- (id<GKGameModelUpdate>)bestMoveForPlayer:(id<GKGameModelPlayer>)player;



The player for whom the strategist should plan a move. This object must be in the current game model’s players array.

Return Value

An object describing the move found by the strategist.


This method looks ahead at the possible moves for the specified player, as well as possible future moves by other players on subsequent turns (according to the maxLookAheadDepth property) and examines the state of the game model resulting from each possible move. Your game model class provides a score for each state in its scoreForPlayer: method, allowing the strategist to find the sequence of future moves that maximizes the score for the specified player and return the first move in that sequence.

The object returned is an instance of your custom class implementing the GKGameModelUpdate protocol. This object was created in your game model’s gameModelUpdatesForPlayer: method, describing in your game’s terms a possible move. Examine that information to make use of the strategist’s selection. For example, you could implement a computer-controlled player by performing the selected move, or provide hints to a human player by indicating the selected move in your game’s user interface.

If multiple possible moves are tied for the best score and the randomSource property is not nil, this method randomly selects from among the tied moves.

This method returns nil if the specified player is invalid or has no available moves.

See Also

Planning Game Moves

- randomMoveForPlayer:fromNumberOfBestMoves:

Computes several of the best possible moves for the specified player, and returns a move randomly selected from among them.