/*  PlyGeneratorTest6 - A test for a valid bishop move.  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.engine.hashtable.*;import de.java_chess.javaChess.game.*;import de.java_chess.javaChess.piece.*;import de.java_chess.javaChess.ply.*;import de.java_chess.javaChess.position.*;import junit.framework.*;/** * A simple test for the ply generator, if it generates * a bishop move f1-c4. */class PlyGeneratorTest6 extends TestCase {    // Instance variables    /**     * A game for the generator.     */    Game _game;    /**     * The analyzed board.     */    Board _board;    /**     * A ply generator.     */    PlyGenerator _plyGenerator;    /**     * The analyzer.     */    BitBoardAnalyzer _analyzer;    /**     * The moves before the problem occures.     */    String [] [] _prevMoves = { {"e2","e4"}, {"g8","f6"} };        // Constructors    /**     * Create a new instance of this test.     */    public PlyGeneratorTest6() {	super( "A simple ply generator test for a bishop move f1-c4");    }        // Methods    /**     * Run the actual test(s).     */    public void runTest() {	generatorTest();    }        /**     * Prepare the test(s).     */    protected void setUp() {	// Create a new game.	_game = new GameImpl();	// Create a new board.	_board = new BitBoardImpl();	// Create the ply generator.	_plyGenerator = new PlyGenerator( _game, (BitBoard)_board, new PlyHashtableImpl( 100));	// And the analyzer.	_analyzer = new BitBoardAnalyzerImpl( _game, _plyGenerator);	_plyGenerator.setAnalyzer( _analyzer);	// Set the pieces on their initial positions.	_board.initialPosition();	// Perform the moves to get to the tested board position.	for( int i=0; i < _prevMoves.length; i++) {	    doPly( new PlyImpl( new PositionImpl( _prevMoves[i][0]), new PositionImpl( _prevMoves[i][1]), false));	}    }    /**     * Run the actual test.     */    private void generatorTest() {	// Get the plies for white	Ply [] plies = _plyGenerator.getPliesForColor( true);	// Check if d3 x h7 was delivered as a potential ply.	boolean containsMove = false;	for( int i = 0; i < plies.length; i++) {	    if( 5 == plies[i].getSource().getSquareIndex()		&& 26 == plies[i].getDestination().getSquareIndex()) {		containsMove = true;		break;	    }	}	assertTrue( "PlyGenerator computes bishop move f1 - c4", containsMove);    }    /**     * Perform a ply.     *     * @param ply The ply to perform.     */    private void doPly( Ply ply) {	_game.doPly( ply);	_board.doPly( ply);    }}