relationalai.experimental.solvers.all_different()
all_different( *args: dsl.Instance|SolverExpression, per: list = []) -> SolverExpression
Returns a solver expression that enforces pair-wise inequality among the input arguments—no two values may be equal.
If one or more per
keys are supplied, the constraint is applied per group.
Must be called in a Model.rule()
or solvers.operators()
context.
Parameters
Section titled “Parameters”Name | Type | Description |
---|---|---|
*args | dsl.Instance , SolverExpression | Two or more solver variables or expressions whose values must all differ. |
per | list | Optional grouping key(s) that scope the “all-different” requirement to each group. Defaults to [] . |
Returns
Section titled “Returns”A SolverExpression
object.
Example
Section titled “Example”Use all_different()
with the SolverModel.constraint()
method to assign each employee a unique locker number:
import relationalai as raifrom relationalai.experimental import solvers
# Create a RAI model.model = rai.Model("WeeklyShiftAssignment")
# Declare entity types and properties.
# Entity types.Employee = model.Type("Employee")Shift = model.Type("Shift")Day = model.Type("Day")Available = model.Type("Available")Scenario = model.Type("Scenario") # All possible employee–shift–day combinations.Assignment = model.Type("Assignment") # A Scenario that is assigned.
# Properties.Employee.name.declare()Shift.name.declare()Shift.capacity.declare()Available.employee.declare()Available.day.declare()Scenario.employee.declare()Scenario.shift.declare()Scenario.day.declare()
41 collapsed lines
# Define sample data.
# Employees.with model.rule(dynamic=True): for name in ["Alice", "Bob", "Carol", "Dave", "Eve"]: Employee.add(name=name)
# Shifts.with model.rule(): Shift.add(name="Morning").set(capacity=2) Shift.add(name="Evening").set(capacity=3)
# Days of the week.with model.rule(dynamic=True): for name in ["Mon", "Tue", "Wed", "Thu", "Fri", "Sat", "Sun"]: Day.add(name=name)
# Employee-day availability.with model.rule(dynamic=True): # Alice works weekdays only for name in ["Mon", "Tue", "Wed", "Thu", "Fri"]: Available.add(employee=Employee(name="Alice"), day=Day(name=name)) # Bob works all days Available.add(employee=Employee(name="Bob"), day=Day()) # Carol works weekends only for name in ["Sat", "Sun"]: Available.add(employee=Employee(name="Carol"), day=Day(name=name)) # Dave works Mon/Wed/Fri for name in ["Mon", "Wed", "Fri"]: Available.add(employee=Employee(name="Dave"), day=Day(name=name)) # Eve works Tue/Thu/Sat for name in ["Tue", "Thu", "Sat"]: Available.add(employee=Employee(name="Eve"), day=Day(name=name))
# All possible employee–shift–day combinationswith model.rule(): Scenario.add(employee=Employee(), shift=Shift(), day=Day())
# Create a SolverModel instance from the model.solver_model = solvers.SolverModel(model)
# Define solver variables.
# Locker number assignment: unique integer 1‑5 per employee.with model.rule(): works_evening = Employee() solver_model.variable( works_evening, type="integer", lower=1, upper=5, name_args=["locker", works_evening.name], )
# Define solver constraints.
# Locker numbers must be unique.with solvers.operators(): emp = Employee() solver_model.constraint(solvers.all_different(emp), name_args=["unique_lockers"])