jconnuck / fencing Goto Github PK

Finish the IPlayer class which models an athlete and extends IPerson and IObservable.

Finish the java interface between the clojure DataStore class and the rest of our system.

Finish IObservable class which models an object that has IPerson's registered to receive notifications for the object that implements this interface.

We need some way to model a group, which is different from a club.

The first draft of our DataStore class which acts as our general database of information.

Finish the IData class which interfaces with IDataStore and retrieves data based on ID (so data is safe from mutation).

Finish the IPerson class, which is an interface that models any person interacting with our system. IPlayer and IReferee are among the classes that implement this interface.

I'm making this a ticket. Looking over the algorithm I'm not convinced that it will a) always terminate b) find a suitable answer.
Take the case where pool size is 5 and the number of players to be placed is 6. My run through the algorithm didn't work. Can you review this and convince yourself (and then explain to me) how for any number of players, that number can be divided into X pools of size N and Y pools of size N-1.