Designs, Codes and Cryptography

, Volume 35, Issue 3, pp 271–285 | Cite as

The Near Resolvable 2-(13, 4, 3) Designs and Thirteen-Player Whist Tournaments

  • Harri HaanpääEmail author
  • Petteri Kaski


A ν-player whist tournament is a schedule of games, where in each round the ν players are partitioned into games of four players each with at most one player left over. In each game two of the players play as partners against the other two. All pairs of players must play in the same game exactly three times during the tournament; of those three times, they are to play as partners exactly once. Whist tournaments for ν players are known to exist for all ν ≡ 0,1 (mod 4). The special cases of directed whist tournaments and triplewhist tournaments are known to exist for all sufficiently large ν, but for small ν several open cases remain. In this paper we introduce a correspondence between near resolvable 2-(ν, k, λ designs and a particular class of codes. The near resolvable 2-(13, 4, 3) designs are classified by classifying the corresponding codes with an orderly algorithm. Finally, the thirteen-player whist tournaments are enumerated starting from the near resolvable 2-(13, 4, 3) designs.


near resolvable design whist tournament orderly algorithm 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Anderson, I 1990Combinatorial Designs: Construction MethodsEllis HorwoodChichesterzbMATHGoogle Scholar
  2. Anderson, I., hundred, A 1995years of whist tournamentsJournal of Combinatorial Mathematics Combinational Computation19129150zbMATHGoogle Scholar
  3. Anderson, I 1996Whist tournamentsColbourn, CJDinitz, JH eds. The CRC Handbook of Combinatorial DesignsCRC PressBoca Raton504508Google Scholar
  4. Baker, R. 1975Whist tournamentsCongressus Numerautium1489100Google Scholar
  5. Bennett, F. E., Zhang, X. 1990Resolvable Mendelsohn designs with block size 4 Aequationes Mathematical40248260zbMATHMathSciNetGoogle Scholar
  6. I. A. Faradžev, Constructive enumeration of combinatorial objects, Colloq Internat CNRS, 260, CNRS, Paris (1978) pp. 131–135.Google Scholar
  7. Finizio, N. J. 1991Orbits of cyclic Wh[υ] of Z N-typeCongressus Numerantium821528MathSciNetGoogle Scholar
  8. The GAP Group, GAP –- Groups, Algorithms, and Programming, Version 4.3; 2002. ( Scholar
  9. Ge, G., Lam, C. W. H. 2003Some new triplewhist tournaments TWh(υ)J. Combinatorial Theory, Series A101153159zbMATHMathSciNetGoogle Scholar
  10. Ge, G., Zhu, L. 2001Frame constructions for Z-cyclic triplewhist tournamentsBull. Inst. Combin. appl.325362zbMATHMathSciNetGoogle Scholar
  11. Gibbons, PB 1996Computational methods in design theoryColbourn, CJDinitz, JH eds. The CRC Handbook of Combinatorial DesignsCRC PressBoca Raton718740Google Scholar
  12. Graham, R. L., Pollak, H. O. 1971On the addressing problem for loop switchingBell System Technical Journal5024952519zbMATHMathSciNetGoogle Scholar
  13. Haanpää, H., Östergård, PRJ 2003Classification of whist tournaments with up to 12 playersDiscrete Applied Mathematics129399407zbMATHMathSciNetGoogle Scholar
  14. Kaski, P., Östergård, PRJ 2001There exists no (15,5,4) RBIBDJournal of Combinatorial Designs9357362zbMATHMathSciNetGoogle Scholar
  15. Lu, Y., Zhu, L. 1997On the existence of triplewhist tournaments Twh(υ)Journal of Combinatorial Designs5249256zbMATHMathSciNetGoogle Scholar
  16. R. Mathon and A. Rosa, 2-(υ, k, λ) designs of small order, In C. J. Colbourn and J. H. Dinitz, CRC Press, Boca Raton (1996) pp. 3–41.Google Scholar
  17. B. D. McKay, autoson – a distributed batch system for UNIX workstation networks (version 1.3), Technical Report TR-CS-96-03, Computer Science Department, Australian National University (1996).Google Scholar
  18. B. D. McKay, nauty user’s guide (version 1.5). Technical Report TR-CS-90-02, Computer Science Department, Australian National University (1990).Google Scholar
  19. Morales, L. B., Velarde, C., complete, A 2001classification of (12,4,3)-RBIBDsJournal of Combinatorial Designs9385400zbMATHMathSciNetGoogle Scholar
  20. Östergård, PRJ 2002A fast algorithm for the maximum clique problemDiscrete Applied Mathematics120197207zbMATHMathSciNetGoogle Scholar
  21. Read, R. C. 1978Every one a winner; or how to avoid isomorphism search when cataloguing combinatorial configurationsAnnals of Discrete Mathematics2107120CrossRefzbMATHMathSciNetGoogle Scholar
  22. N.V. Semakov and V.A. Zinov’ev, Equidistant q-ary codes with maximal distance and resolvable balanced incomplete block designs, Problems of Information Transmission, Vol. 4, No. 2 (1968) pp. 1--7; translated from Problemy Peredachi Informatsii , Vol. 4, No. 2 (1968) pp. 3--10 (Russian). Google Scholar
  23. T. Syrjänen and I. Niemelä, The Smodels system, In T. Eiter, W. Faber, M. Truszczyński, (eds.), Logic Programming and Nonmonotonic Reasoning: Proc. 6th International Conference, LPNMR 2001, Lecture Notes in Artificial Intelligence, Springer, Berlin, 2173 (2001) pp. 434–438.Google Scholar
  24. Winkler, PM 1983Proof of the squashed cube conjectureCombinatoria3135139zbMATHMathSciNetGoogle Scholar
  25. Zhang, X. 1996On the existence of (υ,4,1)-RPMDArs Combinatoria42331zbMATHMathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media, Inc. 2005

Authors and Affiliations

  1. 1.Laboratory for Theoretical Computer ScienceHelsinki University of TechnologyFinland

Personalised recommendations