Solved "+icount+"/"+isautorun+" "+(new Date())+" "
var A = []
for (var type in MethodExamples)if ("Sh1;Sn1;".indexOf(type)< 0)A.push(type)
A = A.sort()
for (var i = 0; i < A.length; i++)
s+=" \n"+MethodExamples[A[i]].join(" \n")+"\n \n \n"
return s
}else if(type=="="){
s = "Sudoku Difficulty Analysis:\n
"
thisLogMessage = s
return s
}
if(ishint)return 1
var ref = autoPrefix + "." + isautorun+"."+nsteps
AutoMsgs.push("\n"+ref+" "+type+": "+s+" ")
if (M.previousRef != ref && lastmsg != "") {
M.previousRef = ref
if (SnapShot[solving]) {
AutoMsgs = []
var isALS = (type.charAt(0) == "A" || type == "B")
if(M.haveALS || isALS == (igetalmostlockedx || igetalmostlockedy || igetalmostlockedb)) {
if (!MethodExamples[type])MethodExamples[type] = []
MethodExamples[type].push(["" + type + "",
""+ref + ""
, "\n"+type,lastmsg,""
, (redlist?""+redlist+"":"")
, (redlistk?""+redlistk+"":"")
, (greenlist?"\n"+type + " " + greenlist+"":"")
, (bluelist?""+bluelist+"":"")
, (ishowchain>0?"" + getChainListing(ishowchain)+"":"")
, (ishowchain2>0?"" + getChainListing(ishowchain2)+"":"")
].join(" "))
//if(isALS)M.haveALS=true
}
}
if (!MethodRefs[type])MethodRefs[type] = solving
MethodsUsed[isautorun][type]++
}
MethodsUsed[isautorun].logiclevel=Logic_level
MethodsUsed[isautorun].winglevel=Wing_level
return "1"
}
function mLine(M,ref,name,type, noExample){
return "\n ..."+name+": "
+ M[type]+(M[type] > 0 && MethodRefs[type] && !noExample? getMarkLink("(step "+MethodRefs[type]+")",SnapShot[MethodRefs[type]], "DOSTEP=1", 1,"popup.htm") : "")
}
function compressMarks(T){
var s=""
for(var i=0;i<9;i++)for(var j=0;j<9;j++){
s+=","
for(var k=0;k<9;k++)if(T[k+j*9+i*81])s+=(k+1)
}
return s.substring(1)
}
var ishowcolors = true
var weakmarks = ""
function createTable(imode, fullchainlist){
MouseColor = {}
fullchainlist || (fullchainlist="")
var igofast=doGoFast()
if(!imode)imode=0
var issnap=(imode<0?0:imode)
onlythisn=(imode<0?-imode:0)
if (!onlythisn)showChainDiv(-1)
if(issnap==1){
saveRef("createtable")
if (getValues(0))return false // user indicated -n -- so show marks
}
theref=""
chainlist=(ishowchain > 0 ?getChainListing(ishowchain): ishowchain < 0 ? alsGetChainListing(-ishowchain) : "")
chainlist2=(ishowchain2 > 0 ?getChainListing(ishowchain2): ishowchain2 < 0 ? alsGetChainListing(-ishowchain2) : "")
weakmarks = (idontshowchain?getAssociatedNodeSet(idontshowchain):yellowlist != "" ? weakmarks : "")
ishowcolors=(greenlist!="NOSHOW")
showChainDiv(-1)
ihavemarks=(issnap == 3 || !issnap)
if(thisviewmode=="jmol")updateAllowed(1)
if (lastmsg.indexOf(" via ALS")>=0)bluelist += lastmsg.substring(lastmsg.indexOf(" via ALS"))
isbad=0
var s=(enableUserEntry || onlythisn ? "
"+(onlythisn ? getRowColumnLabels(onlythisn, 0)
: ihavemarks?"click on a mark to set it; off the marks to set several at once"
: "click on a cell to set one or more values")+"
"
: "")
s+="
"
+"
"
+"
"
var nok=0
haveopencells=0
for(var k=0;k<9;k++){ //blocks
var i=Math.floor(k/3)*3
var j=(k%3)*3
if(k%3==0)s+="
"
}
if(C.onlypossible){
thehint="the number in this cell must be "+C.onlypossible
if(!onlythisn)thestyle="style='background-color:red'"
ishowmarks=1
ishint++
}
}else if(issnap == 1 || issnap == 2 || ishint>1){
s+="
"
}else{
ishowmarks=1
}
if(ishowmarks){
var p = 0
var nmarks = 0
for(var k=0;k<9;k++){
n=k+1
sn=""+n
var kclass=""
var ktitle=""
coord=coordOf(C,k)
if(k%3==0)s+="
"
}
}
if(thestyle.indexOf(":red")>=0)redlist+=C.showinfo //update for hint
s+="
"
s=""+s+""
s="
"+s+"
"
s=s.replace(/THESTYLE/,"")
return s//.replace(/\=0)return
var d = document.getElementById(id)
if (!d || document.getElementById("radtag0").checked)return
if (isin) {
if (!MouseColor[id])MouseColor[id] = [d.style.backgroundColor,0]
thismouseid = id
setTimeout("colorCell('" + id + "')",1000)
} else {
thismouseid = ""
}
}
function colorCell(id) {
if (thismouseid != id || document.getElementById("radtag0").checked)return
var d = document.getElementById(id)
var color = MouseColor[id]
d.style.backgroundColor = (color[1] ? color[0] : document.getElementById("radtag1").checked ? "yellow" : "purple")
color[1] = 1-color[1]
}
function clearMouseColors() {
for (id in MouseColor) {
var d = document.getElementById(id)
var color = MouseColor[id]
if (color[1] && d){
d.style.backgroundColor = color[0]
color[1] = 1-color[1]
}
}
}
function setMouseColor(isSet) {
if (document.getElementById("radtag0").checked) {
clearMouseColor()
return
}
for (id in MouseColor) {
var d = document.getElementById(id)
var color = MouseColor[id]
if (!d)continue
if (d.style.backgroundColor == (document.getElementById("radtag1").checked ? "yellow" : "purple")){
d.style.backgroundColor = color[0]
color[1] = 1-color[1]
var S = id.split("_")
var i = parseInt(S[1])
var j = parseInt(S[2])
var n = parseInt(S[4])
var P
if (isSet) {
Data[i][j].N=n
} else if (xNum(P=Possible.XCell[i][j])==2) {
n = xFirst(P & ~Pwr2[n-1]) + 1
Data[i][j].N=n
}
}
}
createTable(1)
getNextStep(0)
}
function getCheckBoxOptions() {
s=""
if (igetalmostlockedx && igetalmostlockedy && igetalmostlockedb) {
s += "ALS&"
} else {
if (igetalmostlockedx)s+="ALSX"
if (igetalmostlockedy)s+="ALSY"
if (igetalmostlockedb)s+="ALSB"
}
s += (!isalsfull ? "&noalsfull&" : "")
s += (isalsv2 ? "&alsv2&" : "")
if(!idoglyphs)s+="&NOGLYPHS"
s+= (isjustycycles?"YCYCLESONLY&":ijustcolor?"COLORONLY&":"")
return (s ? "SHH" + s : "")
}
function getMarkLink(text,T,options, asJS, base){
var t = getCompressedMarks(T);
if (!t)return ""
var s = (base? base : baseRef)+"?" + getCheckBoxOptions()+t+(options?"&"+options : "")
if(asJS)
s="\"javascript:docOpen('"+s+"')\""
else
s="\""+s+"\" target=_blank"
return ""+text+""
}
function getCompressedMarks(T) {
if(!T){
if (TableRef.length){
TableRef=[]
getTableRef(TableRef)
}
T=TableRef
}
var t=compressMarks(T)
return (t ? "MARKS="+t.replace(/\[/g,".").replace(/\]/g,";") : "")
}
function getNumericalTable(S,ch0,ch1,coord,isplain){
var s=""
var st=""
var row1=""
var row2=""
var ch=""
var n=0
var T=[[],[],[],[],[],[],[],[],[]]
var C=[5,5,5,5,5,5,5,5,5]
var r=0
var ch2="xxx"
var ischaintable=0
for(var i=0;i<9;i++){
for(var j=0;j<9;j++){
row1=""
row2=""
for(var k=0;k<9;k++){
ch=S[k+j*9+i*81]
if(!ch)ch=""
if(ch==""){
}else if("123456789".indexOf(ch)>=0){
row1+=ch
row2+=" "
}else{
row1+=(k+1)
if(coordOf(Data[i][j],k)==coord){
ch2=ch
ch="*"
}
row2+=ch
ischaintable=1
}
}
if(row1.length>C[j])C[j]=row1.length
T[i][j]=[row1,row2]
}
}
for(var j=0;j<9;j++){
st+="+-----------------".substring(0,C[j]+3)
if(j==2||j==5)st+="+"
}
s=" "+st
for(var j=0;j<9;j++)s=s.replace(/\+\-\-\-\-\-/,"|---%"+(j+1))
s=s.replace(/\+/g,"|")
st=(isplain?"\n":" @")+"---"+st.replace(/\+\+/g,"||")
s+=st.replace(/\||\+/g,"-")
for(var i=0;i<9;i++){
s+=" @&"+(i+1)+" | "
for(var j=0;j<9;j++){
s+=" ".substring(0,C[j]-T[i][j][0].length)+T[i][j][0]
s+=(j==2||j==5?" || ":j==8?"":" | ")
}
if(ischaintable){
s+=" @ | "
for(var j=0;j<9;j++){
s+=" ".substring(0,C[j]-T[i][j][1].length)+T[i][j][1]
s+=(j==2||j==5?" || ":j==8?"":" | ")
}
}
s+=(i==2||i==5?st.replace(/\-|\+/g,"="):i==8?st.replace(/\||\+|\-/g,"."):st)
}
if(ch0){
r=new RegExp(ch0,"g")
s=s.replace(r,"!")
}
if(ch1){
r=new RegExp(ch1,"g")
s=s.replace(r,"#")
}
if(ch0)s=s.replace(/\!/g,""+ch0+"")
if(ch1)s=s.replace(/\#/g,""+ch1+"")
if(ch2)s=s.replace(/\*/,""+ch2+"")
s=s.replace(/\&/g,"r")
s=s.replace(/\%/g,"c")
s=s.replace(/\@/g,"\n")
if(!isplain)s=s.replace(/(\ \d\ )/g,"$1")
return s
}
function getPuzzleFromMarks(T){
var s=""
var sout=""
for(var i=0;i<9;i++)for(var j=0;j<9;j++){
s=""
var isneg=false
for(var k=0;k<9;k++){
var n=T[k+j*9+i*81]
if(n)s+=(k+1)
if(n<0)isneg=true
}
if(s.length==1)sout+=(isneg?"-":"")+s
sout+=","
}
return sout.substring(0,sout.length-1)
}
function getRef(isformatted,nformat,ishtml){
if(!nformat)nformat=numberformat
var Ref=[]
var s=""
var scell=""
var isinit=1
if(!ishtml)ishtml=0
if(isdemo){
for(var i=0;i<9;i++)for(var j=0;j<9;j++){
scell="["+(i+1)+","+(j+1)+":"
if(Data[i][j].N){
s+=scell+Data[i][j].N+"]"
}else{
for(var k=0;k<9;k++){
if(Data[i][j].Allowed[k])scell+=","+(k+1)
}
scell=scell.replace(/\:\,/g,":")+"]"
if(scell.indexOf(":]")<0)s+=scell
}
}
return ["DEMO="+s]
}else if(isformatted){
if(nformat==NUMMARKSENCODED){
return encodeMarks(getTableRef(Ref))
}
if(nformat==NUMSDK){
if(!ihavemarks)showMarks(true)
s+="[Puzzle]\n"
for(var i=0;i<9;i++){
for(var j=0;j<9;j++){
s+=(Data[i][j].N && Data[i][j].fixed?Data[i][j].N:".")
}
s+="\n"
}
s+="[State]\n"
for(var i=0;i<9;i++){
for(var j=0;j<9;j++){
s+=(Data[i][j].N?Data[i][j].N:".")
}
s+="\n"
}
s+="[PencilMarks]\n"
for(var i=0;i<9;i++){
for(var j=0;j<9;j++){
s+=(j==0?"":",")
if(!Data[i][j].N)
for(var k=0;k<9;k++)
if (Data[i][j].Allowed[k])s+=(k+1)
}
s+="\n"
}
return s
}
if(nformat==NUMMARKS){
s=""
for(var i=0;i<9;i++)for(var j=0;j<9;j++)s+="," + marksForCell(i,j,1)
return s.substring(1)
}
if(nformat==NUMMARKSFIXED){
s=""
for(var i=0;i<9;i++)for(var j=0;j<9;j++)s+="," + marksForCell(i,j,-1)
return s.substring(1)
}
if(nformat==NUMTABLE||nformat==NUMCHAINTABLE){
if(!ihavemarks)showMarks(true)
getTableRef(Ref,nformat==NUMCHAINTABLE)
s=getNumericalTable(Ref,0,0,0,!ishtml)
s=(!ishtml||nformat!=NUMCHAINTABLE?"":StrongChains.length<2?"
There are no strong chains.
":"
Medusa Chain Compatibility Analysis
"+(StrongChains.length-1)+" strong chains are labeled A-"+ALPHABET.charAt((StrongChains.length-2)%26)+", with alternating parity shown using lowercase.
"+(ishowtimings?(new Date()):"")+" "
return s
}
for(var i=0;i<9;i++)for(var j=0;j<9;j++){
Ref[Ref.length]=(Data[i][j].fixed?-Data[i][j].N:Data[i][j].N?Data[i][j].N:"")
}
return Ref
}
function marksForCell(i,j,negateFixed){
if(Data[i][j].fixed)return Data[i][j].N * negateFixed
if(Data[i][j].N)return Data[i][j].N
var s=""
for(var k=0;k<9;k++)if (Data[i][j].Allowed[k])s+=(k+1)
if(s=="123456789")s=""
return s
}
function getTableRef(T,ischaintable,excludeimpossible){
var ch=""
var ichain=0
for(var i=0;i<9;i++)for(var j=0;j<9;j++)for( var k=0;k<9;k++){
if(Data[i][j].Allowed[k] && (excludeimpossible || (Possible.XCell[i][j]&Pwr2[k]) && !Data[i][j].Impossible[k]) && !T[k+j*9+i*81]){
ch=k+1
if(ischaintable&&!Data[i][j].N&&chainOf(i,j,k)){
ichain=chainOf(i,j,k)
if(Data[i][j].Parity[ichain])ch=chainCode(ichain,Data[i][j].Parity[ichain][k][0])
}
if(Data[i][j].N && (k+1)!=Data[i][j].N)ch=""
T[k+j*9+i*81]=ch
}
}
return T
}
function getValues(ifix){
var isopen=false
if(ifix)for(var i=0;i<9;i++)for(var j=0;j<9;j++)if(Data[i][j].N)Data[i][j].fixed=1
for(var i=0;i<9;i++)for(var j=0;j<9;j++)if(Data[i][j].isopen){
isopen=true
var v=getSudokuValue(i, j);
var val=parseInt(v);
if(isNaN(val))val=0
if(val>9){
var s=""
for(var k=0;k=0||v==""&&isdemo){ //for demos only
var S=v.split(",")
Data[i][j].Allowed=[0,0,0,0,0,0,0,0,0]
for(var p=0;p0 && v<=9)
Data[i][j].Allowed[v-1]=v
}
if (!isdemo){
for(var p=0;p<9;p++)
if (!Data[i][j].Allowed[p])userdisallowslist+=coordOf(Data[i][j],p)
}
}else{
v=val
if(val<0 && ihaveset){
val=-val
if(val>9)val=0
if(val){
Data[i][j].Impossible[val-1]=val
userdisallowslist+=coordOf(Data[i][j],val-1)
}
}else{
if(val<0 || val>9)val=0
Data[i][j].N=val
}
Data[i][j].fixed=(v!=0 && !ihaveset)
}
Data[i][j].isopen=0
}
return isopen && userdisallowslist!=""
}
function loadMarks(s, doclear){
var T=uncompressMarks(s)
LinearData=getPuzzleFromMarks(T).split(",")
setData()
setMarks(T)
var x = 0
userdisallowslist=""
for(var i=0;i<9;i++)for(var j=0;j<9;j++)if(!Data[i][j].fixed)
for(var k=0;k<9;k++)
if(!Data[i][j].Allowed[k])userdisallowslist+=coordOf(Data[i][j],k)
if(doclear)clearDivs()
getNextStep(1,0,1,1)
ihavechecked=1
}
function loadSnapShot(i){
i = parseInt(""+i)
if(!isNaN(i))loadMarks(compressMarks(SnapShot[i]),false)
if(thisLogMessage!= "")logMessage(thisLogMessage)
}
function loadSelectBox(sblock,isarray,thisone){
if (thisone && thisone.indexOf("?") == 0)thisone=thisone.substring(1)
var n = 0;
var sout="Load Selected"
+" Solve"
+" Standard View"
+" Automatic Run"
+" Show Run Log"
+" Stop Run"
+"
"
setSelectBox(sout);
if (thisone)doLoadSelection(parseInt(thisone))
}
function saveRef(info){
var T=[]
getTableRef(T)
var t=compressMarks(T)
if(RefList.length==0||RefList[RefList.length-1]!=t)RefList[RefList.length]=t
showStepSelect(t)
}
function showDemo(sdemo){
var S=sdemo.replace(/\,\[/g,"[").replace(/(\]|\})/g,"").split("[")
var C=[]
var RC=[]
var V=[]
var D={}
isdemo=1
LinearData=new Array()
setData()
initPossible()
for(var i=0;i<9;i++)for(var j=0;j<9;j++){
Data[i][j].N=0
Data[i][j].Allowed=[0,0,0,0,0,0,0,0,0]
}
for(var i=1;i= 0) {
sblock = sblock.substring(sblock.indexOf("?") + 1)
sblock = sblock.substring(sblock.indexOf("=") + 1).split("&")[0]
}
if(sblock.indexOf(".")>=0)sblock.replace(/\-\-\-\-\-\-\-\-\-\-\-\n/g,"")
if(sblock.indexOf("-c1-")>=0||sblock.indexOf("----------------+----------------")>=0){ //table
sblock=sblock.replace(/\*/g," ")
sblock=sblock.replace(/\n/g," \n")
sblock=sblock.replace(/0/g," 123456789 ")
sblock=sblock.replace(/r\d/g,"").replace(/c\d/g,"").replace(/[a-z]|[A-Z]/g,"")
sblock=sblock.replace(/ (\d+) /g," ,[$1] ")
sblock=sblock.replace(/ (\d+) /g," ,[$1] ")//in case nnn mmm
sblock=sblock.replace(/\](\d)/g,"],$1")
sblock="["+sblock+"]"
sblock=sblock.replace(/\.|\-|\+|\||\¦|\s|\=/g,"").replace(/\[\,/g,"[")
return sblock
}
if(sblock.indexOf("----")>=0)sblock=sblock.replace(/(\-|\+)/g,"")
if(sblock.indexOf("-+")>=0)sblock=sblock.replace(/(\-|\+)/g,"")
sblock=sblock.replace(/(\-|\?|\.|\_)/g,"0")
if(sblock.indexOf("\t")>=0){
sblock=sblock.replace(/\t/g,"0")
}
if(sblock.indexOf(",")>=0)
return "[" + sblock+"]"
}
sblock=sblock.replace(/\D/g,"")
if(sblock.length>81 && sblock.length%81==0)loadSelectBox(sblock,0)
for(var i=0;i=0){
sout+=s
sout+=","
}else{
sout+=","
}
}
return sout
}
function uncompressMarks(s){
if (s.charAt(0) == "$")return uncompressMarks(decodeMarks(s))
var S=[]
var T=[]
var s2=""
s=s.replace(/\./g,"[").replace(/\;/g,"]").replace(/\](\d)/g,"],$1")
if (s.indexOf("[") < 0)s="[" + s + "]"
try{
S=eval(s)
for(var i=0;i 9){
s=S[i]+""
s2=""
for(var j=0;jexact cover examples."
s+="
3D Medusa, as all techniques, follows these connections to relatively simple logical inconsistencies. Hypothesis and (dis)proof goes further, looking for inconsistencies deeper along the solution. "
s+="
An alternative, more efficient algorithm, the Dancing Links Algorithm (DLX), uses a clever and very efficient computational process of reversibly doubly-linked data structures to explore all possible solutions of a puzzle through brute-force trial and error. DLX is the method of choice for rapid finding of all possible solutions to Sudoku puzzles."
s+=""
s+="
"
s+=" cell constraints (only one of value in each of 81 cells)------------------------- row constraints (only one of 1-9 in each of 9 rows)------------------------------ column constraints (only one of 1-9 in each of 9 columns------------------------- block constraints (only one of 1-9 in each of 9 blocks)--------------------------\n"
s+=" 0 1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8 9 1 2 3 4 5 6 7 8 9 1 2 3 4 5 6 7 8 9 \n"
s+=" 123456789012345678901234567890123456789012345678901234567890123456789012345678901 123456789123456789123456789123456789123456789123456789123456789123456789123456789 123456789123456789123456789123456789123456789123456789123456789123456789123456789 123456789123456789123456789123456789123456789123456789123456789123456789123456789\n"
s+="\n"
s+="cand/N "
S.push(s);s=""
for(var ii=0;ii<9;ii++)for(var jj=0;jj<9;jj++)s+=xNumP(Possible.XCell[ii][jj])
s+=" "
for(var ii=0;ii<9;ii++)for(var jj=0;jj<9;jj++)s+=xNumP(Possible.XRow[ii][jj])
s+=" "
for(var ii=0;ii<9;ii++)for(var jj=0;jj<9;jj++)s+=xNumP(Possible.XCol[ii][jj])
s+=" "
for(var ii=0;ii<9;ii++)for(var jj=0;jj<9;jj++)s+=xNumP(Possible.XBlock[ii][jj])
s+=" "
s+="\n"
S.push(s);s=""
//r1c1#1 o |o |o |o x
for(var i=0;i<9;i++)for(j=0;j<9;j++){
for(k=0;k<9;k++){
coord=coordOf(Data[i][j],k)
if(Data[i][j].N==k+1)coord=""+coord+""
s+=coord+" "
for(var ii=0;ii<9;ii++)for(var jj=0;jj<9;jj++)s+=(i==ii && j==jj &&(Possible.XCell[i][j]&Pwr2[k])?(Data[i][j].N==k+1?""+(k+1)+"":k+1):" ")
s+="|"
for(var ii=0;ii<9;ii++)for(var jj=0;jj<9;jj++)s+=(i==ii && k==jj &&(Possible.XCell[i][j]&Pwr2[k])?(Data[i][j].N==k+1?""+(k+1)+"":k+1):" ")
s+="|"
for(var ii=0;ii<9;ii++)for(var jj=0;jj<9;jj++)s+=(j==ii && k==jj &&(Possible.XCell[i][j]&Pwr2[k])?(Data[i][j].N==k+1?""+(k+1)+"":k+1):" ")
s+="|"
for(var ii=0;ii<9;ii++)for(var jj=0;jj<9;jj++)s+=(Data[i][j].block==ii && k==jj &&(Possible.XCell[i][j]&Pwr2[k])?(Data[i][j].N==k+1?""+(k+1)+"":k+1):" ")
s+="|"
s+="\n"
S.push(s);s=""
}
s+="----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------\n"
}
s+="
"
S.push(s)
return S.join("")
}
function getRuud(){
var s=""
var i=0
var k=0
s+="
Unresolved Possibilities Table
"
s+="This table is really four tables in one.
On the left we have Rows (by col). This table is a depiction of the current state of the puzzle row by row, column by column."
s+=" The cells are listed by row and column number. This is basically what you see if you use 3D View and select a specific row. "
s+=" For each of the 81 cells, all remaining candidates are listed vertically."
s+=" (If no number is shown for a given cell, it means that number has been assigned as is no longer possible anywhere else.)"
s+=" On this table you may see naked and hidden singles, pairs, triples, and the like."
s+="
The next two tables, Columns (by row) and Blocks (by cell), list the same information for specific columns and blocks."
s+="
The last table, Digits (by col), is organized by candidate value. It is what people generally use for coloring analysis. In it you may see singles, X-Wings, Swordfish, and the like."
s+="
When all tables are blank, no more constraints remain to be fulfilled, and the puzzle is solved."
s+="
"
s+="
"
s+="
Rows (by col)
123456789
Columns (by row)
123456789
Blocks (by cell)
123456789
Digits (by col)
123456789
"
for(var ii=0;ii<9;ii++){
s+="
"
i=ii
s+="
Row "+(i+1)+"
"
//cells: ii is i here; my XCell[i][j] is a ROW on this table
s+="
"
s+=" based on an idea of Ruud van der Werf"
return s
}
/*
[Puzzle]
19.342..5
..5....3.
......2.9
.....5..4
...1.4...
7..6.....
9.8......
.2....1..
3..921.68
[State] (optional)
19.342..5
2.5.1943.
4.3...219
..12.5..4
..91.4.2.
7426...51
918....42
.2.4..19.
3.4921.68
[PencilMarks]
,,67,,,,678,78,
68,678,,78,68,678,67,,67
68,78,,578,56,67,,7,
68,36,,78,3789,,36789,78,
568,356,,,378,,3678,78,367
,38,,,389,38,389,8,3
,567,,57,356,367,357,7,37
56,,67,578,358,378,,7,37
,57,7,,,,57,,
*/
function readSDKdata(sdata){
sdata=sdata.substring(sdata.indexOf("[Puzzle]")).split("[Colo")[0]
var s=sdata.replace(/\[|\]/g,"|")
var S=s.split("|")
var puzzle=S[2].replace(/\n|\r|\ /g,"")
var state=(S.length < 6 ? puzzle : S[4].replace(/\n|\r|\ /g,""))
var Marks=S[S.length - 1].replace(/\n|\r|\ /g,",").split(",")
var sout="["
for (var i=0;i<81;i++){
sout+=","
if(puzzle.charAt(i)!="."){
sout+="[-"+puzzle.charAt(i)+"]"
}else if(state.charAt(i)!="."){
sout+="["+state.charAt(i)+"]"
}else if(Marks[i+1]!=""){
sout+="["
for(var j=0;j")
}
function logAddMessage(s,sinfo, ishow){
if(!iShowAnswers && !ishowdetail && !ishow)return
if(!idolog)return
if(typeof(s)=="object")s=" "+s.join(" ").replace(/\n/g," ")
if(sinfo)s=""+sinfo+": "+s
Msgs[Msgs.length] = s
}
function logMessage(s,iclear,isappend,fromWhere){
//alert("log "+iclear + " " + isappend + " from:" + fromWhere + "\n"+s)
if(!idolog)return
var d=document.getElementById("logmsg")
s = s.replace(/name\=/g,"href=")
if(iclear){
d.innerHTML=s
}else if(isappend){
d.innerHTML+=s
}else{
d.innerHTML=s+d.innerHTML
}
Msgs=[]
}
function showChainDiv(n, n2, ext,list) {
if (!ext)ext=""
if (!n2)n2=0
var d=document.getElementById("chains")
if (n < 0){
d.innerHTML=""
return
}
if (n2 > 0 || list) {
var s = ""
for(var i=1;i=0)
s += showChainDiv(i,-1,(i == n ? "" : "a"))
d.innerHTML = s
return
}
if (n2>=0)nY = 0
var List = []
for(var e=0;e2||Binfo.length>2){
//must be strong group
continue
}
var iA=Ainfo[1][0].row
var jA=Ainfo[1][0].col
var kA=Ainfo[0]
var bA=Ainfo[1][0].block
var ichain = chainOf(iA,jA,kA)
if(ichain!=n)continue
var iB=Binfo[1][0].row
var jB=Binfo[1][0].col
var kB=Binfo[0]
var bB=Binfo[1][0].block
if (iA==iB && jA==jB){
List.push(getClink(iA, jA, kA, kB,ext))
//same cell
} else if (iA==iB) {
//same row
if(kA==kB)
List[List.length]=getHlink(iA, Math.min(jA,jB),kA,Math.abs(jB-jA),ext)
} else if (jA==jB) {
//same col
if(kA==kB)
List[List.length]=getVlink(Math.min(iA,iB),jA,kA,Math.abs(iB-iA),ext)
} else if (bA==bB){
//same block
if(kA==kB)
List[List.length]=getBlink(Math.min(iA,iB),Math.min(jA,jB),kA,iB-iA,jB-jA,ext)
}
}
var s = List.join("")
if(n2<0)return s
d.innerHTML = s + (n2 > 0 ? showChainDiv(n2,-1,"a") : "")
}
var nY = 0
function testit(i,j,k) {
nY = 0;
var s = "
"
s += getHlink(i, j, k, 8,"");
s += getHlink(i+1, j, k, 7,"")
s += getHlink(i+2, j, k, 6,"")
s += getHlink(i+3, j, k, 5,"")
s += getHlink(i+4, j, k, 4,"")
s += getHlink(i+5, j, k, 3,"")
s += getHlink(i+6, j, k, 2,"")
s += getHlink(i+7, j, k, 1,"")
s += getHlink(i+8, j+2, k, 2,"")
s += getVlink(i, j, k, 8,"")
s += getVlink(i, j+1, k, 7,"")
s += getVlink(i, j+2, k, 6,"")
s += getVlink(i, j+3, k, 5,"")
s += getVlink(i, j+4, k, 4,"")
s += getVlink(i, j+5, k, 3,"")
s += getVlink(i, j+6, k, 2,"")
s += getVlink(i, j+7, k, 1,"")
s += getVlink(i+2, j+8, k, 2,"")
s += "
"
var d = document.getElementById("chains")
d.innerHTML=s
}
Vheights=[80,134,185,238,295,350,404,461]
function getVlink(i,j,k,n,ext){
return getLink(i,j,k,53,Vheights[n-1],n,0,-2+k%3,-491+2,ext)
}
function getHlink(i,j,k,n,ext){
return getLink(i,j,k,Vheights[n-1],53,0,n,4,-510,ext)
}
function getBlink(i,j,k,n1,n2,ext){
if(n2 < 0){
n2 = -n2
n1 = -n1
}
var w=(n2 == 1 ? 80 : 134)
var h=(n1 == 1 || n1 == -1 ? 80 : 134)
return getLink(i,j,k,w,h,n1,n2,4,-492,ext)
}
function getClink(i,j,k1,k2,ext){
var kj1 = k1%3
var kj2 = k2%3
var ki1 = (k1-kj1)/3
var ki2 = (k2-kj2)/3
var n1 = ki2-ki1
var n2 = kj2-kj1
if(n2 < 0){
n2 = -n2
n1 = -n1
}
if(n2 == 0)n1=Math.abs(n1)
var k = Math.min(ki1,ki2)*3 + Math.min(kj1, kj2)
return getLink(i,j,k,47,50,"0"+n1,n2,7,-487,ext)
}
function getLink(i,j,k,w,h,n1,n2,x0,y0,ext){
var x = (j) * 53 + (j-j%3)/3 + k%3 * 13 + x0 +2
var y = (i) * 53 + (i-i%3)/3 + (k-k%3)/3 * 13 +y0 - getYAdjust() - nY + 2
nY += h
return "
"
}
function encodeMarks(T){
var s="$"
for(var i=0;i<9;i++)for(var j=0;j<9;j++){
if(Data[i][j].fixed){
s+=-Data[i][j].N
continue
}
var n = 0
var p1 = 0
var p2 = 0
var k1 = -1
var s1 = ""
var s2 = ""
for(var k=4;k<9;k++)if(T[k+j*9+i*81]){
n++
p2 |= Pwr2[k-4]
k1 = k
}
var s2 = (n > 0 ? encodingList.charAt(p2 + 32) : "")
for(var k=0;k<4;k++)if(T[k+j*9+i*81]){
n++
p1 = p1 | Pwr2[k]
k1 = k
}
var ch
switch(n){
case 0: ch="@";break
case 1: ch=(k1+1);break
case 9: ch="P";break
default:
ch=(p1 > 0 ? encodingList.charAt(p1 + (s2 ? 16 : 0)): "") + s2
}
s += ch
}
return s
}
var encodingList="@ABCDEFGHIJKLMNOPQRSTUVWXYZ[+],_`abcdefghijklmnopqrstuvwxyz{(})."
// P == all possible;
// @ == none possible
// 41...........4F // 1-4, none higher
// 51...........5F // 1-4, also higher
// 5-9
// 61...........................7F;
function decodeMarks(s) {
var sout = ""
for (var i = 1; i < s.length; i++){
var ch = s.charAt(i)
sout +=","
if (ch == "-") {
sout += ch + s.charAt(++i)
continue
}
var pt1 = encodingList.indexOf(ch)
if (pt1 == 16) {
pt1 = 0x1FF
} else if (pt1 > 32) {
pt1 = pt1 << 4
} else if (pt1 > 16) {
pt1 += (encodingList.indexOf(s.charAt(++i)) << 4) - 16
}
if (pt1 < 0) {
sout += ch
continue
}
for(var k=0;k<9;k++)if(pt1 & Pwr2[k])sout+=(k+1)
}
return sout.substring(1)
}
function getGlyphTable() {
var s = "
"
if(idoglyphs) {
for (var n = 1; n <= 9; n++)s +="
")
}
S.push("")
}
S.push("")
return S.join("")
}
function setGlyphs(doshow) {
if(!idoglyphs)return
resetGlyphs()
for (var k = 0; k < 9; k++)setGlyph(k, doshow)
}
function setGlyph(k,doshow) {
var g = Glyphs[k]
var id = k*1000
var bp
for (var i = 0; i < 3; i++) {
for (var j = 0; j < 3; j++) {
var b = i * 3 + j
var gr = i * 6
var col = (b%2 ? "#A0A0A0" : "white")
for (var r = 0; r < 6; r++) {
var gc = j * 6
for (var c = 0; c < 6; c++) {
var iscell = (r%2 == 0 && c%2 == 0)
var isone = (iscell && Blocks[b][bp=(r/2)*3 + c/2].onlypossible == k + 1)
var isk = (iscell && !isone && (Possible.XBlock[b][k] & Pwr2[bp]))
var x = (!doshow || (g[gr] & Pwr2[gc++]) == 0 ? col : isone ? "red" : isk ? "green" : "black")
id++
document.getElementById("gt" + id).style.backgroundColor = x
//document.getElementById("gi" + id).src = x + ".gif"
}
gr++
}
}
}
}
![]("+n1+""+n2+ext+".gif)
