Basic seating arrangement solver
✓ Published0🌍 Public
Aalper
Last edited Oct 4, 2019
Created on Oct 3, 2019
This example demonstrates a basic seating arrangement solver that assigns ten people to four rooms with capacities of 2, 3, 4, and 5. It shows how constraints are enforced: each room’s occupant count must not exceed its capacity, and specific pairs and triples of people must be seated together according to defined wishes. The visualization exposes the `people` array, likely rendering each person’s room assignment. The code uses Array’s `countBy` method to tally occupants per room and defines invariant checks via custom functions `respectCapacity?` and `wishes?`, though no rendering library is specified.
AI-generated description