chess - Chess engine written in C++

Age	Commit message (Collapse)	Author
9 hours	feat(search): removing double clock check and instalny finish search with ↵HEAD main	Adam
	only one legal moves
15 hours	refactor(tests): making formating check be normal script	Adam

15 hours	feat(tests): adding hash testing to new tests	Adam

15 hours	refactor(tests): improving tests by creating testing cli app	Adam

38 hours	refactor(fen): making fen parser do incremental bitboards instead of looping ↵	Adam
	for each one
40 hours	refactor(move): making makemove function be nicer	Adam

41 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(magic): moving script to scripts/ folder	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

5 days	removing chess rules pdf after engine doesnt need it that much	Adam

5 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

6 days	featuare(fen): validating king counts before accepting fen string	Adam

6 days	fix(tests): making zobrist tests use json	Adam

6 days	refactor(uci): making us print engine name using cerr instead of cout	Adam

6 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	gitignore	Adam

7 days	fix(git): adding a kdevelop to gitignore	Adam

7 days	adding zobrist hashing	Adam

7 days	addding binary and build file to git ignore	Adam

7 days	refactor(board): refactoring move generation code into better and nice way + ↵	Adam
	adding debug command moves
7 days	refactor(ci) cleaning ci a little	Adam

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
8 days	fix(search) making quiecen search have same mid search logic as main search	Adam

9 days	refocator(ci): removig gitlab ci that no longer used	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
10 days	adding a tests folder in scripts	Adam

10 days	removing github ci and creating scripts for helping 'run ci at home'	Adam

10 days	test	Adam