aboutsummaryrefslogtreecommitdiff
path: root/src
AgeCommit message (Collapse)Author
43 hoursrefactor(evaluation): adjusting piece valuesAdam
2 daysrefactor(uci): removing out of date headerAdam
3 daysrefactor(search): making code nicer and little fasterAdam
4 daysperf(board): using magic bitboards for is square attacked helperAdam
4 daysperf(board): making is square attacked helper use modern bitboard aproachAdam
5 daysrefactor(hash): refactoring hash logic to be betterAdam
5 daysperf(board): making hashing use incremental XORs instead of rebuild from scratchAdam
5 daysrefactor(move): refactoring move to be nicer and betterAdam
6 daystest commitAdam
6 daysperf(move): making undo move use incremental bitboard aproah instead of ↵Adam
generation from scrath each time
6 daysrefactor(move): making a helperAdam
6 daysrefactor(all):Adam
6 daysperf(board): implementing magic bitboards for faster move generationAdam
7 daysfeatuare(fen): validating king counts before accepting fen stringAdam
7 daysfix(tests): making zobrist tests use jsonAdam
7 daysrefactor(uci): making us print engine name using cerr instead of coutAdam
7 daysrefactor(board): making king use same bitboard precompute bitboard style ↵Adam
logic as knights
7 daysfix(book): making engine turn caslting moves into uci perpesentation only if ↵Adam
there is a king
7 daysfix(book): fixing critical castling bugAdam
7 daysrefactor(book): refactoring opening book codeAdam
7 daysadding zobrist hashingAdam
8 daysrefactor(board): refactoring move generation code into better and nice way + ↵Adam
adding debug command moves
8 daysrefactor(board): using auto with static castAdam
8 daysrefactor(board): making generate knight moves use const referenceAdam
8 daysrefactor(board): refactoring pawn move generation code for better perfomance ↵Adam
and quality
9 daysfix(search) making quiecen search have same mid search logic as main searchAdam
9 daysfix(uci): validate moves before accepting themAdam
9 daysrefactor(formating): fixing formatingAdam
9 daysperf(draw) instead of having a hash map for three fold repetion check now we ↵Adam
have
9 daysFixing compiler errorsAdam
9 daysremoving 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 daysrenaming thingsAdam
9 daysmaking bot thing moreAdam
9 daysimplementing memory optimazied move using uint16_t instead of a four ↵Adam
integers and one byte
11 daysadding a create move helper functionAdam
11 daysadding more memory efficnet helper functionsAdam
11 daysmoving enum aroundAdam
12 daysupdating header fileAdam
13 daysfixingAdam
13 daysfixing transpoition table bugAdam
13 daysfixing syntax bugsAdam
13 daysimprovign bot by giving king endgame tableAdam
14 daysremoving usuded importsAdam
14 daysimproving codeAdam
14 daysimproving knight move gen codeAdam
14 daysremoving useless checksAdam
14 daysremoving hard coded knight movesAdam
14 daysmodernizing the codeAdam
14 dayspolishingAdam
14 dayspolishingAdam