Accessibility navigation


Scheduling reach mahjong tournaments using pseudoboolean constraints

Lester, M. ORCID: https://orcid.org/0000-0002-2323-1771 (2021) Scheduling reach mahjong tournaments using pseudoboolean constraints. In: Theory and Applications of Satisfiability Testing – SAT 2021, 5-9 July 2021, Barcelona, Spain, https://doi.org/10.1007/978-3-030-80223-3. (In Press)

[img] Text - Accepted Version
· Restricted to Repository staff only
· The Copyright of this document has not been checked yet. This may affect its availability.

226kB

It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.

To link to this item DOI: 10.1007/978-3-030-80223-3

Abstract/Summary

Reach mahjong is a gambling game for 4 players, most popular in Japan, but played internationally, including in amateur tournaments across Europe. We report on our experience of generating tournament schedules for tournaments hosted in the United Kingdom using pseudoboolean solvers. The problem is essentially an extension of the well-studied Social Golfer Problem (SGP) in operations research. However, in our setting, there are further constraints, such as the positions of players within a group, and the structure of the tournament graph, which are ignored in the usual formulation of the SGP. We tackle the problem primarily using the SAT/pseudoboolean solver clasp, but sometimes augmented with an existing local search-based solver for the SGP.

Item Type:Conference or Workshop Item (Paper)
Refereed:Yes
Divisions:Science > School of Mathematical, Physical and Computational Sciences > Department of Computer Science
ID Code:98698
Uncontrolled Keywords:social golfer problem mahjong tournament scheduling pseudoboolean constraints
Publisher:Springer

University Staff: Request a correction | Centaur Editors: Update this record

Page navigation