3 ms·
I tried playing against it, I didn't have many expectations, but even though I blundered a bishop on move 3 due to a mouse-slip, I could still checkmate it in 6
by XCSme 10mo ago
I tried playing against it, I didn't have many expectations, but even though I blundered a bishop on move 3 due to a mouse-slip, I could still checkmate it in 6 moves. To me it seemed like it makes random moves.
- dmurray 10mo agoI thought it played worse than random moves and couldn't understand how it could beat anyone (no offence to OP). But if you intentionally hang your pieces, it tends to take them. And it will try to promote pawns in the endgame. So it is possible for it to stumble upon a checkmate, though in my effort where I gave away all my pieces, it instead found the only move to stalemate once it had K+Q+R vs K.
- dullcrisp 10mo agoIt tries to promote pawns in the opening and mid-game too.
- deleted 10mo ago[deleted]
- _ache_ 10mo agoThe algorithm behind it is very basic. Chose the most aggressive move (in term of pieces value and check-mate), if none is aggressive, it takes on of the move equally non aggressive. Didn't remember the depth of the algorithm but it was very simple C code, could check quickly. It should be able to find a mate in 2 or 3 if it was in position of having one. I didn't check the correctness of the algorithm, just the intention.