📄 premovenodesgen.java
字号:
package chinesechess.engine;
import java.io.IOException;
import java.util.Random;
public class PreMoveNodesGen {
private static Random rand = new Random();
public static long ZobristKeyPlayer;
public static long ZobristLockPlayer;
public static long[][] ZobristKeyTable = new long[14][90];
public static long[][] ZobristLockTable = new long[14][90];
// PreMoveNodesGen Procedures
public static final int[] KingIndex = {
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
0, 1, 2, -1, -1, -1, -1, 3, 4, 5,
6, 7, 8, -1, -1, -1, -1, 9, 10, 11,
12, 13, 14, -1, -1, -1, -1, 15, 16, 17,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1
};
//处于将军状态的各种位棋盘!
public static final BitBoard[] BitMask=new BitBoard[90];
public static final BitBoard[] CheckLegs=new BitBoard[18];//帅将每个位置别马腿的位棋盘
public static final BitBoard[][] KnightPinCheck=new BitBoard[18][256];
//除去别腿位置有子的将军位置
public static final BitBoard[][] FileRookCheck=new BitBoard[18][1024];
//FileRookCheck[indexOfKing][bitBoardOfRook]=checkBitBoardOfRook
public static final BitBoard[][] FileCannonCheck=new BitBoard[18][1024];
public static final BitBoard[][] RankRookCheck=new BitBoard[18][512];
public static final BitBoard[][] RankCannonCheck=new BitBoard[18][512];
public static final BitBoard[] PawnCheck=new BitBoard[18];
//Arrays for Move Generations
public static final int[][] KingMoves=new int[90][8];
//KingMoves[oldLoc][index]=newLoc(-1=invalid)
public static final int[][] AdvisorMoves=new int[90][8];
public static final int[][] BishopMoves=new int[90][8];
public static final int[][] ElephantEyes=new int[90][4];
public static final int[][] KnightMoves=new int[90][12];
public static final int[][] HorseLegs=new int[90][8];
public static final int[][][] FileNonCapMoves=new int[10][1024][12];
//共十条横线,FileNonCapMoves[y][bitWordY][index]=newY,进
public static final int[][][] FileRookCapMoves=new int[10][1024][4];
public static final int[][][] FileCannonCapMoves=new int[10][1024][4];
public static final int[][][] RankNonCapMoves=new int[9][512][12];
//RankNonCapMoves[x][bitWordX][index]=newX,平
public static final int[][][] RankRookCapMoves=new int[9][512][4];
public static final int[][][] RankCannonCapMoves=new int[9][512][4];
public static final int[][][] PawnMoves=new int[90][2][4];
//PawnMoves[oldLoc][redOrblack][index]=newLoc
//Arrays for Move Validitiy Detections
public static final int[][] FileNonCapMax=new int[10][1024];
//FileNonCapMax[y][bitwordY]=MaxY//进退
public static final int[][] FileNonCapMin=new int[10][1024];
//FileNonCapMax[y][bitwordY]=MinY
public static final int[][] FileRookCapMax=new int[10][1024];
public static final int[][] FileRookCapMin=new int[10][1024];
public static final int[][] FileCannonCapMax=new int[10][1024];
public static final int[][] FileCannonCapMin=new int[10][1024];
public static final int[][] RankNonCapMax=new int[9][512];//平
public static final int[][] RankNonCapMin=new int[9][512];
public static final int[][] RankRookCapMax=new int[9][512];
public static final int[][] RankRookCapMin=new int[9][512];
public static final int[][] RankCannonCapMax=new int[9][512];
public static final int[][] RankCannonCapMin=new int[9][512];
static{
zobristGen();
preMoveGen();
}
//--------------------------------------------------------------------------
private PreMoveNodesGen(){
}
//---------------------------------------------------------------------------
public static void zobristGen() {
int i, j;
long RandSeed;
RandSeed = 1;
rand.setSeed(RandSeed);
ZobristKeyPlayer = rand.nextLong();
for (i = 0; i < 14; i ++) {
for (j = 0; j < 90; j ++) {
ZobristKeyTable[i][j] = rand.nextLong();
}
}
ZobristLockPlayer = rand.nextLong();
for (i = 0; i < 14; i ++) {
for (j = 0; j < 90; j ++) {
ZobristLockTable[i][j] = rand.nextLong();
}
}
}
//--------------------------------------------------------------------------
private static boolean InCity(int x, int y) {
return (x >= 3 && x <= 5 && (y >= 0 && y <= 2 || y >= 7 && y <= 9));
}
private static boolean InBoard(int x, int y) {
return (x >= 0 && x <= 8 && y >= 0 && y <= 9);
}
private static void preMoveGen() {
int i, j, k, l, m, Index, IndexKing;
BitBoard TempBoard;
for (i = 0; i < 90; i ++) {
BitMask[i] = new BitBoard(1, 0, 0);
BitMask[i].leftShift(i);
}
for (i = 0; i < 9; i ++) {
for (j = 0; j < 10; j ++) {
IndexKing = KingIndex[i * 10 + j];
if (IndexKing != -1) {
// 马将军Nodes
CheckLegs[IndexKing] = new BitBoard(0);
for (k = -1; k <= 1; k += 2) {
for (l = -1; l <= 1; l += 2) {
CheckLegs[IndexKing].assignOr(BitMask[(i + k) * 10 + j + l]);
}
}
for (k = 0; k < 256; k ++) {
KnightPinCheck[IndexKing][k] = new BitBoard(0);
TempBoard = CheckLegs[IndexKing].opAnd(BitBoard.Duplicate(k));
for (l = -1; l <= 1; l += 2) {
for (m = -1; m <= 1; m += 2) {
if (InBoard(i + l, j + m * 2)) {
if (!((TempBoard.opAnd(BitMask[(i + l) * 10 + j + m])).notZero())) {
KnightPinCheck[IndexKing][k].assignOr(BitMask[(i + l) * 10 + j + m * 2]);
}
}
if (InBoard(i + l * 2, j + m)) {
if (!((TempBoard.opAnd(BitMask[(i + l) * 10 + j + m])).notZero())) {
KnightPinCheck[IndexKing][k].assignOr(BitMask[(i + l * 2) * 10 + j + m]);
}
}
}
}
}
// 车炮将军（File）Nodes
for (k = 0; k < 1024; k ++) {
FileRookCheck[IndexKing][k] = new BitBoard(0);
FileCannonCheck[IndexKing][k] = new BitBoard(0);
for (l = j + 1; l <= 9; l ++) {
if ((k & (1 << l))!=0) {
FileRookCheck[IndexKing][k].assignOr(BitMask[i * 10 + l]);
l ++;
break;
}
}
for (; l <= 9; l ++) {//通过上面的循环已隔一子
if ((k & (1 << l))!=0) {
FileCannonCheck[IndexKing][k].assignOr(BitMask[i * 10 + l]);
break;
}
}
for (l = j - 1; l >= 0; l --) {
if ((k & (1 << l))!=0) {
FileRookCheck[IndexKing][k].assignOr(BitMask[i * 10 + l]);
l --;
break;
}
}
for (; l >= 0; l --) {
if ((k & (1 << l))!=0) {
FileCannonCheck[IndexKing][k].assignOr(BitMask[i * 10 + l]);
break;
}
}
}
// 车炮将军（Rank）Nodes
for (k = 0; k < 512; k ++) {
RankRookCheck[IndexKing][k] = new BitBoard(0);
RankCannonCheck[IndexKing][k] = new BitBoard(0);
for (l = i + 1; l <= 8; l ++) {
if ((k & (1 << l))!=0) {
RankRookCheck[IndexKing][k].assignOr(BitMask[l * 10 + j]);
l ++;
break;
}
}
for (; l <= 8; l ++) {
if ((k & (1 << l))!=0) {
RankCannonCheck[IndexKing][k].assignOr(BitMask[l * 10 + j]);
break;
}
}
for (l = i - 1; l >= 0; l --) {
if ((k & (1 << l))!=0) {
RankRookCheck[IndexKing][k].assignOr(BitMask[l * 10 + j]);
l --;
break;
}
}
for (; l >= 0; l --) {
if ((k & (1 << l))!=0) {
RankCannonCheck[IndexKing][k].assignOr(BitMask[l * 10 + j]);
break;
}
}
}
// 兵将军Nodes
PawnCheck[IndexKing] = new BitBoard(0);
PawnCheck[IndexKing].assignOr(BitMask[j >= 5 ? i * 10 + j - 1 : i * 10 + j + 1]);//将的前方
for (l = -1; l <= 1; l += 2) {//将的两边
PawnCheck[IndexKing].assignOr(BitMask[(i + l) * 10 + j]);
}
}
// 将走法Nodes
Index = 0;
for (k = -1; k <= 1; k += 2) {
if (InCity(i + k, j)) {//平
KingMoves[i * 10 + j][Index] = (i + k) * 10 + j;
Index ++;
}
if (InCity(i, j + k)) {
KingMoves[i * 10 + j][Index] = i * 10 + j + k;
Index ++;
}
}
KingMoves[i * 10 + j][Index] = -1;
// 士Nodes
Index = 0;
for (k = -1; k <= 1; k += 2) {
for (l = -1; l <= 1; l += 2) {
if (InCity(i + k, j + l)) {
AdvisorMoves[i * 10 + j][Index] = (i + k) * 10 + j + l;
Index ++;
}
}
}
AdvisorMoves[i * 10 + j][Index] = -1;
// 相Nodes
Index = 0;
for (k = -2; k <= 2; k += 4) {
for (l = -2; l <= 2; l += 4) {
if (InBoard(i + k, j + l)) {
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -