https://bugs.kde.org/show_bug.cgi?id=265857 --- Comment #5 from Stephan Kulow 2011-02-11 09:36:06 --- the bug is pretty obvious. Check SpiderSolver::get_possible_moves and see the for ( int l = 0; l < 13; ++l ) { if ( RANK( W[w][Wlen[w]-l-1] ) != l+1 || SUIT( W[w][Wlen[w]-l-1] ) != ace_suit ) loop. There is no check if the card is face up. -- Configure bugmail: https://bugs.kde.org/userprefs.cgi?tab=email ------- You are receiving this mail because: ------- You are watching all bug changes.