Jump to content

Bulls and cows

From Wikipedia, the free encyclopedia

This is the current revision of this page, as edited by Rodw (talk | contribs) at 17:04, 8 March 2024 (Disambiguating links to Mastermind (link changed to Mastermind (board game)) using DisamAssist.). The present address (URL) is a permanent link to this version.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

4digits, an open source version of bulls and cows. This software uses "A" to denote "bulls" (digit in the correct position) and "B" to denote "cows" (digit in the wrong position).

Bulls and cows (also known as cows and bulls or pigs and bulls) is a code-breaking mind or paper and pencil game for two or more players. The game is played in turns by two opponents who aim to decipher the other's secret code by trial and error.

Bulls and cows predates the commercially marketed board game version, Mastermind and the word-based version predates the hit word game Wordle.[citation needed] A version known as MOO was widely available for early mainframe computers, Unix and Multics systems, among others.

The numerical version

[edit]

The numerical version of the game is usually played with four digits, but can be played with any number of digits.

On a sheet of paper, the players each write a four-digit secret number. The digits must be all different. Then, in turn, the players try to guess their opponent's number who gives the number of matches. The digits of the number guessed also must all be different. If the matching digits are in their right positions, they are "bulls", if in different positions, they are "cows". Example:

  • Secret number: 4271
  • Opponent's try: 1234
  • Answer: 1 bull and 2 cows. (The bull is "2", the cows are "4" and "1".)

The first player to reveal the other's secret number wins the game.

The game may also be played by two teams of players, with the team members discussing their strategy before selecting a move.

Computer versions of the game started appearing on mainframes in the 1970s. The first known version was written by Frank King at the Cambridge Computer Laboratory sometime before the summer of 1970.[1] This version ran on Cambridge's multi-user operating system on their Titan machine. It became so popular the administrators had to introduce systems to prevent it from clogging the system.[2] In 1972, the original Cambridge MOO was ported to the Multics operating system at MIT,[1] and reimplemented on early Unix at Bell Labs.[3]

A version called BASIC MOO was published in the DECUS Program Library for PDP computers and another was available through the DEC Users Society, both dating from 1971.[4][5] A version written by Lane Hauck in the language FOCAL for the PDP-8 later served as the basis for the handheld game Comp IV by Milton Bradley.[6][7]

These programs maintained a league table of players' scores, and protecting the integrity of this league table became a popular case study for researchers into computer security.[8]

It is proved that any number can be solved within seven turns. The average minimal game length is 26274/5040 ≈ 5.21 turns.[9][10]

The word version

[edit]

This version is usually played orally, but is easier to play if each player (or each team) keeps written notes. It is exactly like the numerical version, except instead of four-digit numbers, four-letter words are used. They must be real words, according to whatever language or languages the game is being played in. Alternative versions of the game can be played with three-letter or five-letter words, but the four-letter version remains the most popular one.

The game play for the word version is as follows.

  • One player (the host) thinks of an isogram word (i.e. no letter appears twice) and, if the word length is not pre-determined, announces the number of letters in the word.
  • Other players (the guessers) try to figure out that word by guessing isogram words containing the same number of letters.
  • The host responds with the number of cows and bulls for each guessed word. As with the digit version, "cow" means a letter in the wrong position and "bull" means a letter in the right position.

For example, if the secret word is heat, a guess of coin would result in "0 bulls, 0 cows" (none of the guessed letters are present); a guess of eats would result in "0 bulls, 3 cows" (since E, A, and T are all present, but in the wrong positions from the guess), and a guess of teal would result in "2 bulls, 1 cow" (since E and A are in the right positions, while T is in the wrong position). The game continues until one of the guessers scores "4 bulls" for guessing heat.

The word version of bulls and cows is similar to Wordle, a popular web-based word game released in 2021. Players have six attempts to guess a five-letter word.

See also

[edit]

References

[edit]
  1. ^ a b Grochow, Jerrold (July–September 1972). "MOO in Multics". Software: Practice and Experience. 2 (3): 303–304. doi:10.1002/spe.4380020313. S2CID 62558113.
  2. ^ Aleph-Null (April–June 1971). "Computer Recreations". Software: Practice and Experience. 1 (2): 201–204. doi:10.1002/spe.4380010210. S2CID 222193478.
  3. ^ Ritchie, Dennis (June 2001). "Ken, Unix, and Games". ICGA Journal. 24 (2): 67–70. doi:10.3233/ICG-2001-24202.
  4. ^ Steele Jr., Guy L. (3 March 1971). "BASIC MOO". DECUS Program Library.
  5. ^ Johnston, L. (1971). ""MOO" or "BULLS and COWS"". Decuscope. 10 (1): 29.
  6. ^ DeWyze, Jeannette (12 July 1982). "San Diego's Gremlin: how video games work". San Diego Reader.
  7. ^ Smith, Keith (25 September 2015). "The Golden Age Arcade Historian: The Ultimate (So-Far) History of Gremlin Industries Part 2". The Golden Age Arcade Historian. Retrieved 19 July 2022.
  8. ^ Ritchie, Dennis; Thompson, Ken (July–August 1978). "The UNIX Time-Sharing System". Bell System Technical Journal. 57 (6): 1905–1929. doi:10.1002/j.1538-7305.1978.tb02136.x.
  9. ^ "Optimal algorithms for bulls and cows game". slovesnov.users.sourceforge.net.
  10. ^ Liu, Chao-Lin. (2001). "Mathematics, Computer Science, and Number Games" (PDF). Science Monthly (in Chinese). 32 (3): 250–255.
[edit]