Open GoogleCodeExporter opened 9 years ago
How would we implement piece finding functionality for cases where there are no
fixed
centers to each block? What about the case where there are multiple pieces
that are
indistinguishable? Whatever the final implementation is, I think that it
should show
you all the possible pieces you are looking for, otherwise it might make parity
cases
easy to avoid if it found the exact piece you are looking for.
Original comment by project....@gmail.com
on 1 Nov 2009 at 3:26
I was actually working on a patch that did this. I'm still getting up to speed
with
the code and I'm sure my patch wouldn't be as good as what you two come up
with. I
haven't used MagicCell120 so I don't know how the feature works there but I was
thinking of highlighting cubes not by color but by type of piece. The idea is
that
if you hold shift while hovering over a piece, all pieces of that type will be
highlighted. For solving large hypercubes this would cut down on the long time
spent
solving the 1c center pieces.
This would be an alternate solution to the ones I suggested for issue 92.
Original comment by bmenr...@gmail.com
on 21 Nov 2009 at 10:50
These are related but different problems. Differentiating piece types is helpful
because it can help reduce the visual complexity, whereas a piece-finder let's
you
quickly see your immediate goal. I recommend that in order to increase the
chances of
incorporating your patch, that you familiarize yourself with the Magic120Cell
behavior of both of these features before getting very far into alternative
solutions. Thanks!
Original comment by cutelyaw...@gmail.com
on 21 Nov 2009 at 11:18
Original comment by cutelyaw...@gmail.com
on 29 Nov 2009 at 9:17
Original issue reported on code.google.com by
roi...@gmail.com
on 19 Oct 2009 at 12:27