My project is as follows: I am making a program for planning dinner seating that will take a number of courses, a number of tables, and a list of people. The goal is to have each person sit with as many other people as possible, moving (or not moving) to a new table after each course. I tried using a brute force method, trying every combination of people in tables and evaluating which one yielded the most new meetings of people, but it would take way too long.
Planning dinner seating, having each person sit with as many other people as possible, changing tables between each course
algorithms;python