Difference between revisions of "Unmake Move"

From Chessprogramming wiki
Jump to: navigation, search
m
Line 32: Line 32:
 
==1999==
 
==1999==
 
* [https://www.stmintz.com/ccc/index.php?id=40653 Unmake move v copy the board] by Hugh Cumper, [[CCC]], January 24, 1999
 
* [https://www.stmintz.com/ccc/index.php?id=40653 Unmake move v copy the board] by Hugh Cumper, [[CCC]], January 24, 1999
 +
* [https://www.stmintz.com/ccc/index.php?id=60557 Move Make/Unmake Questions] by [[Daniel Homan]], [[CCC]], July 15, 1999
 
==2000 ...==
 
==2000 ...==
 
* [http://groups.google.com/group/rec.games.chess.computer/browse_frm/thread/64f953b94ae312b Does Unmake Move Really Save Time?] by Adrian Jackson, [[Computer Chess Forums|rgcc]], March 08, 2001
 
* [http://groups.google.com/group/rec.games.chess.computer/browse_frm/thread/64f953b94ae312b Does Unmake Move Really Save Time?] by Adrian Jackson, [[Computer Chess Forums|rgcc]], March 08, 2001

Revision as of 18:20, 22 January 2019

Home * Chess * Moves * Unmake Move

Unmake Move is a function inside a chess program to update the internal chess position and its Board representation as well as associated or dependent state variables and data by a move unmade on the internal board. In unmake move, reversible aspects of a position can be incrementally updated by the inverse or own inverse operation of Make Move. Irreversible aspects of a position, such as ep state, castling rights and the halfmove clock are either restored from a stack (LIFO), or simply kept in arrays indexed by current search or game ply. Alternatively, one may capacitate the move with all the necessary information to recover those irreversible aspects of a position as well.

Negamax

This is how make and Unmake Move are applied inside a recursive search routine, for simplicity Negamax:

int negaMax( int depth ) {
    if ( depth == 0 ) return evaluate();
    int max = -oo;
    generateMoves(...);
    while ( m = getNextMove(...) )  {
        makeMove(m); 
        score = -negaMax( depth - 1 );
        unmakeMove(m); 
        if( score > max )
            max = score;
    }
    return max;
}

See also

Forum Posts

1999

2000 ...

2005 ...

2010 ...

2015 ...

Up one Level