Puzzling puzzle problem

Hey all
So I have a puzzle that doesn't want to work properly. I have it setup so when all six pieces are dragged onto their respective spots, the movie goes to frame 2, but when I drag all the pieces properly and the scores add up to 6, the action of going to frame 2 doesn't occur, but if I pull a piece off, and the score equals 5 the action occurs!?!?!?!?!?!
There are 6 pieces named tl, tm, tr, bl, bm, br and those get dragged onto their 6 respective mcs (drag_tl etc.).
I have no idea why this is happening. Any help would be appreciated.
Thanks
Here's the link: superbean_puzzle
...one more thing, is there a way to make the link disply at 100% instead of full screen?
Thanks some more
stop();
// Cursor //
onMouseMove = function () {
     updateAfterEvent();
onEnterFrame = function() {
     counter.text = ((scoretl + scoretm + scoretr + scorebl + scorebm + scorebr) + "/6");
     if (scoretl + scoretm + scoretr + scorebl + scorebm + scorebr == 6) {
          gotoAndPlay(2);
     Mouse.hide();
     curs._x = _xmouse;
     curs._y = _ymouse;
onMouseDown = function() {
     curs.gotoAndStop(2);
onMouseUp = function() {
     curs.gotoAndStop(1);
pieceArr = Array()
pieceArr[0] = "tl";
pieceArr[1] = "tm";
pieceArr[2] = "tr";
pieceArr[3] = "bl";
pieceArr[4] = "bm";
pieceArr[5] = "br";
dragArr = Array()
dragArr[0] = "drag_tl";
dragArr[1] = "drag_tm";
dragArr[2] = "drag_tr";
dragArr[3] = "drag_bl";
dragArr[4] = "drag_bm";
dragArr[5] = "drag_br";
var scoretl = 0;
var scoretm = 0;
var scoretr = 0;
var scorebl = 0;
var scorebm = 0;
var scorebr = 0;
for(i=0; i<pieceArr.length; i++)
(_root[pieceArr[i]]).onPress = function() {
     startDrag(this);
for(i=0; i<pieceArr.length; i++)
(_root[pieceArr[i]]).onRelease = function() {
     stopDrag();
     checkTarget(this);
function checkTarget(drag) {
     if(tl.hitTest(drag_tl)) {
          setProperty(tl,_x, 256);
          setProperty(tl,_y, 186);
               if (scoretl == 0) {
                    scoretl = 1;
     } else {scoretl = 0}
          //trace("1 " + scoretl);
     if(tm.hitTest(drag_tm)) {
          setProperty(tm,_x, 353);
          setProperty(tm,_y, 203);
               if (scoretm == 0) {
                    scoretm = 1;
     } else {scoretm = 0}
          //trace(scoretm);
     if(tr.hitTest(drag_tr)) {
          setProperty(tr,_x, 463);
          setProperty(tr,_y, 203);
               if (scoretr == 0) {
                    scoretr = 1;
     } else {scoretr = 0}
          //trace(scoretr);
     if(bl.hitTest(drag_bl)) {
          setProperty(bl,_x, 257);
          setProperty(bl,_y, 280.5);
               if (scorebl == 0) {
                    scorebl = 1;
     } else {scorebl = 0}
          //trace(scorebl);
     if(bm.hitTest(drag_bm)) {
          setProperty(bm,_x, 370);
          setProperty(bm,_y, 298);
               if (scorebm == 0) {
                    scorebm = 1;
     } else {scorebm = 0}
          //trace(scorebm);
     if(br.hitTest(drag_br)) {
          setProperty(br,_x, 479.5);
          setProperty(br,_y, 297.5);
               if (scorebr == 0) {
                    scorebr = 1;
     } else {scorebr = 0}
          //trace(scorebr);

kglad: Thanks! I didn't realise I had to get rid of the "_root" when taking "" off mc indices.
dalcde: Thanks! The _root.nextFrame got it!! I don't know why though..... It kinda bugs me
Thanks again guys!

Similar Messages

  • N-puzzle problem

    Hello,
    I need the code for the n-puzzle problem using the branch and bound algorithm. I have found any other implementations (A*, deepth, etc.etc.) but I can�t found the branch and bound solution.
    Any help will be really important for me.
    Thank you in advance.

    Thank you very much but in this link I can�t see the code of the solution for the n-puzzle (using branch and bound algorithm)
    Actually I�m not a student, hehe, sorry about the confussion.
    Any other help please?

  • 8 Puzzle Problem

    Hi!
    I want to slove 8 puzzle problem using java code.
    Can anybody tell me how to solve this or either give me the link or source code where i will get idea about this.
    Thanks

    Over the years I have found that ESP (Extra Sensory
    Programming) skills are very useful when dealing with
    users or business analysts who expect you to be able
    to program exactly what they want without them needing
    to actually tell you anything.I find they get madder ( eh? ) when you tell them that no, you cannot read their mind and program the computer just to do exactly what they want. Also funny how they think a task is somehow simplified if "it only occurs sometimes" ... damn them.

  • The shuttle puzzle problem..

    Hi guys;
    for those raedy to rise challenges i present this problem... Any ideas to solve it are welcomed..some code would be a generous action from your part...
    SHUTTLE PUZZLE
    The SHUTTLE PUZZLE of size 3
    consists of 3 white marbles, 3 black
    marbles, and a strip of wood with 7 holes.
    The marbles of the same color are placed
    in the holes at the opposite ends of the
    strip, leaving the center hole empty.
    INITIAL STATE: WWW BBB
    GOAL STATE: BBB WWW
    To solve the shuttle puzzle use only two
    types of moves. Move 1 marble 1 space
    (into the empty hole) or jump 1 marble
    over 1 marble of the opposite color (into
    the empty hole). You may not back up,
    and you may not jump over 2 marbles.
    A Shuttle Puzzle of size N consists of N
    white marbles and N black marbles and
    2N+1 holes.
    Write a program that will solve the
    SHUTTLE PUZZLE for any size N(*10)
    and display the board after each move.
    Use W to represent a white marble and B
    to represent a black marble and a blank to
    represent the empty hole. Test your
    program for N=3 and N=4.
    Sample Run
    N = 3
    WWW BBB
    WWWB BB
    WW BWBB
    W WBWBB
    WBW WBB
    WBWBW B
    WBWBWB
    WBWB BW
    WB BWBW
    BWBWBW
    B WBWBW
    BBW WBW
    BBWBW W
    BBWB WW
    BB BWWW
    BBB WWW

    my friend , here is my own program for the Shutle problem...
    try it and tell me if something is wrong...
    cheers.
    * Created on 23 f�vr. 2004
    * To change the template for this generated file go to
    * Window>Preferences>Java>Code Generation>Code and Comments
    * @author user
    * To change the template for this generated type comment go to
    * Window>Preferences>Java>Code Generation>Code and Comments
    import java.io.*;
    import java.util.*;
    public class Shuttle {
         static int N=3;
         static int ln= 2*N+1;
         static int p=(int) Math.pow(2,N+1);
         static String[] a= new String[ln];
         static boolean shifted= false;
    public static void init()throws IOException {
         /*System.out.println("Enter N:");
         String ss= getString();
         N =(int)Integer.parseInt(ss);*/
         System.out.println("Solved shuttle:");
         ln= 2*N+1;
         p=(int) Math.pow(2,N+1);
         a= new String[ln];
         for(int i=0; i<N;i++)
         a="W";
         a[N]=" ";
         for(int i=N+1; i<a.length;i++)
         a[i]="B";
    public static String getString() throws IOException
         InputStreamReader isr = new InputStreamReader(System.in);
         BufferedReader br = new BufferedReader(isr);
         String s = br.readLine();
         return s;
    public static char getChar() throws IOException{
         String s= getString();
         return s.charAt(0);
    public static void print(String[] a){
         for(int i=0;i<a.length;i++)
              System.out.print(a[i]);
              System.out.println();
    public static int getHole(String[] a){
         int index=-1;
         for(int i=0;i<a.length;i++){
              if(a[i].equals(" ")){
                   index=i;break;
         return index;
    public static void swap(String[] a,int i,int j){
         String X=new String();
         X=a[i];
         a[i]=a[j];
         a[j]=X;
    public static boolean Done(String[]a){
         boolean done=true;
         for(int i=0;i< N; i++){
              if(!a[i].equals("B")){done=false;break;}
         if(!a[N].equals(" ")){done=false;
         for(int i=N+1; i< a.length;i++){
              if(!a[i].equals("W")){ done=false; break;
         return done;
    public static void shuttle(){
         int index=-1;
         //for(int k=0;k<p;k++){
         do{
              print(a);
              index=getHole(a);
              if(index==0){
                   if(a[index+1].equals("B"))swap(a,index,index+1);
                   else if(a[index+1].equals("W")&& a[index+2].equals("B")) swap(a,index,index+2);
                   //else if(a[index+1].equals("W")&& a[index+2].equals("B")) swap(a,index,index+2);
              else if(index==a.length-1){
                   if(a[index-1].equals("B")&&a[index-2].equals("W") )swap(a,index,index-2);
                   else if(a[index-1].equals("W"))swap(a,index,index-1);
              else if(a[index-1].equals("W")&&a[index+1].equals("B") ){
                   if (shifted==false){     swap(a,index,index+1); shifted=true; }
                   else if(shifted==true){ swap(a,index,index-1); shifted=false;
                   else if(a[index-1].equals("B")&&a[index+1].equals("W")){
                        if(((index+2)<=a.length-1)&& a[index+2].equals("B")) swap(a,index+2,index);
                        else if((index-2>=0)&& a[index-2].equals("W") ) swap(a,index-2,index);
              else if(a[index-1].equals("B")&& a[index+1].equals("B") ){
                   if ((index-2>=0)&& a[index-2].equals("W") )swap(a,index-2,index);
                   else if (((index+2)<=a.length-1)&& a[index+2].equals("B") ) swap(a,index-2,index);
                        else swap(a,index,index+1);
                   else if(a[index-1].equals("W")&& a[index+1].equals("W") ){
                        if (((index +2)<=(a.length-1)) && a[index+2].equals("B")) swap(a,index+2,index);
                        else if ((index -2>=0)&& a[index-2].equals("W") ) swap(a,index-2,index);
                        else swap(a,index,index-1);
              }while(Done(a)==false);
              print(a);
         public static void main(String[] args)throws IOException {
              while (true){
                   System.out.println("Enter N:");
                   String ss= getString();
                   N =(int)Integer.parseInt(ss);
              init();
              shuttle();
              System.out.print("another trial(y/n)?: ");
              char c=getChar();
              if (c=='y')continue;
              else if(c=='n'){System.err.println("Bye!");break;}

  • Puzzle problem

    Hi there,
    I'm making a puzzle-type game that has the ability to solve itself. I want to put a small delay before each move so I placed a
    try{Thread.sleep(sleeptime);}
    catch(InterruptedException e) {}
    before the repaint call. The problem is that this is only delaying the re-paint not the other computations so that when it does repaint, after the specified delay, it could have made over a hundred moves instead of one. Any help would be hugely appreciated as this is the final piece of the program and I just want it finished.
    Thanks
    Mark

    May be, in this way:
    //in thread where you perform calculations
    //calculations finished
    try
        sleep(sleepTime);
    catch ....
    synchronized(yourGUIpanel)
              notify();
    //other thread
    while(true)
       synchronized(yourGUIpanel)
           try{
              wait();
              yourGUIpanel.repaint();
    }

  • The 15 puzzle problem !!!

    hey ,
    can nebody help me with the code of the autosolve solution of the 15 block puzzle...or atleast the algorithm that is to be used .....????
    The program requires the computer to solve the puzzle .....oe move at a time .....
    How will i go about it ??

    here is the basic code that will help an user play, i am still trying to automate it, if anyone is able to finish it please let me know import java.applet.Applet;
    import java.awt.Color;
    import java.awt.Event;
    import java.awt.Graphics;
    // <applet code=puzzle width=100 height=100></applet>
    public class Puzzle extends Applet {
         private static final long serialVersionUID = 1L;
         public Piece pieces[] = new Piece[16];
         int i, x, y, currentValue;
         int startX = 50;
         int startY = 50; // start pos of puzzle
         int rowSize = 4;
         int pieceWidth = 50;
         int pieceHeight = 50;
         private int blankPiecePosition;
         Graphics graphics;
         SimplePuzzle simple;
         RandomValue randomValue = new RandomValue(1, 16);
         public void init() {
              graphics = getGraphics();
              /* INITIALIZE THE BLANK PIECES */
              x = startX;
              y = startY;
              for (i = 0; i <= 15; i++) {
                   currentValue = randomValue.getRandomValue();
                   // currentValue = i+1;
                   /* SET THE INITIAL POSTION OF THE BLANK PIECE */
                   if (currentValue == 16) {
                        blankPiecePosition = i;
                   // pict = getImage(getDocumentBase(),image_name+currentValue+".gif");
                   pieces[i] = new Piece(i, currentValue, graphics, x, y, null, this);
                   x += 50;
                   if (x > 200) {
                        x = 50;
                        y += 50;
              /* CREATE A NEW SIMPLE PUZZLE */
              simple = new SimplePuzzle(15, this);
              resize(pieces[0].width * 6, pieces[0].height * 6);
         public void start() {}
         public void stop() {}
         public boolean mouseDown(Event evt, int x, int y) {
              int rel_x, rel_y;
              int click_piece;
              int cur;
              // FIRST CHECK IF THE POINT IS INSIDE THE PUZZLE
              if (isPointInside(x, y)) {
                   // NOW GET THE CLICK PIECE
                   rel_x = (int) (x - startX) / pieceWidth;
                   rel_y = (int) (y - startY) / pieceHeight;
                   click_piece = rel_x + rowSize * rel_y;
                   // IF THE CLICK POINT IS IN THE SAME ROW AS THE BLANK PIECE
                   if (pieces[blankPiecePosition].sameRow(y)) {
                        if (pieces[click_piece].toLeft(pieces[blankPiecePosition])) {
                             cur = pieces[blankPiecePosition].left;
                             while (cur != pieces[click_piece].left) {
                                  pieces[cur].exchangePiece(pieces[blankPiecePosition]);
                                  blankPiecePosition = cur;
                                  cur = pieces[blankPiecePosition].left;
                                  congratulate();
                        } else if (pieces[click_piece].toRight(pieces[blankPiecePosition])) {
                             cur = pieces[blankPiecePosition].right;
                             while (cur != pieces[click_piece].right) {
                                  pieces[cur].exchangePiece(pieces[blankPiecePosition]);
                                  blankPiecePosition = cur;
                                  cur = pieces[blankPiecePosition].right;
                                  congratulate();
                   } else if (pieces[blankPiecePosition].sameColumn(x)) {
                        if (pieces[click_piece].above(pieces[blankPiecePosition])) {
                             cur = pieces[blankPiecePosition].up;
                             while (cur != pieces[click_piece].up) {
                                  pieces[cur].exchangePiece(pieces[blankPiecePosition]);
                                  blankPiecePosition = cur;
                                  cur = pieces[blankPiecePosition].up;
                                  congratulate();
                        } else if (pieces[click_piece].below(pieces[blankPiecePosition])) {
                             cur = pieces[blankPiecePosition].down;
                             while (cur != pieces[click_piece].down) {
                                  pieces[cur].exchangePiece(pieces[blankPiecePosition]);
                                  blankPiecePosition = cur;
                                  cur = pieces[blankPiecePosition].down;
                                  congratulate();
              return true;
         private void congratulate() {
              if (simple.isPuzzleComplete()) {
                   graphics.drawString("Congratulations!!!", 75, 275);
         public void paint(Graphics g) {
              g.setColor(Color.pink);
              g.fillRect(0, 0, size().width, size().height);
              for (int i = 0; i <= (15); i++) {
                   pieces.draw();
         // THIS ROUTINE RETURNS THE VALUE OF A LOCATION
         public int getLocationValue(int arr_loc) {
              return pieces[arr_loc].value.intValue();
         // THIS ROUTINE RETURNS THE VALUE OF THE BLANK LOCATION
         int getBlankLocationValue() {
              return pieces[blankPiecePosition].value.intValue();
         public boolean isPointInside(int x, int y) {
              if ((x >= startX) && (y >= startY)
                        && (x <= startX + rowSize * pieceWidth)
                        && (y <= startY + rowSize * pieceWidth)) {
                   return true;
              } else {
                   return false;
    import java.awt.Color;
    import java.awt.Font;
    import java.awt.Graphics;
    import java.awt.Image;
    public class Piece {
         int width = 50, height = 50;
         int right, left, up, down;
         Integer value; // the value of the Piece
         Integer posX, posY; // the on screen position of the Piece
         Graphics graphics;
         Puzzle objPuzzle;
         public Piece(int index, int val, Graphics agc, int x, int y, Image pict,
                   Puzzle objPuzzle) {
              int temp;
              this.objPuzzle = objPuzzle;
              value = new Integer(val);
              graphics = agc;
              posX = new Integer(x);
              posY = new Integer(y);
              // RIGHT
              temp = index + 1;
              if ((temp == 4) || (temp == 8) || (temp == 12) || (temp == 16))
                   right = -1;
              else
                   right = temp;
              // LEFT
              temp = index - 1;
              if ((temp == 3) || (temp == 7) || (temp == 11))
                   left = -1;
              else
                   left = temp;
              // UP
              temp = index - 4;
              if ((temp < 0))
                   up = -1;
              else
                   up = temp;
              // DOWN
              temp = index + 4;
              if ((temp >= 16))
                   down = -1;
              else
                   down = temp;
         // RETURNS TRUE IF A POINT IS IN THE SAME COL AS y
         public boolean sameColumn(int x) {
              return ((x > posX.intValue()) && (x < posX.intValue() + height));
         // RETURNS TRUE IF A POINT IS IN THE SAME ROW AS x
         public boolean sameRow(int y) {
              return ((y > posY.intValue()) && (y < posY.intValue() + width));
         public boolean toLeft(Piece p) {
              return (posX.intValue() < p.posX.intValue());
         public boolean toRight(Piece p) {
              return (posX.intValue() > p.posX.intValue());
         public boolean above(Piece p) {
              return (posY.intValue() < p.posY.intValue());
         public boolean below(Piece p) {
              return (posY.intValue() > p.posY.intValue());
         public void exchangePiece(Piece blank) {
              Integer temp = value;
              value = blank.value;
              blank.value = temp;
              draw();
              blank.draw();
         public void draw() {
              if (value.intValue() == 16) {
                   graphics.setColor(Color.black);
                   graphics.fillRect(posX.intValue(), posY.intValue(), width, height);
                   graphics.drawRect(posX.intValue(), posY.intValue(), width, height);
              } else {
                   graphics.setColor(Color.yellow);
                   graphics.fillRect(posX.intValue(), posY.intValue(), width, height);
                   graphics.setColor(Color.black);
                   graphics.drawRect(posX.intValue(), posY.intValue(), width, height);
                   graphics.setFont(new Font("Times", Font.BOLD, 16));
                   graphics.drawString(value.toString(), posX.intValue()
                             + (width - graphics.getFontMetrics().stringWidth(
                                       value.toString())) / 2, posY.intValue() + height
                             / 2);
    public class SimplePuzzle{
         int win[] = new int[16];
         int winIndex, startIndex;
         Puzzle puzzle;
         SimplePuzzle(int startPosition, Puzzle puz) {
              for (int i = 0; i < 16 ; i++) {
                   win[i] = i + 1;
              winIndex = 15;
              startIndex = startPosition;
              puzzle = puz;
         public boolean isPuzzleComplete() {
              if (puzzle.getBlankLocationValue() != winIndex) {
                   return false;
              for (int i = 0; i < 16 ; i++) {
                   //System.out.println("Loc Value: "+puzzle.getLocationValue(i)+"\tWin: "+win[i]);
                   if (puzzle.getLocationValue(i) != win[i]) {
                        return false;
              return true;
    // THIS CLASS IS USED TO PROVIDE A UNIQUE RANDOM VALUE FROM
    // A RANGE OF VALUES
    class RandomValue {
         int value[];
         int total;
         RandomValue(int first, int last) {
              int i;
              total = last - first + 1;
              value = new int[total];
              for (i = 0; i < total; i++) {
                   value[i] = first;
                   first++;
         int getRandomValue() {
              int i;
              int ret;
              if (total == 0) {
                   return -1;
              if (total == 1) {
                   total = 0;
                   return value[0];
              i = (int) (Math.random() * total);
              ret = value[i];
              total--;
              for (; i < total; i++) {
                   value[i] = value[i + 1];
              return ret;

  • Puzzling problem

    I am using vs2008 and have created a crystal report (windows application).  The data shows up correctly on the report (detailed section) but when I creat a chart all of the values appear to be zero.  I created the chart in the report header, using a line type chart and for the data, using the chart expert I selected for each record, and also selected a single field for (Show Values).  The single field is a number type and is displayed correctly in the detailed section of the report.  It is a simple integer that ranges from 100 to 900.  In my c# program I create a DataTable and then write out an xml file and an xmlschema file.  I used the xml schema file to create the report.  When the report is generated I create a new datatable and read the xml file into a dataset.  I then create a data table from this dataset and use this  as the report data source, crystalReport.SetDataSource(DataTable).  Again all of the data shows up correctly in the report, just problems with the chart, always seems to display a line of zeros.
    Thanks Paul.

    I was not able to move the report into a page header or footer but am thinking when the xml data is read in it is treating all columns like a string.  I have 2 xml files that get created when the dataset is filled by using the datatable.writeXMLSchema and datatable.WriteXML.  The WriteXMLSchema was used to create the report and does specify integer types.  I think I will try to create a globabl type dataset that stays available during the windows session and just use the data set instead of saving and loading xml files during runtime.

  • Puzzling problem mounting some partitions from drive connected via airport

    I have an external drive with three partitions connected to my airport. Under Tiger, the mounting process for all those partitions was seamless and never failed. As soon as I upgraded to Leopard, however, everything fell apart. Now I can't mount two of the three partitions at all.
    When the external drive is connected directly to my MacBook Pro, each partition mounts routinely. When I connect it via my Airport Extreme, the finder window shows that I am connected; but when I attempt to access the partitions on the drive, I get this error message: 'The operation cannot be completed because the original item cannot be found.' I get the same error message for each of the first two partitions on the drive and can mount only the last partition.
    When I attempt to mount the partitions manually via the Go menu in the finder, I get essentially the same result: error messages for the first two partitions saying that they cannot be mounted and a normal mounting of the third partition.
    Any ideas or clues as to what is actually happening here would be most appreciated. It's very frustrating to have lost access to my backup drive purely by upgrading to Leopard and not find any obvious way to regain it.

    Thanks, but I have no problem accessing the drive. All I have to do is plug it directly into my laptop using either USD or Firewire. The problem is with accessing it via Airport so I can run my normal backup routine as I did under Tiger without first a lot of fiddling with cables. After all, the result of installing Leopard shouldn't have been to decrease functionality, should it?
    With a direct connection, everything functions normally. With an Airport connection, nothing functions. None of the partitions show up on the desk top, none show up when I run disk utility, and -- as explained before -- I cannot even mount two of the three partitions manually. I've also noticed now that, when I do mount the one partition that will mount, it freezes the finder when I try to unmount it. After that I have to relaunch the finder in order to regain functionality.
    It seems pretty obvious that the whole mess is a function of Leopard and Airport somehow, but I'm just at a loss to narrow the problem down any further.

  • ...puzzling problem with PHOTOSHOP CS...

    ...still can't import layered PHOTOSHOP files into FCP. Layers are discarded and the imported image is flat. Does anyone else have this problem? Thank You

    ...this version of PHOTOSHOP for 2 years now, with countless layered files animated in FCP and as of last week I can't. Maybe since the TIGER 10.4.11 and then the upgrade to LEOPARD something changed. I just can't figure it out. I've ruled out an FCP or a PHOTOSHOP CS problem because my whole drive has just had an erase and complete re-install. Something insidious is at work here.

  • Puzzling Problem with getParameter

    This is weird.. I shouldn't have any problems with getting the params I've set in the APPLET tag, right?
    Well I do - and it's very annoying
    Where I call it (in the constructor) the code looks like this:
    if(getParameter("URL") != null)
    myUrl = getParameter("URL");
    When I run in the appletviewer, or try just opening the HTML page with a browser (IE), I get the
    following error:
    java.lang.NullPointerException
    at java.applet.Applet.getParameter(Applet.java:158)
    at Configur8Applet.<init>(Configur8Applet.java:32)
    Line 32 is the first line of my submitted code
    Heeeelp!

    I don't know, but I'd expect that in the constructor the parameters aren't available yet. The applet environment has to instantiate your applet and then make the parameters available to it.
    I'd suggest moving the troublesome code to the init() method.

  • Puzzling problem - DW doesn't see recordset it created

    NOTE: I'M STARTING THIS THREAD OVER IN THE DW APPLICATION
    DEVELOPMENT FORUM... ADMIN, PLEASE DELETE THIS THREAD... SORRY FOR
    THE DOUBLE POST.
    I hope that there is someone out there that can help me with
    this... I've looked all over online and can't find an answer to
    this anywhere.
    I'm using DW MX 2004 (7.0.1), ASP...
    I get this message when trying to add the Update server
    behavior... "before using this server behavior, please create a
    Recordset"
    I receive this message even though there is already a
    recordset defined. I've even successfully created a brand new
    recordset, using the DW tools, and it STILL gives me this error.
    To answer some questions that you may ask during
    troubleshooting...
    Are there any error messages (red exclamation points) in the
    bindings window? No.
    Does the recordset appear in the bindings window? Yes.
    Have you tried rebooting? Yes.
    Can anyone please help me? I'm really stuck on this?
    Thanks so much.

    Yes there are settings of the mobile that take settings from user profile.
    You need follow the links about planning and managing user profile.
    Plan user profiles in SharePoint Server 2013
    Manage SharePoint Online user profiles from the SharePoint
    admin center
    Indul Hassan
    Microsoft Community Contributor
    http://www.indulhassan.com
    You Snooze.. You Lose !!

  • 8-Puzzle Depth First Search .. Need Help

    Hi, I have the following code for doing a depth first search on the 8-Puzzle problem
    The puzzle is stored as an object that contains an array such that the puzzle
    1--2--3
    4--5--6
    7--8--[] is stored as (1,2,3,4,5,6,7,8,0)
    The class for the puzzle is:
    class Puzzle implements {
         Puzzle parent;
         int[] pzle;
         int blank;
         Puzzle(int p1,int p2,int p3,int p4,int p5, int p6, int p7, int p8, int p9){
              pzle = new int[9];
              pzle[0] = p1; if(p1==0){ blank=0;}
              pzle[1] = p2; if(p2==0){ blank=1;}
              pzle[2] = p3; if(p3==0){ blank=2;}
              pzle[3] = p4; if(p4==0){ blank=3;}
              pzle[4] = p5; if(p5==0){ blank=4;}
              pzle[5] = p6; if(p6==0){ blank=5;}
              pzle[6] = p7; if(p7==0){ blank=6;}
              pzle[7] = p8; if(p8==0){ blank=7;}
              pzle[8] = p9; if(p9==0){ blank=8;}
         public Puzzle() {
         public boolean equals(Puzzle p){
              if(p == null) return false;
              for(int i =0;i<9;i++){
                   if(p.pzle!=pzle[i]){
                        return false;
              return true;
         public String toString(){
              return pzle[0] + "\t" + pzle[1] + "\t" + pzle [2] + "\n" +
                        pzle[3] + "\t" + pzle[4] + "\t" + pzle [5] + "\n" +
                        pzle[6] + "\t" + pzle[7] + "\t" + pzle [8] + "\n";
         public String printSolution(){
              String ret ="";
              Puzzle st = parent;
              while(st!=null){
                   ret = st + "\n=======================\n" + ret;
                   st = st.parent;
              ret=ret+this;
              return ret;
         public ArrayList<Puzzle> successors(){
              ArrayList<Puzzle> succ = new ArrayList<Puzzle>();
              int b = blank;
              if (((b-1) % 3) != 2 && b!=0) {
              Puzzle np1 = new Puzzle();
              np1.parent = this;
              np1.pzle = new int[9];
              for(int i =0;i<9;i++){
                   np1.pzle[i] = pzle[i];
              np1.pzle[b] = np1.pzle[b-1]; np1.pzle[b-1] = 0;
              np1.blank = b-1;
              if(!np1.equals(this.parent)){
              succ.add(np1);
              if (((b+1) % 3) != 0) {
              Puzzle np2 = new Puzzle();
              np2.parent = this;
              np2.pzle = new int[9];
              for(int i =0;i<9;i++){
                   np2.pzle[i] = pzle[i];
              np2.pzle[b] = np2.pzle[b+1]; np2.pzle[b+1] = 0;
              np2.blank = b+1;
              if(!np2.equals(this.parent)){
                   succ.add(np2);
              if (b-3 >= 0) {
              Puzzle np3 = new Puzzle();
              np3.parent = this;
              np3.pzle = new int[9];
              for(int i =0;i<9;i++){
                   np3.pzle[i] = pzle[i];
              np3.pzle[b] = np3.pzle[b-3]; np3.pzle[b-3] = 0;
              np3.blank = b-3;
              if(!np3.equals(this.parent)){
                   succ.add(np3);
              if (b+3 < 9) {
              Puzzle np4 = new Puzzle();
              np4.parent = this;
              np4.pzle = new int[9];
              for(int i =0;i<9;i++){
                   np4.pzle[i] = pzle[i];
              np4.pzle[b] = np4.pzle[b+3]; np4.pzle[b+3] = 0;
              np4.blank = b+3;
              if(!np4.equals(this.parent)){
                   succ.add(np4);
              return succ;
         The code for the DFS is      public static boolean DFS(Puzzle p, Puzzle goal, ArrayList<Puzzle> closed){
         if(p.equals(goal)){
              sol=p;
              return true;
         for(Puzzle pz : closed){
                   if(pz.equals(p)){
                        return false;
         closed.add(p);
                        //Generate all possible puzzles that can be attained
                        ArrayList<Puzzle> succ = p.successors();
                        for(Puzzle puz : succ){
                             if(DFS(puz,goal,closed)){ return true;}
              return false;
    }The problem is that when i run this on say the following start and goal:          Puzzle startP = new Puzzle(5,4,0,6,1,8,7,3,2);
              Puzzle goalP =new Puzzle(1,2,3,8,0,4,7,6,5);
              ArrayList<Puzzle> closed = new ArrayList<Puzzle>();
              startP.parent=null;
              boolean t = DFS(startP,goalP,closed);5-4-0
    6-1-8
    7-3-2 
    start and goal
    1-2-3
    8-0-4
    7-6-5
    it first takes foreever which is expected but it There should be 9! possible states correct? If I print out the size of the closed array (already seen states) it gets up to about 180000 and then returns with no solution found. But this is well under the 9! possible states...
    Its hard to know whats wrong and if it is even wrong.. but could someone please look at my code and see if something is off?
    I dont think the successor generator is wrong as I tested the blank in every space and it got the correct successors.
    Any ideas?                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                           

    Puzzle(int p1,int p2,int p3,int p4,int p5, int p6, int p7, int p8, int p9){
              pzle = new int[9];
              pzle[0] = p1; if(p1==0){ blank=0;}
              pzle[1] = p2; if(p2==0){ blank=1;}
              pzle[2] = p3; if(p3==0){ blank=2;}
              pzle[3] = p4; if(p4==0){ blank=3;}
              pzle[4] = p5; if(p5==0){ blank=4;}
              pzle[5] = p6; if(p6==0){ blank=5;}
              pzle[6] = p7; if(p7==0){ blank=6;}
              pzle[7] = p8; if(p8==0){ blank=7;}
              pzle[8] = p9; if(p9==0){ blank=8;}
         }vs
    Puzzle(int...puzzle) {
      assert puzzle.length == 9;
      this.puzzle = Arrays.copyOf(puzzle, 9);
      for (int blank = 0; blank < 9; ++blank) if (puzzle[blank] == 0) break;
      // check values are 0...8
      Arrays.sort(puzzle); // sorts the original
      for (int i = 0; i < 9; ++i) assert puzzle[i] == i;
    Does anyone know if there are any simple applets or programs that do 8 Puzzle on any given start and finish state? Just to see the expected results.Not off hand, but you can always generate your starting state by moving backwards from the finish state.
    Also, I dont know..but are there some instances of an 8 Puzzle that cannot be solved at all?? IIRC, you can't transform 123 to 132 leaving the remainder unchanged, though I haven't checked.

  • Problem writing external file to externally mounted disk in Windows

    Folks,
    I've got a puzzling problem with a simple OWB mapping where I'm dumping the contents of a table to an external file.
    Versions are OWB v 11.2.0.2 64-bits on Oracle RDBMS 11.2.0.2 Windows 2007 64-bits Enterprise Server.
    When the external files module is hooked up to a location that points to a local disk and directory on the OWB-server, everything works fine - files are created and written.
    When the external files module is hooked up to a location that points to a mounted disk on another Windows 2007 64-bits Enterprise Server, I get +"Invalid Path for target file, check if connector is deployed correctly".+
    The "File System Location Path" in OWB is set to "N:" (no slashes either way). "Test Connection" reports OK.
    I've given both the Oracle os-user and "Everyone" (for good measure) all rights on the mounted disk, and I can see that the generated package code is using the correct Directory, and the Directory Path is the correct one on the server. The mounted disk (N:) should appear as a local disk to Oracle as far as I can see. I'm able to create and delete files on the disk using command line on the OWB/DB-server.
    I'm scratching my head on this one....

    then mapped that share as a network drive (N:) on server A (the OWB/DB-server)I think that problem was with different accounts used for run Oracle database (usually database instance run under SYSTEM account) and which you used to map share (it was interactive session). Even when you made this map persistent (enable "Reconnect at logon" option during mapping) you don't grant access to this drive to other accounts (including SYSTEM ) - this drive will not be visible to other users.
    I think it is possible to create "persistent" network drive mapping for Oracle database context with specification non-SYSTEM account (domain or server local) for running Oracle database instance (and Oracle Listener service).
    Also it seems there is a workaround to access mapped network drive under SYSTEM account:
    http://stackoverflow.com/questions/182750/how-to-map-a-network-drive-to-be-used-by-a-service
    Regards,
    Oleg

  • Problem opening a particular PDF document in ALL browsers

    I have a problem a PDF document in all browsers.
    I have a mail order account online and I am trying to open one of my statements by clicking on the PDF logo.
    A new window opens and is either blank or tells me it cannot load (depending which browser used).  When the new window opens the address in the browser is an IP address / name of the company / document number.PDF 
    I have contacted the company but they tell me to either download the latest Adobe Reader (which I have), and try a different browser (which I have).
    I have tried changing settings in all browsers as per instructions found on other sites, and I can open PDF docs from other sites and my pc no problem. This tells me that the problem lies with the company, yet they cannot seem to resolve.
    Does anyone have any ideas or can shed light on this puzzling problem?
    So grateful, thanks.

    Can you try to download that PDF to your local disk, and open it from there?

  • Problem with random number generation

    hey forum, i wonder if anyone can help me out with a small problem with my university coursework (yep its homework!!!)
    heres my problem, i am writing one of them 8 puzzle problems (the one based around sam lloyds 15 puzzler), i can successfully generate one random sequence of numbers with no duplicates, but whenever i call the random method again it keeps producing the same results
    heres the code
    in my main class file
    if(e.getSource() == randomButton) {
          new RandomPuzzle();
          System.out.println(random.randState);
          //startStateString = new RandomPuzzle();
    }heres my number generator class file
    import java.util.Random;
    import java.io.*;
    public class RandomPuzzle
         /** Base Random number generator */
        Random rn = new Random();
        /** Puzzle holder */
        byte b[];
        long number = 0;
        String randState = "";
        /** Default constructor */
        public RandomPuzzle() {
            rn.setSeed(number);
            b = new byte[9];
            randState = randomString();
        /** Provide range for generation */
        public int rand(int lo, int hi) {
            int n = hi - lo + 1;
            int i = rn.nextInt() % n;
            if (i < 0)
            i = -i;
            return lo + i;
        /** Set size for array */
        public int rand( int hi){
            int n = hi;
                return n;
        /** Check for duplicate values within the same configuration */
        boolean valueExists( byte value ) {
            int i = b.length;
            boolean exists = false;
            for( int j = 0; j < i; j++ ){
                if( b[j] == value )
                    exists = true;
            return exists;
        /** returns the actual string */
        public String randomString(int lo, int hi) {
            int n = rand( 9 );
            //boolean valueEntered = false;
            for (int i = 0; i < 9; i++) {
                boolean valueEntered = false;
                byte temp = (byte)rand('0', '8');
                while( valueEntered == false ) {
                    if( !valueExists( temp ) ) {
                         b[i] = temp;
                         valueEntered = true;
                    else
                        temp = (byte)rand('0', '8');
            return new String(b, 0);
        /** calls above function */
        public String randomString() {
            return randomString(0, 8);
    }i've tried for hours to work this out, but i am stumped. if anyone can point me in the right direction, maybe point out the problem code and give one or two tips i would be forever in your debt
    thanx in advance
    korbitz

    thanx for the help paulcw, but when i removed the seed code it done the same
    but i added this to my main class and now it works fine
    if(e.getSource() == randomButton) {
                   RandomPuzzle temp = new RandomPuzzle();
                   System.out.println(temp.randState);
                   //startStateString = new RandomPuzzle();
              }thanx again for your help

Maybe you are looking for

  • Problem with text direction in table component for text with two language!

    Hi, I want to display text in table component by binding to the one property,and also the language of this text is farsi that must be in the RTL direction. so i defined a direction in style of staticText component in the table. when the text is only

  • How do I display array values in a text field?

    Hi there- I have a small Flash movie I'm trying to complete, it's my first go around with Flash 8 so I appreciate your patience: I built an array with some actionscript which seems to work fine (I can trace it and all is well in the trace window). No

  • Mapping buttons from imac Bluetooth Keyboard to Macpro

    I tried a friend's new mini bluetooth keyboard (one that sells with new imac) on my Macpro, and some of the buttons do not seem to map correctly. Example: volume was effecting expose. Is it just not meant to be used with anything other than an imac,

  • Source system compounded

    Hi Guys, At my client we need to make certain Info objects system compounded. The problem, when activating the Infoobjects an error message appears saying that the Infoobject contains data in the Infosource and ODS. Does anyone know how to bypass thi

  • Custom Components (CFC's)

    So I'm working on an app that requires 2 CFC's in order for it to function correctly. The first one is sosXML (http://sosxml.riaforge.org/) and the other is cfcUnit. So I downloaded both zipped files and dropped them in the root path of the website's