analyzertest2.java

来自「chess 一个beguanyu国际象棋的一个Java源码」· Java 代码 · 共 153 行

/*
  AnalyzerTest2 - The second test for the board analyzer.

  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 BitBoardAnalyzer.
 */
class AnalyzerTest2 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 AnalyzerTest2() {
	super( "A simple analyzer test for a opening strategy");
    }

    
    // Methods 

    /**
     * Run the actual test(s).
     */
    public void runTest() {
	analyzerTest2();
    }
    
    /**
     * 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, new PlyHashtableImpl( 1000));

	// And the analyzer.
	_analyzer = new BitBoardAnalyzerImpl( _game, _plyGenerator);
    }
	
    /**
     * Run the actual test.
     */
    private void analyzerTest2() {

	prepareTest();

	// Move the black pawn to e5 and analyze the board
	doPly( new PlyImpl( new PositionImpl( "e7"), new PositionImpl( "e5"), false));

	// Do the 1st analysis
	short score1 = _analyzer.analyze( (BitBoard)_board, true);

	prepareTest();

	doPly( new PlyImpl( new PositionImpl( "g8"), new PositionImpl( "h6"), false));

	// Analyze the board after the ply
	short score2 = _analyzer.analyze( (BitBoard)_board, false);

	// Check if the 2nd board is better for white.
	assertTrue( "Analyzer prefers pawn move", score2 > score1);
    }

    /**
     * Prepare the opening test.
     */
    private final void prepareTest() {
	reset();
	// Move a white pawn to the 4th row
	doPly( new PlyImpl( new PositionImpl( "e2"), new PositionImpl( "e4"), false));
    }

    /**
     * Reset the game for a new score.
     */
    private final void reset() {
	_game.reset();
	_board.initialPosition();
    }

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