Some refactor and tests

This commit is contained in:
cdricms
2024-06-27 19:13:13 +02:00
parent 8b5c2a592e
commit 8556380dba
5 changed files with 88 additions and 40 deletions

View File

@@ -1,18 +1,21 @@
fileprivate func getDirectionalMoves(from pos: Square.Position, with dir: [(Int8, Int8)]) -> [Square.Position] {
var squares = [Square.Position]()
for i: (Int8, Int8) in dir {
var currentSquare = pos + i
while currentSquare.index != nil {
squares.append(currentSquare)
currentSquare += i
}
}
return squares
}
protocol DiagonalMoves {
func getDiagonalMoves(from pos: Square.Position) -> [Square.Position]
}
extension DiagonalMoves {
func getDiagonalMoves(from pos: Square.Position) -> [Square.Position] {
var squares = [Square.Position]()
for i: (Int8, Int8) in [(1, -1), (1, 1), (-1, 1), (-1, -1)] {
var currentSquare = pos + i
while currentSquare.index != nil {
squares.append(currentSquare)
currentSquare += i
}
}
return squares
getDirectionalMoves(from: pos, with: [(1, -1), (1, 1), (-1, 1), (-1, -1)])
}
}
@@ -22,14 +25,6 @@ protocol LinearMoves {
extension LinearMoves {
func getLinearMoves(from pos: Square.Position) -> [Square.Position] {
var squares = [Square.Position]()
for i: (Int8, Int8) in [(1, 0), (0, 1), (-1, 0), (0, -1)] {
var currentSquare = pos + i
while currentSquare.index != nil {
squares.append(currentSquare)
currentSquare += i
}
}
return squares
getDirectionalMoves(from: pos, with: [(1, 0), (0, 1), (-1, 0), (0, -1)])
}
}

View File

@@ -10,7 +10,16 @@ final class King: Piece {
var position: Square.Position
var pseudoLegalPositions: [Square.Position] {
return []
[
position + (1, 0),
position + (1, 1),
position + (0, 1),
position + (-1, 1),
position + (-1, 0),
position + (-1, -1),
position + (0, -1),
position + (1, -1)
].filter {$0.index != nil}
}
var legalPositions: [Square.Position] {

View File

@@ -10,17 +10,16 @@ final class Knight: Piece {
var position: Square.Position
var pseudoLegalPositions: [Square.Position] {
let directions: [Square.Position] = [
.init(rank: position.rank + 2, file: position.file + 1),
.init(rank: position.rank + 2, file: position.file - 1),
.init(rank: position.rank - 2, file: position.file + 1),
.init(rank: position.rank - 2, file: position.file - 1),
.init(rank: position.rank + 1, file: position.file + 2),
.init(rank: position.rank + 1, file: position.file - 2),
.init(rank: position.rank - 1, file: position.file + 2),
.init(rank: position.rank - 1, file: position.file - 2)
]
return directions.filter { $0.index != nil }
[
position + (2, 1),
position + (2, -1),
position + (-2, 1),
position + (-2, -1),
position + (1, 2),
position + (1, -2),
position + (-1, 2),
position + (-1, -2)
].filter { $0.index != nil }
}
var legalPositions: [Square.Position] {

View File

@@ -5,15 +5,12 @@ final class Pawn: Piece {
var position: Square.Position
var pseudoLegalPositions: [Square.Position] {
let sign: Int8 = color == .Black ? -1 : 1
let rank = Int8(position.rank)
let directions: [Square.Position] = [
.init(rank: rank + 1 * sign, file: position.file),
.init(rank: rank + 2 * sign, file: position.file),
.init(rank: rank + 1 * sign, file: position.file + 1),
.init(rank: rank + 1 * sign, file: position.file - 1)
]
// TODO: Handle en passant
return directions.filter { $0.index != nil }
return [
position + (1 * sign, 0),
position + (2 * sign, 0),
position + (1 * sign, 1),
position + (1 * sign, -1)
].filter { $0.index != nil }
}
var legalPositions: [Square.Position] {
pseudoLegalPositions.filter { isLegal(on: $0) }