/*  MinimaxTest1 - The first test for the minimax implementation.  Copyright (C) 2003 The Java-Chess team <info@java-chess.de>  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., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.*/ package de.java_chess.javaChess.engine.test;import de.java_chess.javaChess.bitboard.*;import de.java_chess.javaChess.board.*;import de.java_chess.javaChess.engine.*;import de.java_chess.javaChess.game.*;import de.java_chess.javaChess.ply.*;import de.java_chess.javaChess.position.*;import junit.framework.*;/** * A test to check, if the the boards are passed correctly to the  * ply generator, if we search with a search depth > 1. * At the time, the computer suggests e7-e5 after the opening * e2-e4,g8-f6,e4-e5 , which is a illegal move. */class MinimaxTest1 extends TestCase {    // Instance variables    /**     * The current game.     */    Game _game;    /**     * The chess board.     */    BitBoard _board;    /**     * The chess engine.     */    ChessEngine _engine;        // Constructors    /**     * Create a new instance of this test.     */    public MinimaxTest1() {	super( "A test of the minimax implementation, if boards are passed correctly over search depths");    }    // Methods     /**     * Run the actual test(s).     */    public void runTest() {	minimaxTest1();    }    /**     * Prepare the test(s).     */    protected void setUp() {	// Create a new game.	_game = new GameImpl();	// Create a new board.	_board = new BitBoardImpl();	// Create a engine instance.        _engine = new ChessEngineImpl( _game, null, _board, false);	// Set the pieces on their initial positions.	_board.initialPosition();	// Move the white pawn from e2 - e4	doPly( new PlyImpl( new PositionImpl( 12), new PositionImpl( 12 + 16), false));	// Move the black knight to f6	doPly( new PlyImpl( new PositionImpl( 62), new PositionImpl( 62 - 17), false));	// Move the white pawn to e5	doPly( new PlyImpl( new PositionImpl( 12 + 16), new PositionImpl( 12 + 16 +8), false));    }    /**     * Run the actual test.     */    private void minimaxTest1() {	// Compute the best ply for this game position.	Ply bestPly = _engine.computeBestPly();	// Check if e7 - e5 was delivered as the best ply.	assertTrue( "Engine computed invalid ply e7-e5"		    , ( ( bestPly.getSource().getSquareIndex() != 52) 			|| ( bestPly.getDestination().getSquareIndex() != ( 52 - 15))));    }    /**     * Perform a ply.     *     * @param ply The ply to perform.     */    private void doPly( Ply ply) {	_game.doPly( ply);	_board.doPly( ply);    }}