GitHub – datavorous/sameshi: a ~1200 Elo chess engine that fits within 2KB Skip to content You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert datavorous / sameshi Public Notifications You must be signed in to change notification settings Fork 0 Star 63 a ~1200 Elo chess engine that fits within 2KB 63 stars 0 forks Branches Tags Activity Star Notifications You must be signed in to change notification settings datavorous/sameshi master Branches Tags Go to file Code Open more actions menu Folders and files Name Name Last commit message Last commit date Latest commit History 14 Commits 14 Commits .gitignore .gitignore Makefile Makefile README.md README.md main.c main.c sameshi.h sameshi.h View all files Repository files navigation sameshi Watch Demo Video A minimal chess engine supporting a constrained subset of the game. sameshi.h : 1.95 KB core 120 cell mailbox board negamax search alpha beta pruning material only eval capture first move ordering full legal move validation (check / mate / stalemate) Note not implemented: castling, en passant, promotion, repetition, 50-move rule. strength ~1170 Elo (95% CI: 1110-1225) 240 games vs stockfish (1320-1600 levels) fixed depth 5, constrained rules, max 60 plies. About a ~1200 Elo chess engine that fits within 2KB Topics chess-engine chess demoscene Resources Readme Uh oh! There was an error while loading. Please reload this page . Activity Stars 63 stars Watchers 0 watching Forks 0 forks Report repository Languages C 93.5% Makefile 6.5% You can’t perform that action at this time.

Source: Hacker News | Original Link