plygeneratortest2.java

elcome to the Java-Chess project! As you might know, we aim at creating a fully functional chess

/*
  PlyGeneratorTest2 - A test for diagonal pawn captures.

  Copyright (C) 2003 The Java-Chess team <[e-mail]>

  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 capture on g3.
 */
class PlyGeneratorTest2 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;

    
    // Constructors

    /**
     * Create a new instance of this test.
     */
    public PlyGeneratorTest2() {
	super( "A simple ply generator test with a attack on the knight g3");
    }

    
    // 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( _plyGenerator);

	_plyGenerator.setAnalyzer( _analyzer);

	// 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)));

	// Move the black knight to f6
	doPly( new PlyImpl( new PositionImpl( 62), new PositionImpl( 62 - 17)));

	// Move the white pawn to e5
	doPly( new PlyImpl( new PositionImpl( 12 + 16), new PositionImpl( 12 + 16 +8)));

	// Move the black knight to e4
	doPly( new PlyImpl( new PositionImpl( 62- 17), new PositionImpl( 12 + 16)));

	// Move f2 - f3
	doPly( new PlyImpl( new PositionImpl( 13), new PositionImpl( 13 + 8)));

	// Move the black knight to g3 (??)
	doPly( new PlyImpl( new PositionImpl( 12 + 16), new PositionImpl( 14 + 8)));
    }

    /**
     * Run the actual test.
     */
    private void generatorTest() {

	// Get the plies for black
	Ply [] plies = _plyGenerator.getPliesForColor( true);

	// Check if h2 - g3 was delivered as a potential ply.
	boolean containsCaptureMove = false;

	for( int i = 0; i < plies.length; i++) {
	    if( plies[i].getSource().getSquareIndex() == 15
		&& plies[i].getDestination().getSquareIndex() == 22) {
		containsCaptureMove = true;
		break;
	    }
	}

	assertTrue( "PlyGenerator computes capture move h2 - g3", containsCaptureMove);
    }

    /**
     * Perform a ply.
     *
     * @param ply The ply to perform.
     */
    private void doPly( Ply ply) {
	_game.doPly( ply);
	_board.doPly( ply);
    }
}