chess with only part of the pieces

Uri Blass · Post by **Uri Blass** » Tue Oct 21, 2025 5:26 pm

There are basically 2^30 possible positions when part of the pieces are missing(for everyone of the pieces we can choose between missing and not missing and we can assume white to move in everyone of them).

I wonder how many of them are interesting for computer chess and how many of them are obvious win for white or obvious win for black or obvious draw.

It is possible to generate 10000 random positions out of these 2^30 positions and analyze them to get an estimate.