"Puzeloopz"

A Puzzle Loop consists of a 5x5 grid of cells in which you have to form a single loop (without crossings or branches) enclosing some of the cells. The number in each cell indicates how many lines (or "walls") surround it. (If no number is given, that cell can have any number of walls.) Left click on a cell boundary if you think that a wall is present (aqua) in that direction. Right click on a cell boundary if you think that a wall is absent (red) in that direction. When you're finished, press any key on you keyboard to see the solution (yellow) to the puzzle.

Source Listing

* * * * * * * * * * * * * * * * * * * Program: "Puzeloopz" * * Author: Bob Bishop * * Created: 2010 April 12 * * * * * * * * * * * * * * * * * * * U l t r a - S i M P L E randomize Do Do create @ solve @ If solved(0) Break Loop scrunch @ display @ Loop //---------------------------// Task create Common Int data[49][7] Do k=0,48 data[k][0]=0 Loop Do a=random(5)+1 b=random(5)+1 c=random(5)+1 d=random(5)+1 ab=iabs(a-b)+1 cd=iabs(c-d)+1 If (ab=1 Or cd=1) Continue If (ab*cd<10) Break Loop Do x=a,b Do y=c,d data[7*y+x][0]=1 Loop Loop prod=ab*cd; numtry=75 If (prod=4) numtry=250 If (prod=6) numtry=200 If (prod=8) numtry=100 Do k=1,numtry a=random(5)+1 b=random(5)+1 d=random(4) If (d=0) da=0; db=-1 If (d=1) da=+1; db=0 If (d=2) da=0; db=+1 If (d=3) da=-1; db=0 x=a+da; y=b+db If (x<1 Or x>5) Continue If (y<1 Or y>5) Continue If (data[7*b+a][0]=data[7*y+x][0]) Continue ndx=7*y+x; sum=data[ndx][0] If (da) sum=sum+data[ndx+ da][0]+data[ndx-7][0]+data[ndx+7][0]+data[ndx+ da+7][0]+data[ndx+ da-7][0] Else sum=sum+data[ndx+7*db][0]+data[ndx-1][0]+data[ndx+1][0]+data[ndx+7*db+1][0]+data[ndx+7*db-1][0] If (sum=0 Or sum=6) data[7*y+x][0]=data[7*b+a][0] Loop Do y=1,5 Do x=1,5 ndx=7*y+x; data[ndx][1]=0 If (data[ndx][0]!=data[ndx+1][0]) data[ndx][1]=data[ndx][1]+1 If (data[ndx][0]!=data[ndx-1][0]) data[ndx][1]=data[ndx][1]+1 If (data[ndx][0]!=data[ndx+7][0]) data[ndx][1]=data[ndx][1]+1 If (data[ndx][0]!=data[ndx-7][0]) data[ndx][1]=data[ndx][1]+1 Loop Loop //---------------------------------------------------------// Task solve Common Int newinfo init @ Do newinfo=0 Do y=1,5 Do x=1,5 check cell (7*y+x) @ Loop Loop Do node=0,48 check node (node) @ Loop If (newinfo=0) Break Loop //---------------------------------------------------------// Task init Common Int data[49][7] Common Int xoffset, yoffset xoffset=xpixels()/2-80 yoffset=15*(ypixels()/30-5) Do k=0,48 Do j=0,6 If (j=1) Continue data[k][j]=0 Loop Loop Do k=0,6 data[k][0]=1; data[k][6]=1 data[42+k][0]=1; data[42+k][6]=1 data[7*k][0]=1; data[7*k][6]=1 data[6+7*k][0]=1; data[6+7*k][6]=1 Loop //---------------------------------------------------------// Task check cell (Int cell) Common Int data[49][7], newinfo Int n, e, s, w If (data[cell][0]) Return get cell walls (cell, n, e, s, w) @ If (n And e And s And w) data[cell][0]=1 data[cell][6]=1 Return Endif If (data[cell][1]<0) Return If (data[cell][1]=0) put cell walls (cell, -1, -1, -1, -1) @ data[cell][0]=1 newinfo=1; Return Endif If (data[cell][1]=1) If (n=+1 Or e=+1 Or s=+1 Or w=+1) If (n=+1) put cell walls (cell, +1, -1, -1, -1) @ If (e=+1) put cell walls (cell, -1, +1, -1, -1) @ If (s=+1) put cell walls (cell, -1, -1, +1, -1) @ If (w=+1) put cell walls (cell, -1, -1, -1, +1) @ data[cell][0]=1 newinfo=1; Return Endif If (n+e+s+w=-3) If (n=0) put cell walls (cell, +1, -1, -1, -1) @ If (e=0) put cell walls (cell, -1, +1, -1, -1) @ If (s=0) put cell walls (cell, -1, -1, +1, -1) @ If (w=0) put cell walls (cell, -1, -1, -1, +1) @ data[cell][0]=1 newinfo=1; Return Endif Endif If (data[cell][1]=2) flag=0 If (n=+1 And e=+1) flag=1; put cell walls (cell, +1, +1, -1, -1) @ If (n=+1 And s=+1) flag=1; put cell walls (cell, +1, -1, +1, -1) @ If (n=+1 And w=+1) flag=1; put cell walls (cell, +1, -1, -1, +1) @ If (e=+1 And s=+1) flag=1; put cell walls (cell, -1, +1, +1, -1) @ If (e=+1 And w=+1) flag=1; put cell walls (cell, -1, +1, -1, +1) @ If (s=+1 And w=+1) flag=1; put cell walls (cell, -1, -1, +1, +1) @ If (n=-1 And e=-1) flag=1; put cell walls (cell, -1, -1, +1, +1) @ If (n=-1 And s=-1) flag=1; put cell walls (cell, -1, +1, -1, +1) @ If (n=-1 And w=-1) flag=1; put cell walls (cell, -1, +1, +1, -1) @ If (e=-1 And s=-1) flag=1; put cell walls (cell, +1, -1, -1, +1) @ If (e=-1 And w=-1) flag=1; put cell walls (cell, +1, -1, +1, -1) @ If (s=-1 And w=-1) flag=1; put cell walls (cell, +1, +1, -1, -1) @ If (flag) data[cell][0]=1; newinfo=1; Return Endif If (data[cell][1]=3) If (n=-1 Or e=-1 Or s=-1 Or w=-1) If (n=-1) put cell walls (cell, -1, +1, +1, +1) @ If (e=-1) put cell walls (cell, +1, -1, +1, +1) @ If (s=-1) put cell walls (cell, +1, +1, -1, +1) @ If (w=-1) put cell walls (cell, +1, +1, +1, -1) @ data[cell][0]=1 newinfo=1; Return Endif If (n+e+s+w=+3) If (n=0) put cell walls (cell, -1, +1, +1, +1) @ If (e=0) put cell walls (cell, +1, -1, +1, +1) @ If (s=0) put cell walls (cell, +1, +1, -1, +1) @ If (w=0) put cell walls (cell, +1, +1, +1, -1) @ data[cell][0]=1 newinfo=1; Return Endif Endif //---------------------------------------------------------// Task get cell walls (Int cell, Int n, Int e, Int s, Int w) Common Int data[49][7] n=data[cell][2] e=data[cell][3] s=data[cell][4] w=data[cell][5] //---------------------------------------------------------// Task put cell walls (Int cell, Int n, Int e, Int s, Int w) Common Int data[49][7] data[cell][2]=n data[cell][3]=e data[cell][4]=s data[cell][5]=w data[cell+7][2]=s data[cell-7][4]=n data[cell+1][5]=e data[cell-1][3]=w //---------------------------------------------------------// Task check node (Int node) Common Int data[49][7], newinfo Int n, e, s, w If (node<8) Return get node walls (node, n, e, s, w) @ If (n And e And s And w) Return If (n=+1 And e=+1) newinfo=1; put node walls (node, +1, +1, -1, -1) @ If (n=+1 And s=+1) newinfo=1; put node walls (node, +1, -1, +1, -1) @ If (n=+1 And w=+1) newinfo=1; put node walls (node, +1, -1, -1, +1) @ If (e=+1 And s=+1) newinfo=1; put node walls (node, -1, +1, +1, -1) @ If (e=+1 And w=+1) newinfo=1; put node walls (node, -1, +1, -1, +1) @ If (s=+1 And w=+1) newinfo=1; put node walls (node, -1, -1, +1, +1) @ numpos=bool(n>0)+bool(e>0)+bool(s>0)+bool(w>0) numnul=bool(n=0)+bool(e=0)+bool(s=0)+bool(w=0) If (numpos=1 And numnul=1) If (n=0) n=1 If (e=0) e=1 If (s=0) s=1 If (w=0) w=1 put node walls (node, n, e, s, w) @ newinfo=1; Return Endif //---------------------------------------------------------// Task get node walls (Int node, Int n, Int e, Int s, Int w) Common Int data[49][7] llcell=node-1; urcell=node-7 n=data[urcell][5] e=data[urcell][4] s=data[llcell][3] w=data[llcell][2] //---------------------------------------------------------// Task put node walls (Int node, Int n, Int e, Int s, Int w) Common Int data[49][7] ulcell=node-8; lrcell=node llcell=node-1; urcell=node-7 data[ulcell][3]=n data[ulcell][4]=w data[lrcell][5]=s data[lrcell][2]=e data[urcell][5]=n data[urcell][4]=e data[llcell][3]=s data[llcell][2]=w //---------------------------------------------------------// Int solved (Int show) Common Int xoffset, yoffset Int n, e, s, w Do y=1,6 Do x=1,6 ndx=7*y+x get node walls (ndx, n, e, s, w) @ If (e=+1) Goto start Loop Loop Return 0 start: begin=ndx; vector=3; ndx=ndx+1 xul=32*x-28; yul=30*y-24 color (14) Do If show line size (3) If (vector=2) line (xoffset+xul, yoffset+yul, xoffset+xul, yoffset+yul-30); yul=yul-30 If (vector=3) line (xoffset+xul, yoffset+yul, xoffset+xul+32, yoffset+yul); xul=xul+32 If (vector=4) line (xoffset+xul, yoffset+yul, xoffset+xul, yoffset+yul+30); yul=yul+30 If (vector=5) line (xoffset+xul, yoffset+yul, xoffset+xul-32, yoffset+yul); xul=xul-32 line size (1) Endif If (ndx=begin) Return 1 get node walls (ndx, n, e, s, w) @ If (vector=2 And w=+1) ndx=ndx-1; vector=5; Continue If (vector=2 And n=+1) ndx=ndx-7; Continue If (vector=2 And e=+1) ndx=ndx+1; vector=3; Continue If (vector=3 And n=+1) ndx=ndx-7; vector=2; Continue If (vector=3 And e=+1) ndx=ndx+1; Continue If (vector=3 And s=+1) ndx=ndx+7; vector=4; Continue If (vector=4 And e=+1) ndx=ndx+1; vector=3; Continue If (vector=4 And s=+1) ndx=ndx+7; Continue If (vector=4 And w=+1) ndx=ndx-1; vector=5; Continue If (vector=5 And s=+1) ndx=ndx+7; vector=4; Continue If (vector=5 And w=+1) ndx=ndx-1; Continue If (vector=5 And n=+1) ndx=ndx-7; vector=2; Continue Return 0 Loop //---------------------------------------------------------// Task scrunch Common Int data[49][7] Do y=1,5 Do x=1,5 ndx=7*y+x temp=data[ndx][1] data[ndx][1]=-1 solve @ If (!solved(0)) data[ndx][1]=temp Loop Loop solve @ //---------------------------------------------------------// Task display Common Int data[49][7] Common Int xoffset, yoffset cls; frame (xoffset-92, yoffset-172, xoffset+257, yoffset+319) solid color (rgb(128,144,160)) solid rectangle (xoffset-92, yoffset-172, xoffset+257, yoffset+319) frame (xoffset-4, yoffset-2, xoffset+172, yoffset+164) solid color (0) solid rectangle (xoffset-4, yoffset-2, xoffset+172, yoffset+164) Do k=1,yoffset/15,1 Display Loop forecolor (15); backcolor (0) Do y=1,5 Display; htab (xoffset/8+1); Display " ", Do x=1,5 ndx=7*y+x If (data[ndx][6] Or data[ndx][1]<0) Display " ", Else Display " ",data[ndx][1],,, Loop Display Loop color (8) Do y=1,5 Do x=1,5 xul=32*x-28; yul=30*y-24 line (xoffset+xul, yoffset+yul, xoffset+xul+32, yoffset+yul) line (xoffset+xul+32, yoffset+yul, xoffset+xul+32, yoffset+yul+30) line (xoffset+xul, yoffset+yul+30, xoffset+xul+32, yoffset+yul+30) line (xoffset+xul, yoffset+yul, xoffset+xul, yoffset+yul+30) Loop Loop xtab=xoffset/8-4; ytab=yoffset/15+17 tabxy (xtab+8, ytab-24); framed text ("\n \"Puzeloopz\" \n", 0, 7) play @ z=solved(1) tabxy (xtab, ytab); framed text (" Press the 'Esc' key to quit, \n any other key to play again ", 0, 7) key=waitkey() If (key=27) quit //---------------------------------------------------------// Task play Common Int xoffset, yoffset Int x, y, z xtab=xoffset/8-4; ytab=yoffset/15+17 tabxy (xtab, ytab); framed text (" Press the 'Esc' key to quit, \n any other key to see the loop", 0, 7) Do Do key=readkey() If (key=27) quit If (key) Return read mouse (x, y, z) If (z) Break Loop x=x-xoffset; y=y-yoffset xcell=(x+28)/32; ycell=(y+25)/30 xul=xoffset+32*xcell-28; yul=yoffset+30*ycell-24 xx=xoffset+x-xul; yy=yoffset+y-yul If 30*xx>32*yy If (32*(30-yy)>30*xx) wall (xul, yul, xul+32, yul, z) @ Else wall (xul+32, yul, xul+32, yul+30, z) @ Endif Else If (32*(30-yy)>30*xx) wall (xul, yul, xul, yul+30, z) @ Else wall (xul, yul+30, xul+32, yul+30, z) @ Endelse Do read mouse (x, y, z) If (!z) Break Loop Loop //---------------------------------------------------------// Task wall (Int a, Int b, Int c, Int d, Int z) Common Int xoffset, yoffset If (a<xoffset-16 Or b<yoffset-15) Return If (c>xoffset+176 Or d>yoffset+165) Return kolor=getpixel((a+c)/2,(b+d)/2); color (8) If (z=1 And (kolor=8 Or kolor=4)) color (11) If (z=2 And (kolor=8 Or kolor=11)) color (4) line (a, b, c, d)

How To Run The Program If you're feeling ambitious and have nothing better to do, you could just copy the source listing by hand! However, there is a much easier way to do it: Copy the source listing into the Windows Clipboard Paste the Clipboard into a new text document Drop that text document onto the "Drop SiMPLE Listing Here" icon Or, if you don't have SiMPLE installed on your computer, click here to run the precompiled version of the program.

(If you would like to contribute any of your SiMPLE programs to The Gallery, just e-mail them to us.)

  [ Webmaster | FAQ's | Home Page | Contact Us ]

© Copyright 2010 SiMPLE CodeWorks, Inc. All rights reserved.