optimal playの例文

• When the number of moves to win is specified, optimal play by both sides is assumed.
• The line of play that generates the best score averaged over all samples is selected as the optimal play.
• Pittsburgh's play calling in " binary " situations exactly matched Zeus'evaluation of the optimal play choice.
• Players can maximize their chances of winning by following these strategies, and any deviation would be sub-optimal play.
• Many 2-dice variants have been analysed, and human-playable Pig strategies have been compared to optimal play.
• However, when the starting number of coins is not a Fibonacci number, the first player can always win with optimal play.
• Optimal play for 2-player Pig was computed by Todd W . Neller and visualized by Clifton G . M . Presser in 2001.
• For example, the optimal play is ranked behind more than 50 other moves by the score + rack heuristic more than 1 % of the time.
• :: : : No, perfect play is the same as optimal play, which wins in the shortest number of moves, if it can win by force.
• With optimal play, the house edge of a Spanish 21 table is lower than that of a blackjack table with the same rules on hitting or standing on soft 17.
• The set of the optimal plays for all possible hands is known as " basic strategy " and is highly dependent on the specific rules and even the number of decks used.
• The set of the optimal plays for all possible hands is known as " basic strategy " and is highly dependent on the specific rules, and even the number of decks used.
• The game designer and writer Harrison G . Pink commented that the in-game decisions were not meant to be good because there couldn't be an optimal play-through.
• In particular, the Grundy value is nonzero when the player whose turn it is has a winning strategy, and zero when the current player cannot win against optimal play from his or her opponent.
• For instance, in 2007 it was announced that checkers has been weakly solved & mdash; optimal play by both sides also leads to a draw & mdash; but this result was a computer-assisted proof.
• In the positions in which the pawn wins, at most nineteen moves are required to promote the pawn ( with optimal play ) and at most nine more moves to checkmate, assuming that the pawn was promoted to a queen.
• In 2008, the record was 517 moves ( assuming optimal play by both sides ) to make a piece capture or exchange that achieves a simpler and more obviously winnable sub-endgame, for a particular position involving a queen and knight versus a rook, bishop, and knight.
• In games which have a skill element, such as blackjack or Spanish 21, the house edge is defined as the house advantage from optimal play ( without the use of advanced techniques such as card counting ), on the first hand of the shoe ( the container that holds the cards ).
• In games which have a skill element, such as Blackjack or Spanish 21, the house edge is defined as the house advantage from optimal play ( without the use of advanced techniques such as card counting or shuffle tracking ), on the first hand of the shoe ( the container that holds the cards ).