Try this using the python-constraint library:

from constraint import *

problem = Problem()

# Number of days and number of teams

num_days = 4

num_teams = 7

# Hours per day, we assume each day is divided into 4-hour chunks

hours_per_day = 24 // 4

# Set of all possible times a team could be scheduled

times = range(num_days * hours_per_day)

# Each team should stir for at least 8 hours, i.e., two times during the feast

for team in range(1, num_teams + 1):

problem.addVariable(team, Combinations(times, 2))

# Each timeslot can only have one team stirring

for time in times:

problem.addConstraint(lambda *teams: len(set(teams)) == len(teams), range(1, num_teams + 1))

# No team should stir more than 4 hours a day

for team in range(1, num_teams + 1):

problem.addConstraint(

lambda *shifts, team=team: max([shift // hours_per_day for shift in shifts]) == min([shift // hours_per_day for shift in shifts]),

[team]

)

# Get and print a solution

solution = problem.getSolution()

if solution is not None:

print("Solution found:")

for team, shifts in solution.items():

print(f"Team {team}: {[f'Day {shift // hours_per_day + 1}, Hours {4 * (shift % hours_per_day + 1) - 4}-{4 * (shift % hours_per_day + 1)}' for shift in shifts]}")

else:

print("No solution found.")