ChessProject/Queen.cpp at master · yonatang8675/ChessProject · 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
#include <iostream> // input-output library
#include <string> // string library
#include "Chessman.h"
#include "Queen.h"

Queen::Queen(char type, string place) : Chessman(type, place)
{

}

Queen::~Queen()
{

}

string Queen::validMove(string movement, Game game)
{
	const int RET_INDEX = 0;
	const int LETTER_INDEX = 0, NUM_INDEX = 1;
	const int TO1 = 2, TO2 = 4, FROM1 = 0, FROM2 = 2;

	const string TO = movement.substr(TO1, TO2);
	const string FROM = movement.substr(FROM1, FROM2);

	string ret = "*";
	const char LETTER_TO = TO[LETTER_INDEX], NUM_TO = TO[NUM_INDEX];
	const char LETTER_FROM = FROM[LETTER_INDEX], NUM_FROM = FROM[NUM_INDEX];

	if (TO != FROM) // if is valid dest
	{
		if (game.isBlack(game.hasChessman(FROM)) != game.isBlack(game.hasChessman(TO))) // if is not same color
		{
			if (LETTER_TO == LETTER_FROM) // if it same letter
			{
				bool valid = true;
				char from_[] = { LETTER_FROM ,  NUM_FROM };

				if (NUM_TO > NUM_FROM)
					for (from_[NUM_INDEX] += 1; from_[NUM_INDEX] < NUM_TO; from_[NUM_INDEX]++)
						if (game.hasChessman(string(from_)) != NULL)
							valid = false;

				if (NUM_TO < NUM_FROM)
					for (from_[NUM_INDEX] -= 1; from_[NUM_INDEX] > NUM_TO; from_[NUM_INDEX]--)
						if (game.hasChessman(string(from_)) != NULL)
							valid = false;

				if (valid)
					ret[RET_INDEX] = VALID_MOVEMENT;

				else // if (!valid)
					ret[RET_INDEX] = INVALID_MOVEMENT;

			}
			else if (NUM_TO == NUM_FROM) // if is same number
			{
				bool valid = true;
				char from_[] = { LETTER_FROM ,  NUM_FROM };

				if (LETTER_TO > LETTER_FROM)
					for (from_[LETTER_INDEX] += 1; from_[LETTER_INDEX] < LETTER_TO; from_[LETTER_INDEX]++)
						if (game.hasChessman(string(from_)) != NULL)
							valid = false;

				if (LETTER_TO < LETTER_FROM)
					for (from_[LETTER_INDEX] -= 1; from_[LETTER_INDEX] > LETTER_TO; from_[LETTER_INDEX]--)
						if (game.hasChessman(string(from_)) != NULL)
							valid = false;

				if (valid)
					ret[RET_INDEX] = VALID_MOVEMENT;

				else // if (!valid)
					ret[RET_INDEX] = INVALID_MOVEMENT;

			}
			else // if it not same letter and number
			{
				if (LETTER_TO - NUM_TO == LETTER_FROM - NUM_FROM) // if is same remainder - option one
				{
					bool valid = true;
					char from_[] = { LETTER_FROM, NUM_FROM }; // make copy to source place

					if (LETTER_TO > LETTER_FROM)
					{
						for (int i = (int)LETTER_FROM + 1; i < (int)LETTER_TO; i++)
						{
							from_[LETTER_INDEX]++;
							from_[NUM_INDEX]++;

							if (game.hasChessman(string(from_)) != NULL) // cheek the way
								valid = false;
						}

						if (valid)
							ret[RET_INDEX] = VALID_MOVEMENT;

						else // if (!valid)
							ret[RET_INDEX] = INVALID_MOVEMENT;
					}
					else // if (LETTER_TO < LETTER_FROM)
					{

						for (int i = (int)LETTER_FROM - 1; i != (int)LETTER_TO; i--)
						{
							from_[LETTER_INDEX]--;
							from_[NUM_INDEX]--;

							if (game.hasChessman(string(from_)) != NULL) // cheek the way
								valid = false;
						}

						if (valid)
							ret[RET_INDEX] = VALID_MOVEMENT;

						else // if (!valid)
							ret[RET_INDEX] = INVALID_MOVEMENT;
					}
				}
				else // if is not same remainder
				{
					bool valid = true;
					bool found = false;
					char from_[] = { LETTER_FROM, NUM_FROM };

					if (LETTER_TO > LETTER_FROM)
					{
						for (int i = (int)LETTER_FROM + 1; i < (int)LETTER_TO; i++)
						{
							from_[LETTER_INDEX]++;
							from_[NUM_INDEX]--;

							if (game.hasChessman(string(from_)) != NULL) // cheek the way
								valid = false;
						}

						if (valid)
							ret[RET_INDEX] = VALID_MOVEMENT;

						else // if (!valid)
							ret[RET_INDEX] = INVALID_MOVEMENT;
					}
					else // if (LETTER_TO < LETTER_FROM)
					{
						for (int i = (int)LETTER_TO - 1; i > (int)LETTER_FROM; i--)
						{
							from_[LETTER_INDEX]--;
							from_[NUM_INDEX]++;
							if (game.hasChessman(string(from_)) != NULL) // cheek the way
								valid = false;
						}

						if (valid)
							ret[RET_INDEX] = VALID_MOVEMENT;

						else // if (!valid)
							ret[RET_INDEX] = INVALID_MOVEMENT;
					}
				}
			}
		}

		else // if source and dest is same color
		{
			ret[RET_INDEX] = DEST_PLACE_INVALID;
		}
	}

	else // if (TO == FROM)
	{
		ret[RET_INDEX] = SAME_SOURCE_AND_DEST;
	}


	return ret;
}