/*************************************************************************************
 *  Copyright (C) 2007 by Oscar Martinez <omllobet@gmail.com>                        *
 *                                                                                   *
 *  This program is free software; you can redistribute it and/or                    *
 *  modify it under the terms of the GNU General Public License                      *
 *  as published by the Free Software Foundation; either version 2                   *
 *  of the License, or (at your option) any later version.                           *
 *                                                                                   *
 *  This program is distributed in the hope that it will be useful,                  *
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of                   *
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the                    *
 *  GNU General Public License for more details.                                     *
 *                                                                                   *
 *  You should have received a copy of the GNU General Public License                *
 *  along with this program; if not, write to the Free Software                      *
 *  Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA   *
 *************************************************************************************/

import java.util.*;
public class Main {
	
	private static Position finals[]= {
			new Position(4,2),
			new Position(4,16),
			new Position(9,6),
			new Position(13,19)//,new Position(9,19)
			};
	private static Position notfrees[]= {
			new Position(0,6),
			new Position(0,12),
			new Position(0,21),
			new Position(1,3),
			new Position(1,4),
			new Position(1,10),
			new Position(2,18),
			new Position(3,16),
			new Position(3,22),
			new Position(4,13),
			new Position(4,14),
			new Position(4,19),
			new Position(5,4),
			new Position(4,13),
			new Position(6,15),
			new Position(6,19),
			new Position(6,23),
			new Position(7,6),
			new Position(7,13),
			new Position(7,19),
			new Position(8,2),
			new Position(8,12),
			new Position(9,9),
			new Position(9,14),
			new Position(9,17),
			new Position(9,24),
			new Position(10,14),
			new Position(10,20),
			new Position(10,21),
			new Position(11,0),
			new Position(11,13),
			new Position(12,3),
			new Position(13,5),
			new Position(13,21),
			new Position(14,2),
			new Position(14,16),
			new Position(14,21),
			new Position(14,22),
			new Position(16,15),
			new Position(17,4),
			new Position(17,14),
			new Position(18,12),
			new Position(18,16),
			new Position(19,23),
			new Position(17,19)
			};
	
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Table t = new Table(5,6,finals, notfrees);
		t.printable();
		Solver s = new Solver();
		SegMov sg=new SegMov(false,t.getstartposition());
		List<Moves> lm = new ArrayList<Moves>();
		s.solve(lm, t, sg,0);
	}
}