Worked on a very basic scratch wrapper, it can generate a recursive function, gonna add more scratch blocks so that actual logic can be generated in this wrapper
Added static type checking, which makes sure the correct types are used everywhere.
It prevents the user from using a number in an if statement’s condition.
It also prevents you from assigning a string to an integer field
I added the AST parsing, which is able to parse the ANTLR parse tree into an AST (sorry the image is bad, its all I can show)
Worked on the first stage of AST parsing: Only parse top level elements (imports, structs, variables) and don’t parse the insides of functions
Long time no see
I added a transposition table and zobrist hashing, which makes the engine way faster
Added evaluation tables. Refactored board and move logic. Fixed a ton of bugs. Made the evaluation better. I have to fix performance next
Implemented a very basic engine using negamax with alpha beta pruning, it loses to stockfish in 29 moves
I made a function to load positions from FEN notation, i improved my tests using some engine test positions and fixed a bug where if you captured a piece and promoted your pawn at the same time you would be forced to a queen
Did legal move finding(thanks to Sebastian Lague’s video), it calculates the number of possible positions correctly to depth 6. Video is a bot playing random moves
I created a basic board and made moving, right now there is no checks for legal moves
