datuser / chess Goto Github PK

For this task, the assignee(s) has(ve) to implement the generate_queen_moves function of rule class that will generate the moves for every queen.

Please, let everyone know about your progress.

For this task, the assignee(s) has(ve) to create his own listener, he must create a class that implements the Listenerinterface.

Please, let everyone know about your progress.

For this task, the assignee(s) has(ve) to implement the generate_king_moves function of rule class that will generate the moves for the king.

Please, let everyone know about your progress.

For this task, the assignee(s) has(ve) to implement the generate_rook_moves function of rule class that will generate the moves for every rook.

Please, let everyone know about your progress.

For this task, the assignee(s) has(ve) to call the pgn parser in the main function when needed and to create a Chessboard using it.

Please, let everyone know about your progress.

As the register_board() should be called only once at the beginning of the game (according to the related .hh), it should be moved into the main().

Should be done when we will have an IA (or something that is close to)

For this task, the assignee(s) has(ve) to add the sources and the optimization flags to the CMakeLists.txt.

Please, let everyone know about your progress.

For this task, the assignee(s) has(ve) to implement the option parser, that will interpret the options used while running the program.

Please, let everyone know about your progress.

For this task, the assignee(s) has(ve) to implement the generate_pawn_moves function of rule class that will generate the moves for every pawn.

Please, let everyone know about your progress.

For this task, the assignee(s) has(ve) to change the implementation of move generation and use shifts and masks instead of loops to generates the moves.

Please, let everyone know about your progress.

Not sure, of what optimization we should add. According to this website(https://www.rapidtables.com/code/linux/gcc/gcc-o.html), optimization do not seem really interesting since they only make faster the compilation. However, for our project we should focus on the speed during execution and the memory usage.

For this task, the assignee(s) has(ve) to implement convert bitboard values to coordinates.

Please, let everyone know about your progress.

For this task, the assignee(s) has(ve) to create Move class.

Please, let everyone know about your progress.

For this task, the assignee(s) has(ve) to implement the board representation as a bitboard. As it is a tricky part of the projet the assignee also have in charge to make it easier to debug.

Please, let everyone know about your progress.

For this task, the assignee(s) has(ve) to implement the perft_parser following the structure given in the uml.png file.

Please, let everyone know about your progress.

For this task, the assignee(s) has(ve) to implement the boards class containing the different boards.
I think that it will be revelant to add 2 "global" bitboard per color, one containing occupied cases and one containing "danger" cases

Please, let everyone know about your progress.

Last method to be implemented in the chessboard.cc

For this task, the assignee(s) has(ve) to implement the main function that will use the option parser to call the right functions give the expected output.

Please, let everyone know about your progress.

For this task, the assignee(s) has(ve) to implement the generate_knight_moves function of rule class that will generate the moves for every knight.

Please, let everyone know about your progress.

The assignee will have to optimize the two_pow(int power) function to decrease its complexity.

This function is contained in src/utils/utils.cc

With the bitboard we will only be dealing with power of two so we don't have to generalise this function for every power possible

For this task, the assignee(s) has(ve) to change the implementation of move generation, indeed we forgot to check if a move put the team in check and it is a forbidden move in chess. So, add this check to each move generation and you're officially a bro.

Please, let everyone know about your progress.

For this task, the assignee(s) has(ve) to implement the generate_legal_moves function of chessboard class that will generate the moves for every token. And also make a function that checks if a move is correct is_legal_move.

Please, let everyone know about your progress.

For this task, the assignee(s) has(ve) to implement find the algorithm, he wants us to use (please try not to choose a shitty one) and implement it.

Please, let everyone know about your progress.

N.B.: Yakas recommend to use Minimax.

For this task, the assignee(s) has(ve) to implement the generate_bishop_moves function of rule class that will generate the moves for every bishop.

Please, let everyone know about your progress.