Meanie is my newest chess engine, I have worked on it for a few months and it should be stronger than Amarillo 4.2 :D It should have around 1900 Glicko on an average System https://turbowarp.org/1320377657?turbo#? Here is a list of engine features: Search: -Minimax with AB -Late Move reductions and Late move pruning -Futility pruning and predicted sibling pruning -Nullmove pruning -Delta pruning -check extensions -passed pawn extensions -Transposition Table -Iterative deepening -Quiescence search which doesn't use standpat on unstable positions -Correction History for pawnstructure and minor pieces -History Move Pruning -Principal Variation Search but suggested by @internet44 Evaluation Function(HCE): -Material -Piece Square Tables -King Distance to center -Virtual Mobility -Doubled Pawns and Passed Pawns -Rook on open file bonus -Blocked center-pawn penalty -Mop-Up for mates -Pawns attacking center bonus -Pawn chain bonus -Lazy Eval
Credits to @internet44 for the testing and emotional support Also credits to the chess programming wiki https://www.chessprogramming.org/Main_Page, which gave me lots of Ideas for Meanie. original quicksort implementation is here: https://scratch.mit.edu/projects/41440388/
