BoardState.h

/*
 * 
 * Copyright (c) 2008-2014, Pedigree Developers
 *
 * Please see the CONTRIB file in the root of the source tree for a full
 * list of contributors.
 *
 * Permission to use, copy, modify, and distribute this software for any
 * purpose with or without fee is hereby granted, provided that the above
 * copyright notice and this permission notice appear in all copies.
 *
 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 */

#ifndef BOARDSTATE_H
#define BOARDSTATE_H

enum Side {White=0, Black=1};

#include "SideState.h"
#include "SearchAlgorithm.h"
#include <stdlib.h>

class BoardState
{
public:
  BoardState();

  ~BoardState();

  void move(Move m, Side s, Piece promotion=Pawn);
  
  bool isLegal(Move m, Side s);
  
  bool canCastle(Side side);
  bool inCheck(Side side);
  bool inCheckmate(Side side);
  bool underAttack(Square sq, Side side); // Is (col,row) under attack by side?
  bool rightCastleSquaresFree(Side side);
  bool leftCastleSquaresFree(Side side);

  Square firstPawn(Side s, Bitboard *b=NULL);
  Square nextPawn(Side s, Bitboard *b=NULL);
  Square firstRook(Side s, Bitboard *b=NULL);
  Square nextRook(Side s, Bitboard *b=NULL);
  Square firstKnight(Side s, Bitboard *b=NULL);
  Square nextKnight(Side s, Bitboard *b=NULL);
  Square firstBishop(Side s, Bitboard *b=NULL);
  Square nextBishop(Side s, Bitboard *b=NULL);
  Square firstQueen(Side s, Bitboard *b=NULL);
  Square nextQueen(Side s, Bitboard *b=NULL);
  Square firstKing(Side s, Bitboard *b=NULL);
  
  void swapSides();
  
  long heuristic(Side side);

  void dump();

  bool load(int minPly, Side toPlay, MoveList &ml, long &h);
  
  void save(int ply, Side toPlay, long h, MoveList &ml);
  void savePartial();

  void uncache(Side toPlay);

  uint32_t hash();
  uint32_t hash2();

  SideState white;
  SideState black;
  
  bool whiteInCheck; bool whiteCheckStateCalculated;
  bool blackInCheck; bool blackCheckStateCalculated;
  bool whiteInMate;  bool whiteMateStateCalculated;
  bool blackInMate;  bool blackMateStateCalculated;
  long cachedHash;   bool hashCalculated;
  long cachedHash2;  bool hash2Calculated;
};

#endif