Applying constraint programming to minimal lottery designs

Research output: Working paperPreprint

6673 Downloads (Pure)


We develop and deploy a set of constraints for the purpose of calculating minimal sizes of lottery designs. Specifically, we find the minimum number of tickets of size six which are needed to match at least two balls on any draw of size six, whenever there are at most 70 balls
Original languageEnglish
Number of pages21
Publication statusSubmitted - 23 Jul 2023

Publication series



  • math.CO
  • cs.DM
  • 05B30,


Dive into the research topics of 'Applying constraint programming to minimal lottery designs'. Together they form a unique fingerprint.

Cite this