I like it, and forganthus's suggestion with battle optimisation is a great idea. I've had to solve these kind of problems before, and analyse the outcomes. It's interesting to note that if you carry out this exercise with nations prior to the breakout of the second world war, the lowest conflict states are almost identical to the Axis/Allies split (except for one country, IIRC.) It turns out this a remarkably complex problem (Combinatorial Optimization) and is NP-complete. It's an excellent problem to push onto your gamers! As a general rule, NP-complete and NP-Hard problems make for quite good games. Have a read of Ralph Koster's GDC 2009 talk for more.Go to Comment
Thank you for pointing those things out. I improved PDF to better clarify things.
The color coding is only used to summarize the combined scores of two guests if seated together. For example, the color of two corresponding cells will be dark green if the combined score is 0 (this could be a +1 and a -1, OR a = and a =). I gave a few more examples of this in the PDF.
The black and red names were my mistakes. I was color coding the names after I had finalized my seating arrangement for that guest. I corrected this in the PDF.
The special conditions are on the far right side of the score chart. These should each impose a penalty if not followed. The penalty should be whatever you deem appropriate: annoyance (-1), insulting (-2), or unacceptable (-3 and causing a scene). I did seat all the guests according to their special requirements, but I had to update the PDF because I had left some out of the score chart.
Thanks for the help sverigesson. It's much appreciated.Go to Comment