Dutch 200

In ten-pin bowling, a Dutch 200 is a game in which the bowler records a score of 200 by getting strikes and spares in alternation throughout the game. Strikes, when thrown in the even-numbered frames, require six spares (strike then spare in the 10th frame). For strikes in the odd-numbered frames, five spares are needed, with a strike on the last shot of the game. When bowled in certified play, the certifying body may issue a patch or other award commemorating the feat.

This is the award an American Bowling Congress member received for bowling this type of game in the 1990s.

The term is thought to originate from the phrase "Dutch treat" which is when two individuals share the cost of a date.[1]

Traditionally, a Dutch 200 is one of the hardest games to bowl due to the alternation of the spares and strikes which gives each frame a score of 20. Note that there are over 1.5 billion other ways to bowl an exact 200 game without using either method (which totals just 1.1 million combinations).[2]

Though unawarded, if a bowler can repeat the sequence of strike, strike, nine (first ball), missed spare for a full game (there is no spare attempt in the 10th frame), the score will also be 200. For the first nine frames, the bowler will score 57 (29 + 19 + 9) every three frames, for 171, with 29 more in the 10th frame to total 200.

gollark: *M L I s s I m I l a r*
gollark: ML-syntax Rust ≈good.
gollark: ++exec```haskellimport Data.Monoidimport Control.Applicativeimport Data.Listimport Control.Monadit = join.liftA2(<>)inits tailsallCombs xs = [1..] >>= \n -> mapM (const xs) [1..n]main = putStr . concat . take 1000 . nub . allCombs $ "gollark"```
gollark: ++exec```haskellimport Data.Monoidimport Control.Applicativeimport Data.Listimport Control.Monadit = join.liftA2(<>)inits tailsallCombs xs = [1..] >>= \n -> mapM (const xs) [1..n]main = putStr . concat . take 10000 . allCombs $ "gollark"```
gollark: ++exec```haskellimport Data.Monoidimport Control.Applicativeimport Data.Listimport Control.Monadit = join.liftA2(<>)inits tailsallCombs xs = [1..] >>= \n -> mapM (const xs) [1..n]main = putStr . concat . take 500 . allCombs $ "gollark"```

References

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.