index
:
chess
main
Chess engine written in C++
Adam
about
summary
refs
log
tree
commit
diff
log msg
author
committer
range
path:
root
/
src
Age
Commit message (
Collapse
)
Author
40 hours
refactor(fen): making fen parser do incremental bitboards instead of looping ↵
Adam
for each one
42 hours
refactor(move): making makemove function be nicer
Adam
43 hours
refactor(evaluation): adjusting piece values
Adam
2 days
refactor(uci): removing out of date header
Adam
3 days
refactor(search): making code nicer and little faster
Adam
4 days
perf(board): using magic bitboards for is square attacked helper
Adam
4 days
perf(board): making is square attacked helper use modern bitboard aproach
Adam
5 days
refactor(hash): refactoring hash logic to be better
Adam
5 days
perf(board): making hashing use incremental XORs instead of rebuild from scratch
Adam
5 days
refactor(move): refactoring move to be nicer and better
Adam
6 days
test commit
Adam
6 days
perf(move): making undo move use incremental bitboard aproah instead of ↵
Adam
generation from scrath each time
6 days
refactor(move): making a helper
Adam
6 days
refactor(all):
Adam
6 days
perf(board): implementing magic bitboards for faster move generation
Adam
7 days
featuare(fen): validating king counts before accepting fen string
Adam
7 days
fix(tests): making zobrist tests use json
Adam
7 days
refactor(uci): making us print engine name using cerr instead of cout
Adam
7 days
refactor(board): making king use same bitboard precompute bitboard style ↵
Adam
logic as knights
7 days
fix(book): making engine turn caslting moves into uci perpesentation only if ↵
Adam
there is a king
7 days
fix(book): fixing critical castling bug
Adam
7 days
refactor(book): refactoring opening book code
Adam
7 days
adding zobrist hashing
Adam
8 days
refactor(board): refactoring move generation code into better and nice way + ↵
Adam
adding debug command moves
8 days
refactor(board): using auto with static cast
Adam
8 days
refactor(board): making generate knight moves use const reference
Adam
8 days
refactor(board): refactoring pawn move generation code for better perfomance ↵
Adam
and quality
9 days
fix(search) making quiecen search have same mid search logic as main search
Adam
9 days
fix(uci): validate moves before accepting them
Adam
9 days
refactor(formating): fixing formating
Adam
9 days
perf(draw) instead of having a hash map for three fold repetion check now we ↵
Adam
have
9 days
Fixing compiler errors
Adam
9 days
removing maximum depth now insted we are gonna just have constant thinging ↵
Adam
time of 7 seconds for now if no time controls are speficied
9 days
renaming things
Adam
9 days
making bot thing more
Adam
9 days
implementing memory optimazied move using uint16_t instead of a four ↵
Adam
integers and one byte
11 days
adding a create move helper function
Adam
11 days
adding more memory efficnet helper functions
Adam
11 days
moving enum around
Adam
12 days
updating header file
Adam
13 days
fixing
Adam
13 days
fixing transpoition table bug
Adam
13 days
fixing syntax bugs
Adam
13 days
improvign bot by giving king endgame table
Adam
14 days
removing usuded imports
Adam
14 days
improving code
Adam
14 days
improving knight move gen code
Adam
14 days
removing useless checks
Adam
14 days
removing hard coded knight moves
Adam
14 days
modernizing the code
Adam
[next]