The writer played multiple games of chess against some conventional chess programs or AIs, and used a simple algorithm to determine their own moves:

For each move, the writer:

1. Generated a list of all possible moves in the current position, and the moves were recorded in standard algebraic chess notation
2. Sorted the list of possible moves in alphabetic order
3. Used the move that was in the center of the sort order, but I have no idea what they did if the number of possible moves was even

This algorithm for choosing chess moves did not result in optimal play, and lost badly against the standard chess programs/AIs.

The illustrated position shows the algorithm generating a blunder or useless move for White (Ne2) that allows a checkmate victory for Black with their next move (… b4#), i.e. “Black Bishop moves to b4, checkmate.”

Black’s winning move is not shown, likely as a brainteaser for the readers.

The writer named their algorithm “AlphaMove” as a take on Google’s famous chess playing AI from 2017 named “AlphaZero”.

Except in the writer’s case, the “Alpha” in their algorithm’s name is short for “alphabetic”, which makes the expanded name “Alphabetic(-sort)Move”.