Need a java version of this mathematica code

up vote
-1
down vote

favorite

[https://www.wolframcloud.com/objects/paralesely/Published/a.nb][1]

I am researcher and I find difficulties in studying my research because of my reference paper is written in Mathematica ,Wolfarm language .
Can somebody help me in translating this code in order for me to trace well.
Thanks for your time.

[https://www.wolframcloud.com/objects/paralesely/Published/a.nb][1]

Timing[n=8;

board=Table[0,{i,n},{j,n}];

solutions={};

tt=0;tt1={};

For[i=1,i<=n,i++,

For[j=1,j<=n,j++,

If[board[[i,j]]==0,

board[[i,j]]=Q;

(*Row*)Table[If[k!=j,board[[i,k]]=board[[i,k]]+1],{k,1,n}];

(*Column*)Table[If[k!=i ,board[[k,j]]=board[[k,j]]+1],{k,1,n}];

(*lDiagonalLower======================*)

k=i+1;

l=j+1;

While[k!=n+1&&l!=n+1,board[[k,l]]=board[[k,l]]+1;k++;l++];

(  *rDiagonalLower======================*)

k=i+1;

l=j-1;

While[k<= n&&l>= 1,board[[k,l]]=board[[k,l]]+1;k++;l--];

(*====================================*)

];

];

If[i==n,

solution={};

 Table[If[MemberQ[board[[row]],Q],posQ=Position[board[[row]],Q][[1]] 

[[1]];AppendTo[solution,posQ];];,{row,n}]

  ;

 If[Length@solution==n,AppendTo[solutions,solution]];

 ];

 (*This part stops calculation after queen moved from last column to first 

  column in the first row*)

 If[tt==0,If[board[[1,n]]==Q,tt++]];

 If[tt==1&&board[[1,1]]==Q,Break];

 (*Backtracking Loop=======================*)

If[i==n,

test=True;

While[test,

If[MemberQ[board[[i]],Q],

pos=Position[board[[i]],Q][[1]][[1]];

board[[i,pos]]=0;

j=pos;

(*Row*)Table[If[k!=j,board[[i,k]]=board[[i,k]]-1],{k,1,n}];

(*Column*)Table[If[k!=i ,board[[k,j]]=board[[k,j]]-1],{k,1,n}];

(*lDiagonalLower======================*)

k=i+1;

l=j+1;

While[k!=n+1&&l!=n+1,board[[k,l]]=board[[k,l]]-1;k++;l++];

(*rDiagonalLower======================*)

k=i+1;

l=j-1;

While[k<= n&&l>= 1,board[[k,l]]=board[[k,l]]-1;k++;l--];

(*====================================*)

Table[ If[board[[i,iter]]==0,

board[[i,iter]]=Q;

j=iter;

(*Row*)Table[If[k!=j,board[[i,k]]=board[[i,k]]+1],{k,1,n}];

(*Column*)Table[If[k!=i ,board[[k,j]]=board[[k,j]]+1],{k,1,n}];

(*lDiagonalLower======================*)

k=i+1;

l=j+1;

While[k!=n+1&&l!=n+1,board[[k,l]]=board[[k,l]]+1;k++;l++];

(*rDiagonalLower======================*)

k=i+1;

l=j-1;

While[k<= n&&l>= 1,board[[k,l]]=board[[k,l]]+1;k++;l--];

(*====================================*)

test=False;

];,{iter,pos+1,n}];

i--; If[i==0,Break];

,i--;If[i==0,Break];

];If[i==0,Break];

];

];

];

asked 12 mins ago

Thuriya Thwin

New contributor

Please read the on-topic and How to Ask pages before posting on a Stack Exchange site.
– janos
22 secs ago

add a comment |

up vote
-1
down vote

favorite

[https://www.wolframcloud.com/objects/paralesely/Published/a.nb][1]

[https://www.wolframcloud.com/objects/paralesely/Published/a.nb][1]

Timing[n=8;

board=Table[0,{i,n},{j,n}];

solutions={};

tt=0;tt1={};

For[i=1,i<=n,i++,

For[j=1,j<=n,j++,

If[board[[i,j]]==0,

board[[i,j]]=Q;

(*Row*)Table[If[k!=j,board[[i,k]]=board[[i,k]]+1],{k,1,n}];

(*Column*)Table[If[k!=i ,board[[k,j]]=board[[k,j]]+1],{k,1,n}];

(*lDiagonalLower======================*)

k=i+1;

l=j+1;

While[k!=n+1&&l!=n+1,board[[k,l]]=board[[k,l]]+1;k++;l++];

(  *rDiagonalLower======================*)

k=i+1;

l=j-1;

While[k<= n&&l>= 1,board[[k,l]]=board[[k,l]]+1;k++;l--];

(*====================================*)

];

];

If[i==n,

solution={};

 Table[If[MemberQ[board[[row]],Q],posQ=Position[board[[row]],Q][[1]] 

[[1]];AppendTo[solution,posQ];];,{row,n}]

  ;

 If[Length@solution==n,AppendTo[solutions,solution]];

 ];

 (*This part stops calculation after queen moved from last column to first 

  column in the first row*)

 If[tt==0,If[board[[1,n]]==Q,tt++]];

 If[tt==1&&board[[1,1]]==Q,Break];

 (*Backtracking Loop=======================*)

If[i==n,

test=True;

While[test,

If[MemberQ[board[[i]],Q],

pos=Position[board[[i]],Q][[1]][[1]];

board[[i,pos]]=0;

j=pos;

(*Row*)Table[If[k!=j,board[[i,k]]=board[[i,k]]-1],{k,1,n}];

(*Column*)Table[If[k!=i ,board[[k,j]]=board[[k,j]]-1],{k,1,n}];

(*lDiagonalLower======================*)

k=i+1;

l=j+1;

While[k!=n+1&&l!=n+1,board[[k,l]]=board[[k,l]]-1;k++;l++];

(*rDiagonalLower======================*)

k=i+1;

l=j-1;

While[k<= n&&l>= 1,board[[k,l]]=board[[k,l]]-1;k++;l--];

(*====================================*)

Table[ If[board[[i,iter]]==0,

board[[i,iter]]=Q;

j=iter;

(*Row*)Table[If[k!=j,board[[i,k]]=board[[i,k]]+1],{k,1,n}];

(*Column*)Table[If[k!=i ,board[[k,j]]=board[[k,j]]+1],{k,1,n}];

(*lDiagonalLower======================*)

k=i+1;

l=j+1;

While[k!=n+1&&l!=n+1,board[[k,l]]=board[[k,l]]+1;k++;l++];

(*rDiagonalLower======================*)

k=i+1;

l=j-1;

While[k<= n&&l>= 1,board[[k,l]]=board[[k,l]]+1;k++;l--];

(*====================================*)

test=False;

];,{iter,pos+1,n}];

i--; If[i==0,Break];

,i--;If[i==0,Break];

];If[i==0,Break];

];

];

];

asked 12 mins ago

Thuriya Thwin

New contributor

Please read the on-topic and How to Ask pages before posting on a Stack Exchange site.
– janos
22 secs ago

add a comment |

up vote
-1
down vote

favorite

[https://www.wolframcloud.com/objects/paralesely/Published/a.nb][1]

[https://www.wolframcloud.com/objects/paralesely/Published/a.nb][1]

Timing[n=8;

board=Table[0,{i,n},{j,n}];

solutions={};

tt=0;tt1={};

For[i=1,i<=n,i++,

For[j=1,j<=n,j++,

If[board[[i,j]]==0,

board[[i,j]]=Q;

(*Row*)Table[If[k!=j,board[[i,k]]=board[[i,k]]+1],{k,1,n}];

(*Column*)Table[If[k!=i ,board[[k,j]]=board[[k,j]]+1],{k,1,n}];

(*lDiagonalLower======================*)

k=i+1;

l=j+1;

While[k!=n+1&&l!=n+1,board[[k,l]]=board[[k,l]]+1;k++;l++];

(  *rDiagonalLower======================*)

k=i+1;

l=j-1;

While[k<= n&&l>= 1,board[[k,l]]=board[[k,l]]+1;k++;l--];

(*====================================*)

];

];

If[i==n,

solution={};

 Table[If[MemberQ[board[[row]],Q],posQ=Position[board[[row]],Q][[1]] 

[[1]];AppendTo[solution,posQ];];,{row,n}]

  ;

 If[Length@solution==n,AppendTo[solutions,solution]];

 ];

 (*This part stops calculation after queen moved from last column to first 

  column in the first row*)

 If[tt==0,If[board[[1,n]]==Q,tt++]];

 If[tt==1&&board[[1,1]]==Q,Break];

 (*Backtracking Loop=======================*)

If[i==n,

test=True;

While[test,

If[MemberQ[board[[i]],Q],

pos=Position[board[[i]],Q][[1]][[1]];

board[[i,pos]]=0;

j=pos;

(*Row*)Table[If[k!=j,board[[i,k]]=board[[i,k]]-1],{k,1,n}];

(*Column*)Table[If[k!=i ,board[[k,j]]=board[[k,j]]-1],{k,1,n}];

(*lDiagonalLower======================*)

k=i+1;

l=j+1;

While[k!=n+1&&l!=n+1,board[[k,l]]=board[[k,l]]-1;k++;l++];

(*rDiagonalLower======================*)

k=i+1;

l=j-1;

While[k<= n&&l>= 1,board[[k,l]]=board[[k,l]]-1;k++;l--];

(*====================================*)

Table[ If[board[[i,iter]]==0,

board[[i,iter]]=Q;

j=iter;

(*Row*)Table[If[k!=j,board[[i,k]]=board[[i,k]]+1],{k,1,n}];

(*Column*)Table[If[k!=i ,board[[k,j]]=board[[k,j]]+1],{k,1,n}];

(*lDiagonalLower======================*)

k=i+1;

l=j+1;

While[k!=n+1&&l!=n+1,board[[k,l]]=board[[k,l]]+1;k++;l++];

(*rDiagonalLower======================*)

k=i+1;

l=j-1;

While[k<= n&&l>= 1,board[[k,l]]=board[[k,l]]+1;k++;l--];

(*====================================*)

test=False;

];,{iter,pos+1,n}];

i--; If[i==0,Break];

,i--;If[i==0,Break];

];If[i==0,Break];

];

];

];

asked 12 mins ago

Thuriya Thwin

New contributor

[https://www.wolframcloud.com/objects/paralesely/Published/a.nb][1]

[https://www.wolframcloud.com/objects/paralesely/Published/a.nb][1]

Timing[n=8;

board=Table[0,{i,n},{j,n}];

solutions={};

tt=0;tt1={};

For[i=1,i<=n,i++,

For[j=1,j<=n,j++,

If[board[[i,j]]==0,

board[[i,j]]=Q;

(*Row*)Table[If[k!=j,board[[i,k]]=board[[i,k]]+1],{k,1,n}];

(*Column*)Table[If[k!=i ,board[[k,j]]=board[[k,j]]+1],{k,1,n}];

(*lDiagonalLower======================*)

k=i+1;

l=j+1;

While[k!=n+1&&l!=n+1,board[[k,l]]=board[[k,l]]+1;k++;l++];

(  *rDiagonalLower======================*)

k=i+1;

l=j-1;

While[k<= n&&l>= 1,board[[k,l]]=board[[k,l]]+1;k++;l--];

(*====================================*)

];

];

If[i==n,

solution={};

 Table[If[MemberQ[board[[row]],Q],posQ=Position[board[[row]],Q][[1]] 

[[1]];AppendTo[solution,posQ];];,{row,n}]

  ;

 If[Length@solution==n,AppendTo[solutions,solution]];

 ];

 (*This part stops calculation after queen moved from last column to first 

  column in the first row*)

 If[tt==0,If[board[[1,n]]==Q,tt++]];

 If[tt==1&&board[[1,1]]==Q,Break];

 (*Backtracking Loop=======================*)

If[i==n,

test=True;

While[test,

If[MemberQ[board[[i]],Q],

pos=Position[board[[i]],Q][[1]][[1]];

board[[i,pos]]=0;

j=pos;

(*Row*)Table[If[k!=j,board[[i,k]]=board[[i,k]]-1],{k,1,n}];

(*Column*)Table[If[k!=i ,board[[k,j]]=board[[k,j]]-1],{k,1,n}];

(*lDiagonalLower======================*)

k=i+1;

l=j+1;

While[k!=n+1&&l!=n+1,board[[k,l]]=board[[k,l]]-1;k++;l++];

(*rDiagonalLower======================*)

k=i+1;

l=j-1;

While[k<= n&&l>= 1,board[[k,l]]=board[[k,l]]-1;k++;l--];

(*====================================*)

Table[ If[board[[i,iter]]==0,

board[[i,iter]]=Q;

j=iter;

(*Row*)Table[If[k!=j,board[[i,k]]=board[[i,k]]+1],{k,1,n}];

(*Column*)Table[If[k!=i ,board[[k,j]]=board[[k,j]]+1],{k,1,n}];

(*lDiagonalLower======================*)

k=i+1;

l=j+1;

While[k!=n+1&&l!=n+1,board[[k,l]]=board[[k,l]]+1;k++;l++];

(*rDiagonalLower======================*)

k=i+1;

l=j-1;

While[k<= n&&l>= 1,board[[k,l]]=board[[k,l]]+1;k++;l--];

(*====================================*)

test=False;

];,{iter,pos+1,n}];

i--; If[i==0,Break];

,i--;If[i==0,Break];

];If[i==0,Break];

];

];

];

java wolfram-mathematica

asked 12 mins ago

Thuriya Thwin

New contributor

asked 12 mins ago

Thuriya Thwin

New contributor

asked 12 mins ago

Thuriya Thwin

New contributor

asked 12 mins ago

Thuriya Thwin

asked 12 mins ago

Thuriya Thwin

New contributor

Thuriya Thwin is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

Please read the on-topic and How to Ask pages before posting on a Stack Exchange site.
– janos
22 secs ago

add a comment |

Please read the on-topic and How to Ask pages before posting on a Stack Exchange site.
– janos
22 secs ago

Please read the on-topic and How to Ask pages before posting on a Stack Exchange site.
– janos
22 secs ago

add a comment |

active

oldest

votes

Your Answer

StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
});
});
}, "mathjax-editing");

StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "196"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});

}
});

Thuriya Thwin is a new contributor. Be nice, and check out our Code of Conduct.

draft saved

draft discarded

Sign up or log in

StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});

Post as a guest

Name

Required, but never shown

StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f209806%2fneed-a-java-version-of-this-mathematica-code%23new-answer', 'question_page');
}
);

Post as a guest

Name

Required, but never shown

active

oldest

votes

Thuriya Thwin is a new contributor. Be nice, and check out our Code of Conduct.

draft saved

draft discarded

Thuriya Thwin is a new contributor. Be nice, and check out our Code of Conduct.

Thanks for contributing an answer to Code Review Stack Exchange!

Please be sure to answer the question. Provide details and share your research!

But avoid …

Asking for help, clarification, or responding to other answers.

Making statements based on opinion; back them up with references or personal experience.

Use MathJax to format equations. MathJax reference.

To learn more, see our tips on writing great answers.

Some of your past answers have not been well-received, and you're in danger of being blocked from answering.

Please pay close attention to the following guidance:

Please be sure to answer the question. Provide details and share your research!

But avoid …

Asking for help, clarification, or responding to other answers.

Making statements based on opinion; back them up with references or personal experience.

To learn more, see our tips on writing great answers.

draft saved

draft discarded

Sign up or log in

StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});

Post as a guest

Name

Required, but never shown

Post as a guest

Name

Required, but never shown

Sign up or log in

StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});

Post as a guest

Name

Required, but never shown

Sign up or log in

StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});

Post as a guest

Name

Required, but never shown

Sign up or log in

StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});

Post as a guest

Name

Required, but never shown

Name

Required, but never shown

Name

Required, but never shown

This page is only for reference, If you need detailed information, please check here

搜尋此網誌

Krdytkyu