This article finds the minimum number of moves to order a deck of cards by placing them in suits, but not necessarily in order.

Develops search patterns for locating an object which may be in one of several locations. (JP)

An analysis is made of the probabilities for winning at the game of Keno, with a computer program provided that will determine expectations. (DT)

Some applications of the theory of games to competitive situations are examined by looking at several examples, including a military problem, a political problem, and a prisoner's dilemma. (MP)

Probabilities and strategies for winning at a game of fliiping a penny are analyzed. (DT)

Discusses the postage rate increases in recent years and notes that if the trend continues the rate will reach three dollars an ounce by the year 2017. (GA)

The author presents three methods for dealing with the problem of the number of tosses of a fair coin needed to obtain two consecutive heads. (MN)

This extension of Harris' classification system permits classification of the interval-scale properties of any 2 x 2 (two person, two choice) game. The system is compared to taxonomies developed by various previous researchers. It is shown to permit compact description of any 2 x 2 game as an octet of numbers. It also permits rapid classification…

Some counterintuitive ideas in probability are examined. In particular, for sequential selection procedure, such as drawing cards, it is shown that there is probabilistic advantage to drawing first (or early) relative to drawing last (or late) in the sequence. (Author/MK)

Describes a five-dice game, horse. Discusses the offensive player's strategy using the ideas of probability, such as counting outcomes, mutually exclusive events, conditional probabilities, zero sum games, and the use of computer. (YP)