ExamplesJaCoP
Class LatinSquare

java.lang.Object
  ExamplesJaCoP.Example
      ExamplesJaCoP.LatinSquare

public class LatinSquare
extends Example

It solves a Latin Square problem. LatinSquare problem consists of filling the square of size n by n with numbers 1..n in such a way that every row and column does not contain two numbers of the same value. QuasiGroupCompletion example provides possibility to impose initial conditions on the values of pre-assigned cells.

Author:

Krzysztof Kuchcinski and Radoslaw Szymanek

Field Summary

int	n The size of the latin square.

Fields inherited from class ExamplesJaCoP.Example

cost, search, store, vars

Constructor Summary

LatinSquare()

Method Summary

static void	main(java.lang.String[] args) It executes the program to solve the LatinSquare problem.
void	model() It specifies a standard way of modeling the problem.

Methods inherited from class ExamplesJaCoP.Example

creditSearch, getSearch, getSearchVariables, getStore, printMatrix, search, searchAllAtOnce, searchAllOptimal, searchLDS, searchMasterSlave, searchMaxRegretOptimal, searchMiddle, searchMostConstrainedStatic, searchOptimal, searchSmallestDomain, searchSmallestMedian, searchSmallestMiddle, searchSmallestMin, searchWeightedDegree, searchWithMaxRegret, searchWithRestarts, shavingSearch

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

n

public int n

The size of the latin square.

Constructor Detail

LatinSquare

public LatinSquare()

Method Detail

model

public void model()

Description copied from class: Example

It specifies a standard way of modeling the problem.

Specified by:

model in class Example

main

public static void main(java.lang.String[] args)

It executes the program to solve the LatinSquare problem.

Parameters:

args -