GGchessGui/Is_Can_Move.cpp at master · leedavid/GGchessGui · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
#include "stdafx.h"
#include "data.h"
#include "chess.h"
#include "Resource.h"
#include "pregen.h"


BOOL Is_Can_Move_To_Eat(position_t *pos,int from, int to){

    int tmp;

	int fx      = StoX(from);
    int fy      = StoY(from);

	int tx      = StoX(to);
    int ty      = StoY(to);

	int kpos;

	if(IsWhite(pos->b256[from])){
		if(pos->b256[from] != RKING){
			kpos = PieceListStart(pos,RKING);
		}
		else{
			kpos = to;
		}
	}
	else{
		if(pos->b256[from] != BKING){
		    kpos = PieceListStart(pos,BKING);
		}
		else{
			kpos = to;
		}
	}

	int kx       = StoX(kpos);
    int ky       = StoY(kpos);

    int kr       = pos->wBitRanks[ky];
    int kf       = pos->wBitFiles[kx];

    int tr       = pos->wBitRanks[ty];
    int tf       = pos->wBitFiles[tx];        //


	if(IsWhite(pos->b256[from])){          //判断红的能不能走棋
		// a, 在将军的马腿上的棋子不可走, 但如果是吃那个马就可走
		//for(tmp = PieceListStart(pos,BMA); tmp > 0x32; tmp = NextPiece(pos,tmp)){
		//	int m = horseLegTab(kpos-tmp+256);
		//	if(m){
		//		if((tmp+m)==from && to != tmp){
		//			return FALSE;
		//		}
		//	}
		//}
		// 2, 更新一下FR
		if(tx == kx){
			kf |= yBitMask(to);
		}
		if(ty == ky){
			kr |= xBitMask(to);
		}
		if(fx == kx){
			kf ^= yBitMask(from);
		}
		if(fy == ky){
			kr ^= xBitMask(from);
		}

		SlideMaskStruct *psmsRank = RankMask(kx,kr);
        SlideMaskStruct *psmsFile = FileMask(ky,kf);

		//再计算一下, 车,炮,将能不能将, 这儿得加上将哇
		for(tmp = PieceListStart(pos,BCHE); tmp > 0x32; tmp = NextPiece(pos,tmp)){
			if(tmp != to){
				int x = StoX(tmp);
				int y = StoY(tmp);
				if(x == kx){
					if(psmsFile->RookCap & yBitMask(tmp)){
						return (FALSE);
					}
				}
				else if(y == ky){
					if(psmsRank->RookCap & xBitMask(tmp)){
						return (FALSE);
					}
				}
			}
		}
		//再计算一下炮
		for(tmp = PieceListStart(pos,BPAO); tmp > 0x32; tmp = NextPiece(pos,tmp)){
			if(tmp != to){
				int x = StoX(tmp);
				int y = StoY(tmp);
				if(x == kx){
					if(psmsFile->CannonCap & yBitMask(tmp)){
						return (FALSE);
					}
				}
				else if(y == ky){
					if(psmsRank->CannonCap & xBitMask(tmp)){
						return (FALSE);
					}
				}
			}
		}
		//再计算一下是不是对将了
		tmp = PieceListStart(pos,BKING);
		if(StoX(tmp) == kx){
			if(psmsFile->RookCap & yBitMask(tmp)){
				return (FALSE);
			}
		}

		/*for(tmp = PieceListStart(pos,BMA); tmp > 0x32 && to != tmp; tmp = NextPiece(pos,tmp)){*/
		for(tmp = PieceListStart(pos,BMA); tmp > 0x32 ; tmp = NextPiece(pos,tmp)){

			if(to != tmp){
				int m = horseLegTab(kpos-tmp+256);
				if(m){
					//if((tmp+m)==from && to != tmp){
					//	return FALSE;
					//}

					//if(!pos->b256[tmp+m]){   //马腿上没有棋子
					//	return FALSE;
					//}

					if(from == tmp + m){
						return false;
					}
				}
			}
		}
	}
	else{                                  //判断黑的能不能走棋
		//for(tmp = PieceListStart(pos,RMA); tmp > 0x32; tmp = NextPiece(pos,tmp)){
		//	int m = horseLegTab(kpos-tmp+256);
		//	if(m){   //红马可能在将军
		//		//if((tmp+m)==from && to != tmp){
		//		//	return FALSE;  //在红马的将军的脚上的棋不能走
		//		//}
		//		if(!pos->b256[tmp+m]){   //马腿上没有棋子
		//		}
		//		else if((tmp+m)==from && to != tmp){
		//			return FALSE;
		//		}
		//	}
		//}
		// 2, 更新一下FR
		if(tx == kx){
			kf |= yBitMask(to);
		}
		if(ty == ky){
			kr |= xBitMask(to);
		}
		if(fx == kx){
			kf ^= yBitMask(from);
		}
		if(fy == ky){
			kr ^= xBitMask(from);
		}

		SlideMaskStruct *psmsRank = RankMask(kx,kr);
		SlideMaskStruct *psmsFile = FileMask(ky,kf);

		for(tmp = PieceListStart(pos,RCHE); tmp > 0x32; tmp = NextPiece(pos,tmp)){
			if(tmp != to){
				int x = StoX(tmp);
				int y = StoY(tmp);
				if(x == kx){
					if(psmsFile->RookCap & yBitMask(tmp)){
						return (FALSE);
					}
				}
				else if(y == ky){
					if(psmsRank->RookCap & xBitMask(tmp)){
						return (FALSE);
					}
				}
			}
		}

		for(tmp = PieceListStart(pos,RPAO); tmp > 0x32; tmp = NextPiece(pos,tmp)){
			if(tmp != to){
				int x = StoX(tmp);
				int y = StoY(tmp);
				if(x == kx){
					if(psmsFile->CannonCap & yBitMask(tmp)){
						return (FALSE);
					}
				}
				else if(y == ky){
					if(psmsRank->CannonCap & xBitMask(tmp)){
						return (FALSE);
					}
				}
			}
		}

		tmp = PieceListStart(pos,RKING);
		if(StoX(tmp) == kx){
			if(psmsFile->RookCap & yBitMask(tmp)){
				return (FALSE);
			}
		}

		/*for(tmp = PieceListStart(pos,RMA); tmp > 0x32 && to != tmp; tmp = NextPiece(pos,tmp)){*/
		for(tmp = PieceListStart(pos,RMA); tmp > 0x32 ; tmp = NextPiece(pos,tmp)){

			if(to != tmp){

				int m = horseLegTab(kpos-tmp+256);
				if(m){   //红马可能在将军
					//if((tmp+m)==from && to != tmp){
					//	return FALSE;  //在红马的将军的脚上的棋不能走
					//}
					//if(!pos->b256[tmp+m]){   //马腿上没有棋子
					//	return FALSE;
					//}

					if(from == tmp + m){
						return false;
					}

					//if((tmp+m)==from && to != tmp){
					//	return FALSE;
					//}
				}
			}
		}
	}

	return TRUE;
}