////
Licensed to the Apache Software Foundation (ASF) under one
or more contributor license agreements.  See the NOTICE file
distributed with this work for additional information
regarding copyright ownership.  The ASF licenses this file
to you under the Apache License, Version 2.0 (the
"License"); you may not use this file except in compliance
with the License.  You may obtain a copy of the License at

  http://www.apache.org/licenses/LICENSE-2.0

Unless required by applicable law or agreed to in writing,
software distributed under the License is distributed on an
"AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
KIND, either express or implied.  See the License for the
specific language governing permissions and limitations
under the License.
////

[[tennis]]
= Tennis club scheduling
:imagesdir: ../..


[[tennisProblemDescription]]
== Problem description

Every week the tennis club has four teams playing round robin against each other.
Assign those four spots to the teams fairly.

Hard constraints:

* Conflict: A team can only play once per day.
* Unavailability: Some teams are unavailable on some dates.

Medium constraints:

* Fair assignment: All teams should play an (almost) equal number of times.

Soft constraints:

* Evenly confrontation: Each team should play against every other team an equal number of times.


[[tennisProblemSize]]
== Problem size

[source,options="nowrap"]
----
munich-7teams has 7 teams, 18 days, 12 unavailabilityPenalties and 72 teamAssignments with a search space of 10^60.
----


[[tennisDomainModel]]
== Domain model

image::use-cases-and-examples/tennis-scheduling/tennisClassDiagram.png[align="center"]
