Suppose I eat five meals a day, and since there are seven days in a week, I have recipes for seven of each meal, for 35 recipes in total. Each recipe has a calorie count. Each day must contain one recipe per meal, and each recipe is fixed to a particular meal (e.g. you can't have pancakes for dinner). All 35 recipes must be in the solution, so a recipe cannot be repeated during the week.I want to find the arrangement of meals which will give the most even calorie count per day  that is, I want to minimize the difference in total calories consumed from day to day.This isn't a homework problem  it's actually true! I can't come up with a better approach than brute-force, and there are 7!^4 combinations, which is a lot.
Picking the most calorie-even arrangement of meals
algorithms;combinatorics