https://bugs.kde.org/show_bug.cgi?id=407969
--- Comment #1 from Stephan Kulow <co...@kde.org> --- well, the request is not unreasonable - but basically way too expensive. There are enough games where we can't even say if the game is winnable or not because there are too many variants to check. If the solver ran in the background and discovered a winning variant, it could easily pick this - but in general this is not possible. -- You are receiving this mail because: You are watching all bug changes.