TODO: Describe how a bitboard data structure is used to store piece locations and generate moves.
Home » Bitboards
About the Blogger : Erik Madsen
I work as a Software Architect at an insurance company. We're building a modern tech stack in the cloud using C#, Azure, ASP.NET Core, Angular, TypeScript, etc.
I've always been interested in chess (a game of complete information) and poker (a game of incomplete information). This is my attempt to write chess-playing software. I'll get to poker later.
You may be interested to explore my general programming blog, ErikTheCoder.
Categories
Tags
7th Rank Active Rook Beta Test Bishop Pair Blockade Blunder Botez Sisters Bug Bullet Castling Cheating Chess Streamer Color-Specific Development Draw Endgame Eval Param Tuning Graham Banks GUI Handicap Hans Niemann History Heuristic Key Square Late Move Pruning Move Generation Nerves of Steel Opposition Passed Pawn Pawn Break Pawn Promotion Perft Piece Mobility Piece Placement Refactor Search Reduction Singular Move Static Exchange Evaluation Tactical Technique Tilt Time Management Version 3.2 Villain Winning Won Game World ChampionshipLinks
TalkChess Programming Forum TalkChess My Posts CPW Programming Wiki CCRL Engine Ratings Dana Mackenzie US National Master The Chess Mind FM D. Monokroussos The Chess Improver GM Nigel Davies Quality Chess GM Jacob Aagaard Tim Krabbé Chess Curiosities Rebel Chess Retro Chess Software Chess.com Play Live Chess Chess.com My Profile Recent Comments
Admin