001    ///////////////////////////////////////////////////////////////////////////////
002    // Copyright (c) 2006, Frank S. Nestel, All Rights Reserved.
003    //
004    // This library is free software; you can redistribute it and/or
005    // modify it under the terms of the GNU Lesser General Public
006    // License as published by the Free Software Foundation; either
007    // version 2.1 of the License, or (at your option) any later version.
008    //
009    // This library is distributed in the hope that it will be useful,
010    // but WITHOUT ANY WARRANTY; without even the implied warranty of
011    // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
012    // GNU General Public License for more details.
013    //
014    // You should have received a copy of the GNU Lesser General Public
015    // License along with this program; if not, write to the Free Software
016    // Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
017    ///////////////////////////////////////////////////////////////////////////////
018    
019    package de.spieleck.app.turn.splitting;
020    
021    /**
022     * A SplittingMode for Zoff im Zoo aka Frank's Zoo.
023     * <br/>
024     * Playable with 4, 5 or 6 players. 5 Players is optimal.
025     *
026     * <p><a href="$URL: https://svn.sourceforge.net/svnroot/jtourney/src/de/spieleck/app/turn/splitting/Zoff.java $">$URL: https://svn.sourceforge.net/svnroot/jtourney/src/de/spieleck/app/turn/splitting/Zoff.java $</a></p>
027     *
028     * @author Frank S. Nestel
029     * @author $Author: nestefan $
030     * @version $Revision: 2 $ $Date: 2006-03-20 14:33:27 +0100 (Mo, 20 Mrz 2006) $ $Author: nestefan $
031     */
032    public class Zoff
033        extends BaseSplitter
034    {
035        public int optimal()
036        {
037            return 5;
038        }
039    
040        public int[] split(int total)
041        {
042            if ( total < 4 || total == 7 )
043            {
044                return null; // Give up!
045            }
046            else 
047            {
048                int x4 = total % 5;
049                int x6 = 0;
050                if ( x4 == 1 ) // Avoid 4 tables of 4 use one with 6!
051                {
052                    x4 = 0;
053                    x6 = 1;
054                }
055                else if ( x4 != 0 )
056                {
057                    x4 = 5 - x4;
058                }
059                int x5 = (total - 4 * x4 - 6 * x6) / 5;
060                return new int[] { 0,0,0,0, x4,x5,x6 };
061            }
062        }
063    }