Version: 1.0 (using KDE 3.5.7, Debian Package 4:3.5.7.dfsg.1-7 (lenny/sid)) Compiler: Target: i486-linux-gnu OS: Linux (i686) release 2.6.21-2-686 In two scenarios, I can solve the puzzle using less tubes than given, although the game won't register the puzzle as solved. I have two snapshots of this. (I don't see a field to attach them.)
Created attachment 21731 [details] First case the bug showed up
Created attachment 21732 [details] second time this happened
A game is won only if all Terminals _and_ all cables are connected to the server. But it would be better if such scenarios weren't generated.
Created attachment 22875 [details] Also happens for simple puzzles I have also found such a puzzle on the easy level.
Happened to me too on version 2 on the medium difficulty. The game should be considered solved if all the computers are hooked up, not if all the pipes are in the correct orientation.
Created attachment 23600 [details] broken level
SVN commit 783843 by fela: Do not generate games that allow you to connect all terminals to the server without using all cables. BUG:150386 M +45 -49 abstractgrid.cpp M +9 -8 abstractgrid.h WebSVN link: http://websvn.kde.org/?view=rev&revision=783843
oops... I was wrong, it was harder than I tought to identify all such games. Bug reopened
SVN commit 792546 by fela: If all terminals are connected but not all cables, show a message box explaining to the user that to win the game all cables need to be connected too. BUG:150386 M +8 -3 abstractgrid.cpp M +3 -1 abstractgrid.h M +0 -21 cell.cpp M +0 -3 cell.h M +19 -6 mainwindow.cpp M +2 -0 mainwindow.h M +2 -2 view.h WebSVN link: http://websvn.kde.org/?view=rev&revision=792546