sinusfox/FC-Chess
Archived
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

updated checkMovesKnight()

Browse Source
This commit is contained in:
AdmiralEmser
2022-10-29 11:43:19 +02:00
parent 923b4d6d0c
commit c4b5e69cac
1 changed files with 21 additions and 39 deletions
Download Patch File Download Diff File Expand all files Collapse all files
FC-Chess/FC-Chess.cpp
+21 -39
View File
@@ -177,63 +177,45 @@ void FCC::Chess::checkMovesDiagonal()
void FCC::Chess::checkMovesKnight() void FCC::Chess::checkMovesKnight()
{ {
// creating variables for x and y
uint8_t i = selX, j = selY;
// checking possible moves // checking possible moves
i += 1, j += 3; if (checkIsPosInBounds(selX + 1, selY + 3))
if (checkIsPosInBounds(i, j))
{ {
if (!checkIsFriendlyOnField(i, j)) posPossible[i][j] = true; if (!checkIsFriendlyOnField(selX + 1, selY + 3)) posPossible[selX + 1][selY + 3] = true;
} }
i = selX, j = selY; // resetting variables if (checkIsPosInBounds(selX + 1, selY - 3))
i += 1, j -= 3;
if (checkIsPosInBounds(i, j))
{ {
if (!checkIsFriendlyOnField(i, j)) posPossible[i][j] = true; if (!checkIsFriendlyOnField(selX + 1, selY - 3)) posPossible[selX + 1][selY - 3] = true;
}
if (checkIsPosInBounds(selX - 1, selY + 3))
{
if (!checkIsFriendlyOnField(selX - 1, selY + 3)) posPossible[selX - 1][selY + 3] = true;
} }
i = selX, j = selY; // resetting variables if (checkIsPosInBounds(selX - 1, selY - 3))
i -= 1, j += 3;
if (checkIsPosInBounds(i, j))
{ {
if (!checkIsFriendlyOnField(i, j)) posPossible[i][j] = true; if (!checkIsFriendlyOnField(selX - 1, selY - 3)) posPossible[selX - 1][selY - 3] = true;
} }
i = selX, j = selY; // resetting variables if (checkIsPosInBounds(selX + 3, selY + 1))
i -= 1, j -= 3;
if (checkIsPosInBounds(i, j))
{ {
if (!checkIsFriendlyOnField(i, j)) posPossible[i][j] = true; if (!checkIsFriendlyOnField(selX + 3, selY + 1)) posPossible[selX + 3][selY + 1] = true;
} }
i = selX, j = selY; // resetting variables if (checkIsPosInBounds(selX + 3, selY - 1))
i += 3, j += 1;
if (checkIsPosInBounds(i, j))
{ {
if (!checkIsFriendlyOnField(i, j)) posPossible[i][j] = true; if (!checkIsFriendlyOnField(selX + 3, selY - 1)) posPossible[selX + 3][selY - 1] = true;
} }
i = selX, j = selY; // resetting variables if (checkIsPosInBounds(selX - 3, selY + 1))
i += 3, j -= 1;
if (checkIsPosInBounds(i, j))
{ {
if (!checkIsFriendlyOnField(i, j)) posPossible[i][j] = true; if (!checkIsFriendlyOnField(selX - 3, selY + 1)) posPossible[selX - 3][selY + 1] = true;
} }
i = selX, j = selY; // resetting variables if (checkIsPosInBounds(selX - 3, selY - 1))
i -= 3, j += 1;
if (checkIsPosInBounds(i, j))
{ {
if (!checkIsFriendlyOnField(i, j)) posPossible[i][j] = true; if (!checkIsFriendlyOnField(selX - 3, selY - 1)) posPossible[selX - 3][selY - 1] = true;
}
i = selX, j = selY; // resetting variables
i -= 3, j -= 1;
if (checkIsPosInBounds(i, j))
{
if (!checkIsFriendlyOnField(i, j)) posPossible[i][j] = true;
} }
} }