de.spieleck.app.turn.pairing
Class MixingPairing1

java.lang.Object
  de.spieleck.app.turn.pairing.BasePairing
      de.spieleck.app.turn.pairing.MixingPairing1

All Implemented Interfaces:

PairingMode

public class MixingPairing1
extends BasePairing

This is a first strategy which heuristically solves basic problems. The basic problems are:

• Give every player as many different opponents as possible.
• Give every player as many big tables as possible.

Note: This class kind of fails to give every player the optimal number of players as often as possible, when the optimal number is smaller than the non optimal ones. That is the case for Skat, where optimal tables are 3 player and 4 players are a compromise, but the programm would try to maximise the number of 4 player tables players get.

$URL: https://svn.sourceforge.net/svnroot/jtourney/src/de/spieleck/app/turn/pairing/MixingPairing1.java $

Version:

$Revision: 2 $ $Date: 2006-03-20 14:33:27 +0100 (Mo, 20 Mrz 2006) $ $Author: nestefan $

Author:

Frank S. Nestel, $Author: nestefan $

Constructor Summary

MixingPairing1()

Method Summary

Game[]	pairing(int round, PlayerRegistry pRegistry, SplittingMode sm)
java.lang.String	toString()

Methods inherited from class de.spieleck.app.turn.pairing.BasePairing

init, sum

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Constructor Detail

MixingPairing1

public MixingPairing1()

Method Detail

pairing

public Game[] pairing(int round,
                      PlayerRegistry pRegistry,
                      SplittingMode sm)

toString

public java.lang.String toString()

Overrides:

toString in class java.lang.Object