tiyn
/
yeschess
mirror of https://github.com/tiyn/yeschess
1
0
Fork 0
Code Issues Projects Releases Wiki Activity
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'ca73df4fbb'
${ noResults }
yeschess/tests/engineTest.nim

49 lines
1.5 KiB
Raw Normal View History Unescape

engine: first push for engine I created an engine, that uses a basic version of the minimax algorithm to evaluate a position. It then evaluates all the possible next moves in a given position and picks the one that has the best evaluation. Basic test cases were also added.
4 years ago
import einheit
tests: created tests dir The tests where cluttering the src dir so i moved them to a separate dir. Same goes for the binaries so i changed the outputdirectory for them and added these to the new gitignore file
4 years ago
include chess
project structure The project previously wasnt structured very well. Now the engine has its own module so its more visible what file belongs to what topic.
4 years ago
include engine/engine
engine: first push for engine I created an engine, that uses a basic version of the minimax algorithm to evaluate a position. It then evaluates all the possible next moves in a given position and picks the one that has the best evaluation. Basic test cases were also added.
4 years ago
refactoring: renaming classes and functions Renamed the 'game' type to 'chess' to make more sense of the existing filestructure. Doubled functions where removed.
4 years ago
testSuite ChessTest of TestSuite:
engine: first push for engine I created an engine, that uses a basic version of the minimax algorithm to evaluate a position. It then evaluates all the possible next moves in a given position and picks the one that has the best evaluation. Basic test cases were also added.
4 years ago
var
refactoring: renaming classes and functions Renamed the 'game' type to 'chess' to make more sense of the existing filestructure. Doubled functions where removed.
4 years ago
chess: Chess
engine: first push for engine I created an engine, that uses a basic version of the minimax algorithm to evaluate a position. It then evaluates all the possible next moves in a given position and picks the one that has the best evaluation. Basic test cases were also added.
4 years ago
method setup() =
refactoring: renaming classes and functions Renamed the 'game' type to 'chess' to make more sense of the existing filestructure. Doubled functions where removed.
4 years ago
self.chess = initChess()
engine: first push for engine I created an engine, that uses a basic version of the minimax algorithm to evaluate a position. It then evaluates all the possible next moves in a given position and picks the one that has the best evaluation. Basic test cases were also added.
4 years ago
engine: engine now correctly uses the negamax algorithm NegaMax is a simplified version of the MiniMax algorithm that doesn't need different subroutines for the different colors. The testcases were selected and extended. Evaluation now has values for draws and wins.
4 years ago
method testPieceEvalStalemate() =
chess: chess to fen notation added Now there is a method to turn a chess object into a fen-string. Additionally the enPassant handling was changed. There can be only one enPassant field at a time. So a new attribute was added to the chess object that stores the field for the enPassant capture. If there is no enPassant field it will be set to -1.
4 years ago
self.chess = initChess("8/8/2k5/8/8/5K2/8/8 b - - 0 1")
var pieceEvaluation = self.chess.evaluate()
engine: first push for engine I created an engine, that uses a basic version of the minimax algorithm to evaluate a position. It then evaluates all the possible next moves in a given position and picks the one that has the best evaluation. Basic test cases were also added.
4 years ago
self.check(pieceEvaluation == 0)
engine: engine now correctly uses the negamax algorithm NegaMax is a simplified version of the MiniMax algorithm that doesn't need different subroutines for the different colors. The testcases were selected and extended. Evaluation now has values for draws and wins.
4 years ago
method testBestMoveProm() =
chess: chess to fen notation added Now there is a method to turn a chess object into a fen-string. Additionally the enPassant handling was changed. There can be only one enPassant field at a time. So a new attribute was added to the chess object that stores the field for the enPassant capture. If there is no enPassant field it will be set to -1.
4 years ago
self.chess = initChess("8/2k1P3/8/8/8/5K2/8/8 w - - 0 1")
refactoring: renaming classes and functions Renamed the 'game' type to 'chess' to make more sense of the existing filestructure. Doubled functions where removed.
4 years ago
var testBestMove = self.chess.bestMove(2)
engine: engine now correctly uses the negamax algorithm NegaMax is a simplified version of the MiniMax algorithm that doesn't need different subroutines for the different colors. The testcases were selected and extended. Evaluation now has values for draws and wins.
4 years ago
self.check(testBestMove.start != 0)
self.check(indToField(testBestMove.start) == "e7")
self.check(indToField(testBestMove.dest) == "e8")
method testBestMoveStopProm() =
chess: chess to fen notation added Now there is a method to turn a chess object into a fen-string. Additionally the enPassant handling was changed. There can be only one enPassant field at a time. So a new attribute was added to the chess object that stores the field for the enPassant capture. If there is no enPassant field it will be set to -1.
4 years ago
self.chess = initChess("8/2k1P3/8/8/8/5K2/8/8 b - - 0 1")
refactoring: renaming classes and functions Renamed the 'game' type to 'chess' to make more sense of the existing filestructure. Doubled functions where removed.
4 years ago
var testBestMove = self.chess.bestMove(2)
engine: engine now correctly uses the negamax algorithm NegaMax is a simplified version of the MiniMax algorithm that doesn't need different subroutines for the different colors. The testcases were selected and extended. Evaluation now has values for draws and wins.
4 years ago
self.check(testBestMove.start != 0)
engine: first push for engine I created an engine, that uses a basic version of the minimax algorithm to evaluate a position. It then evaluates all the possible next moves in a given position and picks the one that has the best evaluation. Basic test cases were also added.
4 years ago
self.check(indToField(testBestMove.start) == "c7")
self.check(indToField(testBestMove.dest) == "d7")
engine: engine now correctly uses the negamax algorithm NegaMax is a simplified version of the MiniMax algorithm that doesn't need different subroutines for the different colors. The testcases were selected and extended. Evaluation now has values for draws and wins.
4 years ago
method testBestMoveTacticBlack() =
chess: chess to fen notation added Now there is a method to turn a chess object into a fen-string. Additionally the enPassant handling was changed. There can be only one enPassant field at a time. So a new attribute was added to the chess object that stores the field for the enPassant capture. If there is no enPassant field it will be set to -1.
4 years ago
self.chess = initChess("8/2k3r1/8/6p1/5P2/8/4K1R1/8 b - - 0 1")
refactoring: renaming classes and functions Renamed the 'game' type to 'chess' to make more sense of the existing filestructure. Doubled functions where removed.
4 years ago
var testBestMove = self.chess.bestMove(2)
engine: engine now correctly uses the negamax algorithm NegaMax is a simplified version of the MiniMax algorithm that doesn't need different subroutines for the different colors. The testcases were selected and extended. Evaluation now has values for draws and wins.
4 years ago
self.check(testBestMove.start != 0)
engine: added piece-square tables Piece square tables are a way to encurage the engine to put pieces on active squares. Each piece got a corresponding table.
4 years ago
self.check(indToField(testBestMove.start) != "g5" or indToField(
testBestMove.dest) != "f4")
engine: engine now correctly uses the negamax algorithm NegaMax is a simplified version of the MiniMax algorithm that doesn't need different subroutines for the different colors. The testcases were selected and extended. Evaluation now has values for draws and wins.
4 years ago
method testBestMoveTacticWhite() =
chess: chess to fen notation added Now there is a method to turn a chess object into a fen-string. Additionally the enPassant handling was changed. There can be only one enPassant field at a time. So a new attribute was added to the chess object that stores the field for the enPassant capture. If there is no enPassant field it will be set to -1.
4 years ago
self.chess = initChess("8/2k3r1/8/5p2/6P1/8/4K1R1/8 w - - 0 1")
refactoring: renaming classes and functions Renamed the 'game' type to 'chess' to make more sense of the existing filestructure. Doubled functions where removed.
4 years ago
var testBestMove = self.chess.bestMove(2)
engine: engine now correctly uses the negamax algorithm NegaMax is a simplified version of the MiniMax algorithm that doesn't need different subroutines for the different colors. The testcases were selected and extended. Evaluation now has values for draws and wins.
4 years ago
self.check(testBestMove.start != 0)
engine: added piece-square tables Piece square tables are a way to encurage the engine to put pieces on active squares. Each piece got a corresponding table.
4 years ago
self.check(indToField(testBestMove.start) != "g4" or indToField(
testBestMove.dest) != "f5")
engine: engine now correctly uses the negamax algorithm NegaMax is a simplified version of the MiniMax algorithm that doesn't need different subroutines for the different colors. The testcases were selected and extended. Evaluation now has values for draws and wins.
4 years ago
engine: first push for engine I created an engine, that uses a basic version of the minimax algorithm to evaluate a position. It then evaluates all the possible next moves in a given position and picks the one that has the best evaluation. Basic test cases were also added.
4 years ago
when isMainModule:
einheit.runTests()