{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T06:30:06Z","timestamp":1770964206395,"version":"3.50.1"},"reference-count":57,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2020,12,23]],"date-time":"2020-12-23T00:00:00Z","timestamp":1608681600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>The current pandemic has led schools and universities to turn to online meeting software solutions such as Zoom and Microsoft Teams. The teaching experience can be enhanced via the use of breakout rooms for small group interaction. Over the course of a class (or over several classes), the class will be allocated to breakout groups multiple times over several rounds. It is desirable to mix the groups as much as possible, the ideal being that no two students appear in the same group in more than one round. In this paper, we discuss how the problem of scheduling balanced allocations of students to sequential breakout rooms directly corresponds to a novel variation of a well-known problem in combinatorics (the social golfer problem), which we call the social golfer problem with adjacent group sizes. We explain how solutions to this problem can be obtained using constructions from combinatorial design theory and how they can be used to obtain good, balanced breakout room allocation schedules. We present our solutions for up to 50 students and introduce an online resource that educators can access to immediately generate suitable allocation schedules.<\/jats:p>","DOI":"10.3390\/sym13010013","type":"journal-article","created":{"date-parts":[[2020,12,23]],"date-time":"2020-12-23T12:19:51Z","timestamp":1608725991000},"page":"13","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Breakout Group Allocation Schedules and the Social Golfer Problem with Adjacent Group Sizes"],"prefix":"10.3390","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0941-1717","authenticated-orcid":false,"given":"Alice","family":"Miller","sequence":"first","affiliation":[{"name":"School of Computing Science, University of Glasgow, Glasgow G12 8RZ, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5147-0673","authenticated-orcid":false,"given":"Matthew","family":"Barr","sequence":"additional","affiliation":[{"name":"School of Computing Science, University of Glasgow, Glasgow G12 8RZ, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0521-1643","authenticated-orcid":false,"given":"William","family":"Kavanagh","sequence":"additional","affiliation":[{"name":"School of Computing Science, University of Glasgow, Glasgow G12 8RZ, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1116-875X","authenticated-orcid":false,"given":"Ivaylo","family":"Valkov","sequence":"additional","affiliation":[{"name":"School of Computing Science, University of Glasgow, Glasgow G12 8RZ, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6994-4446","authenticated-orcid":false,"given":"Helen C.","family":"Purchase","sequence":"additional","affiliation":[{"name":"School of Computing Science, University of Glasgow, Glasgow G12 8RZ, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2020,12,23]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Chase, J.D., and Okie, E.G. (2000, January 8\u201312). Combining cooperative learning and peer instruction in introductory Computer Science. Proceedings of the Thirty-First SIGCSE Technical Symposium on Computer Science Education (SIGCSE \u201900), Austin, TX, USA.","DOI":"10.1145\/330908.331888"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1016\/j.sbspro.2011.12.091","article-title":"Benefits of collaborative learning","volume":"31","author":"Laal","year":"2012","journal-title":"Procedia Soc. Behav. Sci."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Gokhale, A.A. (1995). Collaborative learning enhances critical thinking. J. Technol. Educ.","DOI":"10.21061\/jte.v7i1.a.2"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0747-5632(02)00057-2","article-title":"Identifying the pitfalls for social interaction in computer-supported collaborative learning environments: A review of the research","volume":"19","author":"Kreijns","year":"2003","journal-title":"Comput. Hum. Behav."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1536","DOI":"10.3389\/fpsyg.2018.01536","article-title":"Cooperative Team Learning and the Development of Social Skills in Higher Education: The Variables Involved","volume":"9","year":"2018","journal-title":"Front. Psychol."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1016\/j.compedu.2018.07.021","article-title":"The flipped classroom: A review of its advantages and challenges","volume":"126","year":"2018","journal-title":"Comput. Educ."},{"key":"ref_7","unstructured":"Bishop, J.L., and Verleger, M.A. (2013, January 23\u201326). The flipped classroom: A survey of the research. Proceedings of the ASEE National Conference Proceedings, Atlanta, GA, USA."},{"key":"ref_8","first-page":"134","article-title":"The impact of the flipped classroom on mathematics concept learning in high school","volume":"19","author":"Bhagat","year":"2016","journal-title":"J. Educ. Technol. Soc."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1016\/j.compedu.2015.07.008","article-title":"Personalising learning: Exploring student and teacher perceptions about flexible learning and assessment in a flipped university course","volume":"88","author":"Wanner","year":"2015","journal-title":"Comput. Educ."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1039\/C5RP00159E","article-title":"Flipped classroom modules for large enrollment general chemistry courses: A low barrier approach to increase active learning and improve student grades","volume":"17","author":"Eichler","year":"2016","journal-title":"Chem. Educ. Res. Pract."},{"key":"ref_11","first-page":"45","article-title":"Constructivism in Computer Science Education","volume":"20","year":"2001","journal-title":"J. Comput. Math. Sci. Teach."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Porter, L., Bailey Lee, C., Simon, B., and Zingaro, D. (2011, January 8\u20139). Peer instruction: Do students really learn from peer discussion in computing?. Proceedings of the Seventh International Workshop on Computing Education Research (ICER \u201911), Providence, RI, USA.","DOI":"10.1145\/2016911.2016923"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Porter, L., Bailey, L., and Simon, B. (2013, January 6\u20139). Halving fail rates using peer instruction: A study of four Computer Science courses. Proceeding of the 44th ACM Technical Symposium on Computer Science Education (SIGCSE\u201913), Denver, CO, USA.","DOI":"10.1145\/2445196.2445250"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Simon, B., Kohanfars, M., Lee, J., Tamayo, K., and Cutts, Q. (2010, January 10\u201313). Experience report: Peer instruction in introductory computing. Proceedings of the 41st ACM Technical Symposium on Computer Science Education (SIGCSE\u201910), Milwaukee, WI, USA.","DOI":"10.1145\/1734263.1734381"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Simon, B., Parris, J., and Spacco, J. (2013, January 6\u20139). How we teach impacts student learning: Peer instruction vs. lecture in CS0. Proceedings of the 44th ACM Technical Symposium on Computer Science Education (SIGCSE\u201913), Denver, CO, USA.","DOI":"10.1145\/2445196.2445215"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Porter, L., Bouvier, D., Cutts, Q., Grissom, S., Lee, C., McCartney, R., Zingaro, D., and Simon, B. (2016, January 2\u20135). A Multi-institutional Study of Peer Instruction in Introductory Computing. Proceedings of the 47th ACM Technical Symposium on Computing Science Education (SIGCSE\u201916), Memphis, TN, USA.","DOI":"10.1145\/2839509.2844642"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"12:1","DOI":"10.1145\/2499947.2499949","article-title":"Can peer instruction be effective in upper-division Computer Science courses?","volume":"13","author":"Lee","year":"2013","journal-title":"ACM Trans. Comput. Educ."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Barr, M., Nabi, S.W., and Somerville, D. (2020, January 9\u201312). Online Delivery of Intensive Software Engineering Education During the COVID-19 Pandemic. Proceedings of the 2020 IEEE 32nd Conference on Software Engineering Education and Training (CSEE&T), Munich, Germany.","DOI":"10.1109\/CSEET49119.2020.9206196"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"715","DOI":"10.2307\/255941","article-title":"Predictors of the Performance of Project Groups in R & D Organizations","volume":"29","author":"Keller","year":"1986","journal-title":"Acad. Manag. J."},{"key":"ref_20","unstructured":"Gibbs, G. (2009). The Assessment of Group Work: Lessons from the Literature, Oxford Brookes University. Assessment Standards Knowledge Exchange."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"983","DOI":"10.3109\/0142159X.2011.588733","article-title":"Collaborative group work: Effects of group size and assignment structure on learning gain, student satisfaction and perceived participation","volume":"33","author":"Kooloos","year":"2011","journal-title":"Med Teach."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Colbourn, C., and Dinitz, J. (2007). Handbook of Combinatorial Designs, CRC Press. [2nd ed.].","DOI":"10.1201\/9781420010541"},{"key":"ref_23","unstructured":"Smith, B. (2001, January 8\u201310). Reducing Symmetry in a Combinatorial Design problem. Proceedings of the Third International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR\u201901), Kent, UK."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Focacci, F., and Milano, M. (December, January 26). Global Cut Frame-work for Removing Symmetries. Proceedings of the International Conference on Principles and Practice of Constraint Programming (CP 2001), Paphos, Cyprus.","DOI":"10.1007\/3-540-45578-7_6"},{"key":"ref_25","unstructured":"Petrie, K., Smith, B., and Yorke-Smith, N. (2004, January 23\u201324). Dynamic symmetry breaking in constraint programming and linear programming hybrids. Proceedings of the European Starting AI Researcher Symposium, Valencia, Spain."},{"key":"ref_26","unstructured":"Donaldson, A.F., Miller, A., and Calder, M. (2004, January 27). Comparing the use of symmetry in constraint processing and model checking. Proceedings of the 4th International Workshop on Symmetry and Constraint Satisfaction Problems, Toronto, ON, Canada."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Gent, I., Kelsey, T., Linton, S., McDonald, I., Miguel, I., and Smith, B. (2005, January 1\u20135). Conditional Symmetry Breaking. Proceedings of the International Conference on Principles and Practice of Constraint Programming (CP 2005), Sitges, Spain.","DOI":"10.1007\/11564751_21"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Gent, I.P., Petrie, K., and Puget, J.F. (2006). Handbook of Constraint Programming, Chapter Symmetry in Constraint Programming, Elsevier.","DOI":"10.1016\/S1574-6526(06)80014-3"},{"key":"ref_29","unstructured":"Triska, M. (2008). Solution Methods for the Social Golfer Problem. [Master\u2019s Thesis, Technische Universit\u00e4t Vienna]."},{"key":"ref_30","unstructured":"Harvey, W. (2020, December 12). CSPLib Problem 010: Social Golfers Problem. Available online: http:\/\/www.csplib.org\/Problems\/prob010."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Barnier, N., and Brisset, P. (2002, January 9\u201313). Solving the Kirkman\u2019s Schoolgirl Problem in a Few Seconds. Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming (CP 2002), Ithaca, NY, USA.","DOI":"10.1007\/3-540-46135-3_32"},{"key":"ref_32","first-page":"155","article-title":"Scheduling social golfers locally","volume":"Volume 3524","year":"2005","journal-title":"Lecture Notes in Computing Science, Proceedings of the 2nd International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Prague, Czech Republic, 31 May\u20131 June 2005"},{"key":"ref_33","unstructured":"Gent, I., and Lynce, I. (August, January 30). A SAT encoding for the social golfer problem. Proceedings of the IJCAI\u201905 Workshop on Modelling and Solving Problems with Constraints, Edinburgh, Scotland."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/s10479-010-0702-5","article-title":"An improved SAT formulation for the social golfer problem","volume":"194","author":"Triska","year":"2010","journal-title":"Ann. Oper. Res."},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Law, Y.C., and Lee, J.H. (October, January 27). Global Constraints for Integer and Set Value Precedence. Proceedings of the International Conference on Principles and Practice of Constraint Programming (CP 2004), Toronto, ON, Canada.","DOI":"10.1007\/978-3-540-30201-8_28"},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Liu, K., L\u00f6ffler, S., and Hofstedt, P. (2019, January 19\u201321). Solving the Social Golfers Problems by Constraint Programming in Sequential and Parallel. Proceedings of the 11th International Conference on Agents and Artificial Intelligence (ICAART 2019), Prague, Czech Republic.","DOI":"10.5220\/0007252300290039"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/s10479-011-0866-7","article-title":"An effective greedy heuristic for the Social Golfer Problem","volume":"194","author":"Triska","year":"2012","journal-title":"Ann. Oper. Res."},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Higazy, M., El-Mesady, A., and Mohammed, M.S. (2020). On Graph-Orthogonal Arrays by Mutually Orthogonal Graph Squares. Symmetry, 12.","DOI":"10.3390\/sym12111895"},{"key":"ref_39","first-page":"191","article-title":"On a problem in combinatorics","volume":"2","author":"Kirkman","year":"1847","journal-title":"Camb. Dublin Math. J."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1090\/pspum\/019\/9959","article-title":"Solution of Kirkman\u2019s school girl problem","volume":"19","author":"Wilson","year":"1971","journal-title":"Proc. Symp. Pure Math."},{"key":"ref_41","first-page":"286","article-title":"Solving the MOLR and Social Golfers Problems","volume":"Volume 3709","author":"Harvey","year":"2005","journal-title":"Lecture Notes in Computing Science, Proceedings of Constraints Programming (CP 2005), Sitges, Spain, 1\u20135 October 2005"},{"key":"ref_42","unstructured":"Pegg, E. (2020, December 14). Math Games: Social Golfer Problem. Available online: http:\/\/www.mathpuzzle.com\/MAA\/54-Golf%20Tournaments\/mathgames_08_14_07.html."},{"key":"ref_43","unstructured":"Harvey, W. (2020, December 14). CSPLib Problem 010: Social Golfers Problem, Results. Available online: http:\/\/www.csplib.org\/Problems\/prob010\/results\/."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0012-365X(93)90016-M","article-title":"Some recent developments on BIBDs and related designs","volume":"123","author":"Zhu","year":"1993","journal-title":"Discret. Math."},{"key":"ref_45","unstructured":"Furino, S., Miao, Y., and Yin, J. (1996). Frames and Resolvable Designs, CRC Press."},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"269","DOI":"10.2307\/1402466","article-title":"A Survey of Reolvable Solutions of Balanced Incomplete Block Designs","volume":"40","author":"Kageyama","year":"1972","journal-title":"Int. Stat. Rev."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"827","DOI":"10.1016\/j.disc.2011.02.005","article-title":"Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19","volume":"311","author":"Colbourn","year":"2011","journal-title":"Discret. Math."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1002\/jcd.21342","article-title":"Doubly Resolvable Nearly Kirkman Triple Systems","volume":"21","author":"Abel","year":"2013","journal-title":"J. Comb. Des."},{"key":"ref_49","first-page":"289","article-title":"Nearly Kirkman Triple Systems","volume":"11","author":"Baker","year":"1977","journal-title":"Util. Math."},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/S0012-365X(02)00482-X","article-title":"A note on {4}-GDDs of type 210","volume":"261","author":"Kreher","year":"2003","journal-title":"Discret. Math."},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"189","DOI":"10.4153\/CJM-1960-016-5","article-title":"Further Results on the Construction of Mutually Orthogonal Latin Squares and the Falsity of Euler\u2019s Conjecture","volume":"12","author":"Bose","year":"1960","journal-title":"Can. J. Math."},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0012-365X(91)90281-6","article-title":"Class-uniformly resolvable pairwise balanced designs with block sizes two and three","volume":"92","author":"Lamken","year":"1991","journal-title":"Discret. Math."},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"2729","DOI":"10.1007\/s10623-019-00645-6","article-title":"Constructions and uses of incomplete pairwise balanced designs","volume":"87","author":"Dukes","year":"2019","journal-title":"Des. Codes Cryptogr."},{"key":"ref_54","doi-asserted-by":"crossref","unstructured":"Burini, D., and De Lillo, S. (2019). On the Complex Interaction between Collective Learning and Social Dynamics. Symmetry, 11.","DOI":"10.3390\/sym11080967"},{"key":"ref_55","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1177\/016146810811000301","article-title":"Accountability, rigor, and detracking: Achievement effects of embracing a challenging curriculum as a universal good for all students","volume":"110","author":"Burris","year":"2008","journal-title":"Teach. Coll. Rec."},{"key":"ref_56","doi-asserted-by":"crossref","unstructured":"Ireson, J., and Hallam, S. (2001). Ability Grouping in Education, Sage.","DOI":"10.4135\/9781446221020"},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"849","DOI":"10.3102\/0034654316675417","article-title":"What one hundred years of research says about the effects of ability grouping and acceleration on K\u201312 students\u2019 academic achievement: Findings of two second-order meta-analyses","volume":"86","author":"Makel","year":"2016","journal-title":"Rev. Educ. Res."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/13\/1\/13\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T10:48:48Z","timestamp":1760179728000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/13\/1\/13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,23]]},"references-count":57,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2021,1]]}},"alternative-id":["sym13010013"],"URL":"https:\/\/doi.org\/10.3390\/sym13010013","relation":{},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,12,23]]}}}