Hostname: page-component-848d4c4894-2xdlg Total loading time: 0 Render date: 2024-07-07T21:13:05.471Z Has data issue: false hasContentIssue false

Designing tournaments

Published online by Cambridge University Press:  22 September 2016

A. D. Keedwell*
Affiliation:
Department of Mathematics, University of Surrey, Guildford GU2 5XH

Extract

In a recent article in the Gazette (March 1983) Chris Haines described the problems which arose when he was arranging a tenth birthday party for his son. There were seven boys in addition to his son at the party, making eight all together. In order to prevent the party from getting too boisterous, Mr Haines decided to split the party into pairs who would play various boxed games for two players: for example, halma, draughts, snakes and ladders. The plan was to have a sort of tournament in which:

  1. (1) each child would play every other child once and once only;

  2. (2) in a given session, different games would be played by each pair as only one set of each game was available;

  3. (3) each child would play as many of the available games as possible.

Type
Research Article
Copyright
Copyright © Mathematical Association 1984

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Further reading

1. Denes, J. and Keedwell, A. D., Latin squares and their applications. English Universities Press, London (1974).Google Scholar
2. Wallis, W. D., Solution of the Room squares existence problem, J. Combinatorial Theory (A) 17, 379383 (1974).Google Scholar
3. Wallis, W. D., Street, A. P. and Wallis, J. S., Combinatorics: Room squares, sum-free sets, Hadamard matrices. Springer-Verlag, Berlin (1972).Google Scholar