Message #1248

From: Brandon Enright <bmenrigh@ucsd.edu>
Subject: Re: [MC4D] Parity in 12 Colors
Date: Thu, 04 Nov 2010 21:12:16 +0000

—–BEGIN PGP SIGNED MESSAGE—–
Hash: SHA1

On Thu, 04 Nov 2010 14:01:30 -0700
Melinda Green <melinda@superliminal.com> wrote:

[…]
> I’d really
> like to take that to it’s ultimate extreme and prune out any move
> sequences that loop back to any previous state, regardless of the
> number of moves involved. With the exception of returning to the
> solved state of course. :-)

This would be great and easy to do at the expense of a bit of memory.
Puzzle state is small though so storing 10,000+ puzzle states is no big
deal for modern computers. We could stuff the states into a tree for
faster searching.

I think it is important though that the state is truly identical
rather than just apparently identical. That is – shuffling around
some identical 1c pieces should count as a different state.

Brandon

—–BEGIN PGP SIGNATURE—–
Version: GnuPG v2.0.16 (GNU/Linux)

iEYEARECAAYFAkzTIbwACgkQqaGPzAsl94JSBQCeJEzPB/XJ70GEDqCKluBz0gcn
7UIAoINYJzqqkjKKrN601rG9B0pjKou2
=cnPj
—–END PGP SIGNATURE—–