topoffset=155; leftoffset=100; tileheight=41; tilewidth=33; tileoffset=10; layeroffset=-4; copytopoffset=486; copyleftoffset=584; var move; n=144; function UnCryptMailto(s) { // var n=0; var r=""; for(var i=0; i < s.length; i++) { n=s.charCodeAt(i); if (n>=8364) {n = 128;} r += String.fromCharCode(n-(1)); } return r; } function linkTo_UnCryptMailto(s) { // location.href=UnCryptMailto(s); } function preload() { count=0; image=new Array ('bg.jpg','bamb1.gif','bamb2.gif','bamb3.gif','bamb4.gif','bamb5.gif','bamb6.gif','bamb7.gif','bamb8.gif','bamb9.gif','circ1.gif','circ2.gif','circ3.gif','circ4.gif','circ5.gif','circ6.gif','circ7.gif','circ8.gif','circ9.gif','numb1.gif','numb2.gif','numb3.gif','numb4.gif','numb5.gif','numb6.gif','numb7.gif','numb8.gif','numb9.gif','wind1.gif','wind2.gif','wind3.gif','wind4.gif','drag1.gif','drag2.gif','drag3.gif','flow1.gif','flow2.gif','flow3.gif','flow4.gif','seas1.gif','seas2.gif','seas3.gif','seas4.gif','mark.gif','new.gif','restart.gif','undo.gif','moves.gif','hint.gif','help.gif','info.gif','email.gif'); picture=new Array(image.length); for (i=0;iSolitaire Mahjongg is loading...<\/font>"; document.getElementById("screen").innerHTML=display; } else if (count==image.length) setup(); } function select(i,face) { i=i-120; suggest=0; test(i); if (cond) { if (move==1)select2(i,face); else select1(i,face); } else noselect(); } function noselect() { message="Tile is not free!"; mark[k]=""; move=0; show(); wait(); } function nomatch() { message="Tiles are different!"; mark[k]=""; move=0; show(); wait(); } function equal() { message="No tile selected."; mark[k]=""; move=0; show(); wait(); } function select1(i,face) { i1sto=i; facesto=face; message="Tile selected..."; k=i; mark[k]=" $\"\"$ <\/a>"; move=1; showhelp=0; showinfo=0; show(); } function select2(i,face) { if (facesto!=face)nomatch(); else { i2sto=i; ihistory[ihistory.length]=i1sto; ihistory[ihistory.length]=i2sto; tilehistory[tilehistory.length]=tile[i1sto]; tilehistory[tilehistory.length]=tile[i2sto]; tile[i1sto]=notile[i1sto]; tile[i2sto]=notile[i2sto]; message="Selected tiles match!"; mark[k]=""; move=0; back++; show(); counter-=2; wait(); } } function shuffle() { randomnumber=new Array(n); for (i=0;i $\"\"$ <\/a>"; background=" $\"\"$ "; copyright="© twb<\/font>"; menu="
$\"\"$ <\/a> $\"\"$ <\/a> $\"\"$ <\/a> $\"\"$ <\/a> $\"\"$ <\/a> $\"\"$ <\/a> $\"\"$ <\/a> $\"\"$ <\/a>"; show(); wait(); } function show() { for (i=0;i <\/font>"+background+copyright+fig[57]+fig[58]+fig[59]+fig[60]+fig[61]+fig[62]+fig[63]+fig[64]+fig[65]+fig[66]+fig[67]+fig[68]+fig[69]+fig[70]+fig[71]+fig[72]+fig[73]+fig[74]+fig[75]+fig[76]+fig[77]+fig[78]+fig[79]+fig[80]+fig[81]+fig[82]+fig[83]+fig[84]+fig[85]+fig[86]+fig[87]+fig[88]+fig[89]+fig[90]+fig[91]+fig[92]+fig[93]+fig[94]+fig[95]+fig[96]+fig[97]+fig[98]+fig[99]+fig[100]+fig[101]+fig[102]+fig[103]+fig[104]+fig[105]+fig[106]+fig[107]+fig[108]+fig[109]+fig[110]+fig[111]+fig[112]+fig[113]+fig[114]+fig[115]+fig[116]+fig[117]+fig[118]+fig[119]+fig[120]+fig[121]+fig[122]+fig[123]+fig[124]+fig[125]+fig[126]+fig[127]+fig[128]+fig[129]+fig[130]+fig[131]+fig[132]+fig[133]+fig[134]+fig[135]+fig[136]+fig[137]+fig[138]+fig[139]+fig[140]+fig[141]+fig[142]+fig[143]+fig[21]+fig[22]+fig[23]+fig[24]+fig[25]+fig[26]+fig[27]+fig[28]+fig[29]+fig[30]+fig[31]+fig[32]+fig[33]+fig[34]+fig[35]+fig[36]+fig[37]+fig[38]+fig[39]+fig[40]+fig[41]+fig[42]+fig[43]+fig[44]+fig[45]+fig[46]+fig[47]+fig[48]+fig[49]+fig[50]+fig[51]+fig[52]+fig[53]+fig[54]+fig[55]+fig[56]+fig[5]+fig[6]+fig[7]+fig[8]+fig[9]+fig[10]+fig[11]+fig[12]+fig[13]+fig[14]+fig[15]+fig[16]+fig[17]+fig[18]+fig[19]+fig[20]+fig[1]+fig[2]+fig[3]+fig[4]+fig[0]+"

"+message+"<\/td><\/tr>

"+menu+"<\/td><\/tr><\/table>"; document.getElementById("screen").innerHTML=display; } function wait() { showhelp=0; showinfo=0; if (counter!=0) message="Score: "+(n-counter); else message="Score: "+(n-counter)+" – congratulations! You win!"; setTimeout('show()',2000); } function help() { if (showhelp==0) { showhelp=1; message="Solitaire Mahjongg, also called Taipei, Taipeh or Shanghai, is the web adaptation of an old Chinese board game. The objective is to remove all "+n+" tiles from the board; for each pair of tiles removed you will get two points.

Options:

New: sets up a new game.<\/li>
Restart: restarts the current game.<\/li>
Undo: withdraws your moves one by one.<\/li>
Moves: displays the number of currently possible moves.<\/li>
Hints: shows currently possible moves one by one.<\/li>
Help: displays the rules of the game.<\/li>
Info: displays Solitaire Mahjongg game information.<\/li>
Email: sends an email to the author.<\/li><\/ul>
The rules are simple:
Starting from the sides, or from the central tile at the top of the pile, remove tiles by clicking on two equal symbols. If the tiles are identical, they will disappear, and your score will rise.
Selectable tiles always must have at least one empty side. If on both sides of a tile there is a neighbouring tile on the same level, it cannot be selected.
$\"\"$ $\"\"$ $\"\"$ $\"\"$ $\"\"$ $\"\"$ $\"\"$ $\"\"$
Note: The four tiles showing season symbols (above, left) match even if they are different; the four flower tiles (above, right) match respectively."; suggest=0; mark[k]=""; move=0; show(); } else { message="Back to the game."; show(); wait(); } } function info() { if (showinfo==0) { showinfo=1; message="In mathematical terms, Solitaire Mahjongg is easily described. There are 144!/(4!)^{36<\/sup> different games, the probability that you will encounter the same game twice is 1/1.1394912*10^{200<\/sup>. The number of games that actually can be won cannot be calculated exactly, yet experts estimate that good players win every third up to every second game.}}
This web version of Solitaire Mahjongg consists of two files coded in DHTML/CSS and Javascript. In addition, images are used for the tiles, buttons and game background. To play the game no plugins are needed. There are no special system requirements, except for a DHTML compatible browser. If the Javascript option is enabled, just surf and play.
The idea for this game came from the www.the5k.org competition first held in 2000, the objective of which it was to encourage lean, efficient, functional, original and aesthetic web programming. A <5kb version of Solitaire Mahjongg took part in the 2002 contest. We are re using the services of third party service providers to display advertisements on our website. These companies may under circumstance by setting up cookies use information about your visit on this site to display advertisements that suit your interests of products and services. The use of your name, your address, your email address or phone number will remain unaffected by these procedures. If you want to know how you can deactivate the setup of cookies please read the help section of your internet browser. If you would like to know more about the methods that are beeing used, please go to www.google.de/privacy_ads.html.
Solitaire Mahjongg v2.6
copyright © by Thomas Weibel
4102 Binningen, Switzerland
Last update: November 5th, 2004"; suggest=0; mark[k]=""; move=0; show(); } else { message="Back to the game."; show(); wait(); } } function undo() { if (ihistory.length==0) { message="Undo not possible!"; suggest=0; mark[k]=""; move=0; show(); wait(); } else { restore(); message="Move undone."; suggest=0; mark[k]=""; move=0; back--; show(); counter+=2; wait(); } } function restart() { if (ihistory.length==0) { message="Restart not possible!"; suggest=0; mark[k]=""; move=0; show(); wait(); } else { for (i=0;i"; mark[hints[1]]=" $\"\"$ "; } function test(i) { lr=(tile[i-1]==notile[i-1]||tile[i+1]==notile[i+1]); loop=new Array(); vari=new Array(10,11,14,15,28,29,30,31,34,35,36,37,40,41,42,43,46,47,48,49,70,71,72,73,74,75,79,80,81,82,83,84,91,92,93,94,95,96,103,104,105,106,107,108,116,117,118,119,120,121,125,126,127,128,129,130); for (j=1;j<57;j++) loop[j]=(i==vari[j-1]&&(lr&&tile[j]==notile[j])); cond=((i==0||i==5||i==8||i==9||i==12||i==13||i==16||i==17||i==20||i==21||i==26||i==27||i==32||i==33||i==38||i==39||i==44||i==45||i==50||i==51||i==56||i==57||i==68||i==69||i==76||i==77||i==86||i==87||i==113||i==114||i==123||i==124||i==131||i==132||i==143|| ((i>=1&&i<=4)&&tile[0]==notile[0])|| ((i==6||i==7||i==18||i==19||(i>=22&&i<=25)||(i>=52&&i<=55)||(i>=58&&i<=67)||i==78||i==85||(i>=88&&i<=90)||i==97||i==98||i==101||i==102||(i>=109&&i<=111)||i==115||i==122||i==133||(i>=134&&i<=142))&&lr)|| loop[1]||loop[2]||loop[3]||loop[4]||loop[5]||loop[6]||loop[7]||loop[8]||loop[9]||loop[10]||loop[11]||loop[12]||loop[13]||loop[14]||loop[15]||loop[16]||loop[17]||loop[18]||loop[19]||loop[20]||loop[21]||loop[22]||loop[23]||loop[24]||loop[25]||loop[26]||loop[27]||loop[28]||loop[29]||loop[30]||loop[31]||loop[32]||loop[33]||loop[34]||loop[35]||loop[36]||loop[37]||loop[38]||loop[39]||loop[40]||loop[41]||loop[42]||loop[43]||loop[44]||loop[45]||loop[46]||loop[47]||loop[48]||loop[49]||loop[50]||loop[51]||loop[52]||loop[53]||loop[54]||loop[55]||loop[56]|| (i==99&&(tile[98]==notile[98]||tile[112]==notile[112]))|| (i==100&&(tile[87]==notile[87]||tile[101]==notile[101]))|| (i==112&&((tile[99]==notile[99]&&tile[111]==notile[111])||tile[113]==notile[113])))&& tile[i]!=notile[i]); }