Greedy Chess Applet


A greedy algorithm is an algorithm that at every step makes a move the seems "best" at that very instant. In this applet the "best" move is determined by: Roughly in that order.
Notice that the algorithm is not away of checkmate, only that checking the opponent is good and getting out of check is good.
Most beginners can beat this algorithm.

View Source
Back to Programs