Top Qs
Timeline
Chat
Perspective

Beggar-my-neighbour

Card game From Wikipedia, the free encyclopedia

Beggar-my-neighbour
Remove ads

Beggar-my-neighbour, also known as strip jack naked, beat your neighbour out of doors,[1] or beat jack out of doors,[2] or beat your neighbour,[3] is a simple choice-free card game. It is somewhat similar in nature to the children's card game War, and has spawned a more complicated variant, Egyptian Ratscrew.

Quick facts Alternative names, Type ...
Remove ads

Origins

The game was likely invented in Great Britain and has been known there since at least the 1840s.[4]

It may be the same as beat the knave out of doors or knave out o' doors, in which case it is much older as this game is mentioned as early as 1755.[5]

Beggar-my-neighbor appears as a children's game in 19th-century British novels such as Charles Dickens's Great Expectations (1861).[6]

Play

Summarize
Perspective

A standard 52-card deck is shuffled and then divided equally between two players, and the two stacks of cards are placed on the table face down. The first player lays down their top card face up to start a central pile, and the opponent plays their top card, also face up, on it, and this goes on alternately as long as no Ace or court card (King, Queen, or Jack) appears. These cards are called "penalty cards".

If either player turns up such a card, their opponent has to pay a penalty: four cards for an Ace, three for a King, two for a Queen, or one for a Jack. They do this playing the required number of cards to the central pile. When they have done so, if all the cards are numerals, the player of the penalty card wins the hand, takes all the cards in the pile and places them under their pack. The game continues in the same fashion, the winner having the advantage of placing the first card. However, if the second player turns up another Ace or court card in the course of paying to the original penalty card, their payment ceases and the first player must pay to this new card. This changing of penalisation can continue for some time. When a single player has all of the cards in the deck in their stack, they have won.

For more than two players, play proceeds clockwise. If a player reveals a new penalty card while paying their penalty, the next player around pays the tax.[1]

Remove ads

Game theory

For a two-player game, a starting distribution of cards that leads to an infinite game was first found by Brayden Casella and reported on 10 February 2024.[7][8] The cyclic game begins ---K---Q-KQAJ-----AAJ--J-- and ----------Q----KQ-J-----KA. This happens because the game is eventually periodic—that is, it eventually reaches some state it has been in before.

Whether there is a game of beggar-my-neighbour that goes on forever was a longstanding question in combinatorial game theory. Some smaller decks of cards have infinite games, such as Camicia,[9] while others do not. John Conway once listed this among his anti-Hilbert problems,[10] open questions whose pursuit should emphatically not drive the future of mathematical research.

There are 653,534,134,886,878,245,000 (approximately 654 quintillion) possible initial states for a game of beggar-my-neighbour.[11] As of February 2024, the longest game known that does terminate is 1164 tricks long, where the cards of the deck are played a total of 8344 times. It was found by Reed Nessler.[8]

In the 1854 novel Hide and Seek by Wilkie Collins, Zach Thorpe and Matthew Grice kill time by playing beggar-my-neighbor "for sixpence a time."

In Charles Dickens' 1861 novel Great Expectations, the game is the only one known by the boy protagonist (Pip) as a child.

References

Bibliography

Loading related searches...

Wikiwand - on

Seamless Wikipedia browsing. On steroids.

Remove ads