Unfortunately traditional chess algorithms like Negamax fail to take advantage of proof theoretic results that show provably superior play can be had with theorem proving over more sophisticated logics. I wrote a prolog program to encode positional chess knowledge into the search, a small step in the right direction of a knowledge based Chess (and Go) playing program. /var/lib/myfrdcsa/codebases/internal/ender/data/chess/chess.pro