public void switchWith(ThudPiece argPiece, ThudBoard board)
{
foreach (NEIGHBOUR n in myNeighbours.Keys)
{
argPiece.setNeighbour(n, myNeighbours[n]);
}
board.addActor(argPiece);
board.deleteFromBoard(this);
}
private bool isLegalShove(BoardPiece argPiece)
{
// Shove: anywhere there is a straight (orthogonal or diagonal) line of adjacent trolls on the board,
// they may shove the endmost troll in the direction continuing the line, up to as many spaces as there
// are trolls in the line.
// As in a normal move, the troll may not land on an occupied square, and any dwarfs in the eight squares
// adjacent to its final position may immediately be captured.
// Trolls may only make a shove if by doing so they capture at least one dwarf.
// if our target location is not occupied
if (!argPiece.isOccupied())
{
// and it is in a line with our location
if (isInLine(square.getLocation(), argPiece.getLocation()))
{
// if this location neighbours any dwarves
if (neighboursDwarves(argPiece))
{
int distance = this.getDistance(square.getBoardPosition(), argPiece.getBoardPosition());
NEIGHBOUR direction = ThudPiece.getOppositeNeighbour(this.getDirection(square.getLocation(), argPiece.getLocation()));
// iterate over the squares in the direction opposite of our destination
// equal to the distance we wish to move
// if all squares contain a troll, the shove is legal
BoardPiece bp = square;
for (int i = 0; i < distance; i++)
{
if (bp.isOccupied())
{
if (bp.getOccupant() is TrollPiece)
{
if (bp.hasNeighbour(direction))
{
bp = (BoardPiece)bp.getNeighbour(direction);
}
}
else
{
return(false);
}
}
else
{
return(false);
}
}
return(true);
}
}
}
return(false);
}
private bool isLegalHurl(BoardPiece argPiece)
{
// if our target location is occupied
if (argPiece.isOccupied())
{
// ... by a troll
if (argPiece.getOccupant() is TrollPiece)
{
// and it is in a line with our location
if (isInLine(square.getLocation(), argPiece.getLocation()))
{
int distance = this.getDistance(square.getBoardPosition(), argPiece.getBoardPosition());
NEIGHBOUR direction = ThudPiece.getOppositeNeighbour(this.getDirection(square.getLocation(), argPiece.getLocation()));
// iterate over the squares in the direction opposite of our destination
// equal to the distance we wish to move
// if all squares contain a dwarf, the hurl is legal
BoardPiece bp = square;
for (int i = 0; i < distance; i++)
{
if (bp.isOccupied())
{
if (bp.getOccupant() is DwarfPiece)
{
if (bp.hasNeighbour(direction))
{
bp = (BoardPiece)bp.getNeighbour(direction);
}
else if (i != distance - 1)
{
return(false);
}
}
else
{
return(false);
}
}
else
{
return(false);
}
}
return(true);
}
}
}
return(false);
}
public void setNeighbour(NEIGHBOUR argNeighbour, ThudPiece argPiece, bool recursive)
{
if (myNeighbours.ContainsKey(argNeighbour))
{
myNeighbours[argNeighbour] = argPiece;
}
else
{
myNeighbours.Add(argNeighbour, argPiece);
}
if (recursive)
{
argPiece.setNeighbour(getOppositeNeighbour(argNeighbour), this, false);
}
}
private void createBoard()
{
//make pieces
for (int x = 0; x < 15; x++)
{
for (int y = 0; y < 15; y++)
{
if (!isCorner(x, y))
{
bool even = false;
if ((x % 2 == 0 && y % 2 == 0) || (x % 2 == 1 && y % 2 == 1))
{
even = true;
}
BoardPiece tp = new BoardPiece(x * 66 + offset, y * 66 + offset, even);
tp.setLogic(logic);
tp.setBoardPosition(x, y);
this.addActor(tp);
pieces[x, y] = tp;
}
}
}
// set neighbours
for (int x = 0; x < 15; x++)
{
for (int y = 0; y < 15; y++)
{
if (pieceExists(x, y))
{
ThudPiece current = pieces[x, y];
if (pieceExists(x, y - 1))
{
current.setNeighbour(NEIGHBOUR.NORTH, pieces[x, y - 1]);
}
if (pieceExists(x + 1, y - 1))
{
current.setNeighbour(NEIGHBOUR.NORTHEAST, pieces[x + 1, y - 1]);
}
if (pieceExists(x + 1, y))
{
current.setNeighbour(NEIGHBOUR.EAST, pieces[x + 1, y]);
}
if (pieceExists(x + 1, y + 1))
{
current.setNeighbour(NEIGHBOUR.SOUTHEAST, pieces[x + 1, y + 1]);
}
if (pieceExists(x, y + 1))
{
current.setNeighbour(NEIGHBOUR.SOUTH, pieces[x, y + 1]);
}
if (pieceExists(x - 1, y + 1))
{
current.setNeighbour(NEIGHBOUR.SOUTHWEST, pieces[x - 1, y + 1]);
}
if (pieceExists(x - 1, y))
{
current.setNeighbour(NEIGHBOUR.WEST, pieces[x - 1, y]);
}
if (pieceExists(x - 1, y - 1))
{
current.setNeighbour(NEIGHBOUR.NORTHWEST, pieces[x - 1, y - 1]);
}
}
}
}
}
public void setNeighbour(NEIGHBOUR argNeighbour, ThudPiece argPiece)
{
this.setNeighbour(argNeighbour, argPiece, true);
}
public bool isNeighbour(ThudPiece argPiece)
{
return(myNeighbours.ContainsValue(argPiece));
}
