Summary: | expert level can be as simple as novice | ||
---|---|---|---|
Product: | [Applications] knetwalk | Reporter: | Lars Christian Jensen <larschri> |
Component: | general | Assignee: | Ashwin Rajeev <ashwin_rajeev> |
Status: | RESOLVED FIXED | ||
Severity: | wishlist | CC: | ashwin_rajeev, cfeck |
Priority: | NOR | ||
Version: | 1.0 | ||
Target Milestone: | --- | ||
Platform: | Ubuntu | ||
OS: | Linux | ||
Latest Commit: | http://commits.kde.org/knetwalk/1c4bded68fe583e5be0b61b6ebd81e3443d0f166 | Version Fixed In: | 4.10.3 |
Description
Lars Christian Jensen
2008-04-06 14:22:24 UTC
The number of shuffles does not really influence the complexity of a level. What is more important is the initial generation. Solutions with many parallel pipes are much simpler to find than those with many T type pipes. In other words, I do not think the commit makes sure the complexity increases with each level. |