You would have to think of a 'move' as being a sequence of jumps, rather than a single jump. Note that, technically, it would in general also be possible to model the kinds of games you're thinking of (like Checkers with sequences of multiple jumps) in different ways, such that every turn becomes a single move again. Same solution as above really, just use an array of values (one per player). Handle games with more than two players.Instead of storing a single value in every node, where you assume that one player is a max player and the other is a min player, just keep track of a separate value for each player in each node (which need not necessarily be each other's negation). You'll just have to make sure to store a variable in such State objects that tell you which player is the next player to make a move.

You're probably already storing a State object in every node. Have multiple moves in a row made by the same player.In fact, MCTS is very flexible, with respect to your question as well as many other aspects. But in MCTS such implementations are already not customary. In fact it is slightly more annoying for minimax/alpha-beta based engines, because there we usually like (if possible) to use efficient negamax implementations which automatically keep alternating signs every time.

Mcts go pass