Entangled happily ever after: Wedding reception seating mapped to classical and quantum optimizers

This project is a classic 'application of technology X to problem Y' research paper. While wedding seating is a complex combinatorial problem, the mapping of such constraints to Cost Function Networks (CFN) or Quadratic Unconstrained Binary Optimization (QUBO) forms is a standard practice in operations research and quantum computing tutorials. With 0 stars and 1 fork, the project has no current adoption or community momentum. The defensibility is low because the mathematical mapping is the only 'secret sauce,' and such mappings for seating/scheduling are well-documented in academic literature and textbooks. Frontier labs are unlikely to care about wedding seating specifically, but they are building the general-purpose solvers that make this project's underlying logic a commodity. Platform providers like AWS Braket or IBM Quantum often release similar 'real-world use case' notebooks as marketing materials, which would immediately displace this repo as a reference. This is a valuable academic exercise but lacks the characteristics of a defensible software product or infrastructure project.