maybe for very low ratings it's plausible? 1 elo per byte might happen in a tiny range but at a useful strength it would break fast, that's what i think

▲

iterance 7 hours ago | parent [-]

What's the snallest possible program that accepts a chess board state and prints any legal move? True randomness may only have a couple hundred ELO, but then, that's pretty big for golf

▲

dmurray 3 hours ago | parent [-]

The program that resigns every time unfortunately does a lot worse than random. But it depends on the population it's pitted against - it should at least pick up a few points against copies of itself.

	▲	contravariant 22 minutes ago \| parent [-]
		Don't resign, just offer a remise after moving a pawn. Only resign if no pawns are left. I'd claim it would work on human opponents, but I think it would get banned from chess tournaments.