Applying constraint programming to minimal lottery designs

Applying constraint programming to minimal lottery designs

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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Constraints : an international journal 2024-06, Vol.29 (1-2), p.1-21
Hauptverfasser: Cushing, David, Stewart, David I.
Format: Artikel
Sprache:eng
Schlagworte:
Artificial Intelligence
Computer Science
Constraints
Operations Research/Decision Theory
Optimization
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:1383-7133
1572-9354
DOI:10.1007/s10601-024-09368-5