GitHub - cosminstefanxp/XBoard-Chess-Engine: Created as a university project in a team of four, it contains a chess engine that is able to play. Some of the key features include bitboard boards, move optimization, use of NegaMax, Iterative Deepening, Alpha-Beta Prunning, NegaScout, Quesence Search. Uses Xboard as a GUI.

cosminstefanxp / XBoard-Chess-Engine Public

Created as a university project in a team of four, it contains a chess engine that is able to play. Some of the key features include bitboard boards, move optimization, use of NegaMax, Iterative Deepening, Alpha-Beta Prunning, NegaScout, Quesence Search. Uses Xboard as a GUI.

1 star 0 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 3 Commits
Book.cpp		Book.cpp
Book.h		Book.h
ChessBoard.cpp		ChessBoard.cpp
ChessBoard.h		ChessBoard.h
Evaluation.h		Evaluation.h
Game.cpp		Game.cpp
Game.h		Game.h
Makefile		Makefile
Mind.cpp		Mind.cpp
Mind.h		Mind.h
MoveTree.cpp		MoveTree.cpp
MoveTree.h		MoveTree.h
README		README
Tools.cpp		Tools.cpp
Tools.h		Tools.h
Xboard.cpp		Xboard.cpp
Xboard.h		Xboard.h
main.cpp		main.cpp
mainbook.bin		mainbook.bin
random1.bin		random1.bin
random2.bin		random2.bin
stuff.h		stuff.h
tourbook.bin		tourbook.bin
xboard.debug		xboard.debug

Repository files navigation

Flip4IT Engine

Project details:
	- developed in a team of 4 people for a university project
		-Stefan-Dobrin Cosmin
		-Nita Catalina
		-Rizea Daniel-Octavian
		-Voiculescu Rafaela
	- developed in C/C++
	- uses XBoard for graphical interface
	
Algorithm & implementation details:
	- the engine has a lot of optimizations, for example: bitboards for efficient storage of board details
	- uses NegaMax algorithm
	- Iterative Deepening
	- uses Alpha-Beta Prunning
	- uses Quesence Search
	- has NegaScout implemented, but not used due to some small bugs that still had to be solved
	- has an advanced evaluation function
	- uses a moves book for the starting moves