Reviews for CUBIQ

[rwind]

Overall good

First I will say this is a a good game and that i liked it. However i do have some suggestions for improvement (some of which other reviewers have already mentioned).
Colour the dark blues although usable probably where not the best choice for both the cube AND the background.
Controls most of the time thay where ok but when it came to rotating the cube the buttons proved to be very cumbersome, if possible try for a click and drag the background to rotate the cube.
As a whole this is a very good puzzle game.

[killerjoey9]

good game

did the 1st 8 lvl without a prob but lvl 9 is hard. i dont even wanna see 10

[BATTLE-ENGINE]

BUG

once i have completed lvl 9.. nothing seem to happen...the cube just stand there complete with no "next lvl" idk if its the last one ... but its took me 10min to do it...so it was kinda lame to just have to close the game like that...fix that if possible...beside that. great puzzle game... i like the style.. gj

p.s. ive checked atleast 10 time making sure i just didint miss a spot.

[vulpinepilot]

I love it, but.....

this is a very neat design for 3D puzzle solvers to enjoy. I loved it, however, once I got to level 9, it became buggy. I have solved the puzzle twice, but apparently it wasn't the solution it needed. so it is possible to connect all the lines without moving to level 10, which is annoying, because it is solved. it was hard though. my congratulations for making a fun game, however, you should test it enough to realize that if there are multiple solutions, they should all finish the level.

[CC15]

Good and a possable fix

First I would like to say that it is a fun puzzle concept. The problem though lies in your connectedness algorithm, which in level 9 is unable to detect solutions.

There are ways to make a checker independent of the full map matching an answer key. An example would be to count each path segment as a separate path (the L tile fore example is made up of 2). If you keep a reference as to how many path segments there are and for each segment a color, R (used) or B(unused). You could have the checker start a pointer at a random path and all pats set to B. Now every time a pointer goes over a segment, it switches its color to R and adds one to a check counter. Every time it encounters a fork, it starts a new pointer and pointers end when they encounter a R path. If the counter's value is equal to the total number of paths, then it is a solution to the cube. This should be a viable solution and if it is not, a slight modification to it should fix it. Good luck