Path: utzoo!attcan!uunet!samsung!uakari.primate.wisc.edu!sdd.hp.com!news.cs.indiana.edu!cs.widener.edu!netnews.upenn.edu!vax1.cc.lehigh.edu!lehi3b15!kdunn
From: kdunn@lehi3b15.csee.Lehigh.EDU (Kevin Dunn)
Newsgroups: comp.lang.pascal
Subject: Penny - Dime Problem
Message-ID: <1298@lehi3b15.csee.Lehigh.EDU>
Date: 12 Dec 90 03:10:41 GMT
Reply-To: kdunn@lehi3b15.csee.Lehigh.EDU (Kevin Dunn)
Organization: CSEE Dept. Lehigh University, Bethlehem, PA
Lines: 13


  I was wondering if any of you netlanders had any info on the following
problem:
   The problem is called the penny-dime problem.  You start with a ring with
13 spaces on it, and 6 pennies and 6 dimes.  The arrangement is
    PDPDPD<space>PDPDPD.  The object is to get PPPPPP<space>DDDDDD.
  Only 4 moves are allowed:  A left shift into the space, a right shift into 

the space, or a left or write jump over 1 into the space.
    If anyone has any leads for an alogrithm for solving this, please let me 
know.  Thanks in advance...
                    
                  Kdunn@lehi3b15.Csee.lehigh.edu