analyze_position
Rank legal moves in board games by searching from the current position with MCTS, minimax, or ISMCTS to choose your next move.
Instructions
Rank your legal moves with a search from the current position. It only uses information you have.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| top_k | No | How many of the best moves to return. | |
| game_id | Yes | Id returned by new_game. | |
| seconds | No | Search time for Monte Carlo algorithms. | |
| algorithm | No | Search to run. auto uses MCTS for perfect-information games and MO-ISMCTS for Phantom. | auto |
| minimax_depth | No | Depth (moves ahead) for minimax. |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
| note | Yes | ||
| moves | Yes | Best moves first. | |
| metric | Yes | ||
| game_id | Yes | ||
| seconds | Yes | ||
| algorithm | Yes | ||
| best_move | Yes | ||
| iterations | Yes | Search iterations, or positions evaluated for minimax. |