Jump to content

User:SoonLorpai/sandbox

From Wikipedia, the free encyclopedia

Solution[edit]

The SGP is the Steiner quadruple system S(2,4,32) because 32 golfers are divided into groups of 4 and both the group and week assignments of any 2 golfers can be uniquely identified.

There are many approaches to solving the SGP.

Design theory[edit]

SAT formulation[edit]

Constraint[edit]

(Meta)heuristic[edit]

Radix[edit]

Variables in the general case of the SGP can be redefined as golfers who play in groups of golfers for any number . The maximum number of weeks that these golfers can play without regrouping any two golfers is . The radix approach assigns golfers into groups based on the addition of numbers in base .[1]

Applications[edit]

Working in groups is encouraged in classrooms because it fosters active learning and development of critical-thinking and communication skills. The SGP has been used to assign students into groups in undergraduate chemistry classes[1] and breakout rooms in online meeting software [2] to maximize student interaction and socialization.

Social Golfer Problem

  1. ^ a b Limpanuparb, Taweetham; Datta, Sopanant; Tawornparcha, Piyathida; Chinsukserm, Kridtin (17 August 2021). "ACAD-Feedback: Online Framework for Assignment, Collection, Analysis, and Distribution of Self, Peer, Instructor, and Group Feedback". Journal of Chemical Education: acs.jchemed.1c00424. doi:10.1021/acs.jchemed.1c00424.
  2. ^ Miller, Alice; Barr, Matthew; Kavanagh, William; Valkov, Ivaylo; Purchase, Helen C (2021). "Breakout Group Allocation Schedules and the Social Golfer Problem with Adjacent Group Sizes". Symmetry. 13 (13). doi:10.3390/sym13010013.{{cite journal}}: CS1 maint: unflagged free DOI (link)