i spent a weekend teaching a chess engine to be as stupid as possible. a normal engine runs minimax: it maximizes a score for itself and minimizes it for the opponent. so i kept the entire search and negated the one function that scores the board, return -evaluate(board) . that’s the whole change. it still tries as hard as it ever did, it just tries to lose now. i called it artificial unintelligence. mini(wins), max(losses). to make the games watchable instead of a sad 1-0 log, i handed the losing side a big material lead arranged into a shape: a cross of pawns, eight bishops as a constellation, a skull made of rooks and queens. then a normal engine has to claw back from the deficit and take the picture apart. eight games, every one ends in checkmate. one of them promotes four white queens. submitted by /u/iGotYourPistola
Originally posted by u/iGotYourPistola on r/ArtificialInteligence