chessnost - Somewhat decent chess engine written in Rust

	Commit message (Collapse)	Author	Age	Lines
*	feat: use moves at cut-nodes as hash moves too	eug-vs	2023-01-25	-2/+10
\|
*	feat: add aspiration windows to iterative_deepning	eug-vs	2023-01-25	-4/+22
\|
*	feat!: check if transposition hash truly matches	eug-vs	2023-01-25	-9/+10
\|
*	Revert "refactor: return recoverable errors from make_move"	eug-vs	2023-01-25	-6/+3
\| \| \| \|	This reverts commit 8dc121b0e08cd25fab3eacde9318d7adaac1f2a4.
*	feat: implement iterative deepening	eug-vs	2023-01-25	-15/+30
\|
*	feat: enable quiscence in negamax	eug-vs	2023-01-25	-12/+22
\|
*	feat: implement move ordering	eug-vs	2023-01-25	-0/+20
\|
*	refactor: return recoverable errors from make_move	eug-vs	2023-01-25	-3/+6
\|
*	feat: check PV move first but not discard others	eug-vs	2023-01-25	-10/+11
\|
*	feat: only include PV nodes in transposition table	eug-vs	2023-01-25	-16/+0
\|
*	refactor: impl static_eval for PieceType	eug-vs	2023-01-25	-11/+2
\|
*	feat: use transposition table in negamax	eug-vs	2023-01-25	-7/+45
\|
*	feat: incrementally update zobrist hash	eug-vs	2023-01-25	-5/+8
\|
*	feat: account for mobility in evaluation	eug-vs	2023-01-25	-4/+21
\|
*	feat: implement quiscence	eug-vs	2023-01-25	-0/+36
\|
*	feat: gather principal variation in negamax	eug-vs	2023-01-24	-10/+15
\|
*	refactor: cleanup material advantage calculation	eug-vs	2023-01-24	-11/+31
\|
*	refactor: abstract perft result into a structure	eug-vs	2023-01-24	-31/+38
\|
*	refactor: separate engine into submodule	eug-vs	2023-01-24	-0/+152