Chooses a card by sampling many random completions of the hidden cards ("determinizations"): for each legal move the rest of the trick is filled in at random from the unseen cards, and the move with the best average card-point outcome is returned. Points the move captures count in its favour; points it hands to the opponents count half against it, so a cheap loss is preferred to an expensive one.
Usage
sk_mcts_move(
hand,
led,
game_type,
trick = character(0),
unseen = NULL,
n_sims = 200,
call = rlang::caller_env()
)Arguments
- hand
The deciding player's hand (
sk_cardor character vector).- led
The led card, or
NULLif this player leads.- game_type
A single game-type string, one of
sk_game_types().- trick
Cards already played to the current trick, in play order and including the led card. Defaults to
character(0).- unseen
Optional character vector of cards not visible to the player (opponents' cards plus skat). If
NULL, inferred as the full deck minus the player's hand and the visible trick.- n_sims
Number of determinized rollouts per legal move. Defaults to 200.
- call
The calling environment, used for error reporting.
Details
This is a light-weight imperfect-information heuristic, not a full
information-set MCTS. It plays reasonably and costs little; for exact play use
sk_solve_dd() on an endgame.
See also
sk_player() wraps this as a strategy; sk_solve_dd() plays
exactly when every hand is known.
Other player functions:
sk_choose(),
sk_player()