Graph representation is C algorithm
Im trying to implement a 'C' and 'SDL' (For the representation) algorithm to solve "Unblock Me" puzzle game.
For who never heard about the puzzle :
It's a board game where you have to move the Red Shape (Most of the time it's a box) out of the grid by moving other shapes of different dimensions.
Board exemple
Grid representation
I'm trying to solve the grid using both DFS (Depth First Search), and BFS (Breadth First Search), I do understand the algorithms.
I'm not looking for a code solution, I'm just looking for a documentation or someone who can explain me how can i use my grid representation with DFS or BFS, which i couldn't answer after searching on stackoverflow and similar websites.
I spent the last two days making research about BFS and DFS but i still can't answer some questions considering the previous given grid representation:
What are the nodes ?
What are the links ?
What's gonna be the adjacency matrix?
I appreciate any documentation link.
Some of documentation links which i did already read :
Adjacency List Adjacency Matrix BFS DFS
c graph-theory depth-first-search breadth-first-search
edited Nov 18 '18 at 23:41
Dominique Fortin
1,638816
asked Nov 18 '18 at 11:35
fel-hitafel-hita
34
add a comment |
Im trying to implement a 'C' and 'SDL' (For the representation) algorithm to solve "Unblock Me" puzzle game.
For who never heard about the puzzle :
It's a board game where you have to move the Red Shape (Most of the time it's a box) out of the grid by moving other shapes of different dimensions.
Board exemple
Grid representation
I'm trying to solve the grid using both DFS (Depth First Search), and BFS (Breadth First Search), I do understand the algorithms.
I'm not looking for a code solution, I'm just looking for a documentation or someone who can explain me how can i use my grid representation with DFS or BFS, which i couldn't answer after searching on stackoverflow and similar websites.
I spent the last two days making research about BFS and DFS but i still can't answer some questions considering the previous given grid representation:
What are the nodes ?
What are the links ?
What's gonna be the adjacency matrix?
I appreciate any documentation link.
Some of documentation links which i did already read :
Adjacency List Adjacency Matrix BFS DFS
c graph-theory depth-first-search breadth-first-search
edited Nov 18 '18 at 23:41
Dominique Fortin
1,638816
asked Nov 18 '18 at 11:35
fel-hitafel-hita
34
Post required information here to add clarity to this post.
– chux
Nov 18 '18 at 12:36
add a comment |
Im trying to implement a 'C' and 'SDL' (For the representation) algorithm to solve "Unblock Me" puzzle game.
For who never heard about the puzzle :
It's a board game where you have to move the Red Shape (Most of the time it's a box) out of the grid by moving other shapes of different dimensions.
Board exemple
Grid representation
I'm trying to solve the grid using both DFS (Depth First Search), and BFS (Breadth First Search), I do understand the algorithms.
I'm not looking for a code solution, I'm just looking for a documentation or someone who can explain me how can i use my grid representation with DFS or BFS, which i couldn't answer after searching on stackoverflow and similar websites.
I spent the last two days making research about BFS and DFS but i still can't answer some questions considering the previous given grid representation:
What are the nodes ?
What are the links ?
What's gonna be the adjacency matrix?
I appreciate any documentation link.
Some of documentation links which i did already read :
Adjacency List Adjacency Matrix BFS DFS
c graph-theory depth-first-search breadth-first-search
edited Nov 18 '18 at 23:41
Dominique Fortin
1,638816
asked Nov 18 '18 at 11:35
fel-hitafel-hita
34
Im trying to implement a 'C' and 'SDL' (For the representation) algorithm to solve "Unblock Me" puzzle game.
For who never heard about the puzzle :
It's a board game where you have to move the Red Shape (Most of the time it's a box) out of the grid by moving other shapes of different dimensions.
Board exemple
Grid representation
I'm trying to solve the grid using both DFS (Depth First Search), and BFS (Breadth First Search), I do understand the algorithms.
I'm not looking for a code solution, I'm just looking for a documentation or someone who can explain me how can i use my grid representation with DFS or BFS, which i couldn't answer after searching on stackoverflow and similar websites.
I spent the last two days making research about BFS and DFS but i still can't answer some questions considering the previous given grid representation:
What are the nodes ?
What are the links ?
What's gonna be the adjacency matrix?
I appreciate any documentation link.
Some of documentation links which i did already read :
Adjacency List Adjacency Matrix BFS DFS
c graph-theory depth-first-search breadth-first-search
c graph-theory depth-first-search breadth-first-search
edited Nov 18 '18 at 23:41
Dominique Fortin
1,638816
asked Nov 18 '18 at 11:35
fel-hitafel-hita
34
edited Nov 18 '18 at 23:41
Dominique Fortin
1,638816
asked Nov 18 '18 at 11:35
fel-hitafel-hita
34
edited Nov 18 '18 at 23:41
Dominique Fortin
1,638816
edited Nov 18 '18 at 23:41
Dominique Fortin
1,638816
edited Nov 18 '18 at 23:41
Dominique Fortin
1,638816
1,638816
asked Nov 18 '18 at 11:35
fel-hitafel-hita
34
asked Nov 18 '18 at 11:35
fel-hitafel-hita
34
asked Nov 18 '18 at 11:35
fel-hitafel-hita
34
34
Post required information here to add clarity to this post.
– chux
Nov 18 '18 at 12:36
add a comment |
Post required information here to add clarity to this post.
– chux
Nov 18 '18 at 12:36
Post required information here to add clarity to this post.
– chux
Nov 18 '18 at 12:36
Post required information here to add clarity to this post.
– chux
Nov 18 '18 at 12:36
add a comment |
1 Answer
1
active
oldest
votes
Each particular search problem may admit convenient specialised representations. But in theoretical terms, and that may be a good starting point, you can think of a "node" as a "board configuration", and an "edge connecting c1 to c2" as a "move transforming configuration c1 into c2".
answered Nov 18 '18 at 12:35
Jorge AdrianoJorge Adriano
2,220918
add a comment |
Your Answer
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: "1"
};
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',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
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
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53360408%2fgraph-representation-is-c-algorithm%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
Each particular search problem may admit convenient specialised representations. But in theoretical terms, and that may be a good starting point, you can think of a "node" as a "board configuration", and an "edge connecting c1 to c2" as a "move transforming configuration c1 into c2".
answered Nov 18 '18 at 12:35
Jorge AdrianoJorge Adriano
2,220918
add a comment |
Each particular search problem may admit convenient specialised representations. But in theoretical terms, and that may be a good starting point, you can think of a "node" as a "board configuration", and an "edge connecting c1 to c2" as a "move transforming configuration c1 into c2".
answered Nov 18 '18 at 12:35
Jorge AdrianoJorge Adriano
2,220918
add a comment |
Each particular search problem may admit convenient specialised representations. But in theoretical terms, and that may be a good starting point, you can think of a "node" as a "board configuration", and an "edge connecting c1 to c2" as a "move transforming configuration c1 into c2".
answered Nov 18 '18 at 12:35
Jorge AdrianoJorge Adriano
2,220918
Each particular search problem may admit convenient specialised representations. But in theoretical terms, and that may be a good starting point, you can think of a "node" as a "board configuration", and an "edge connecting c1 to c2" as a "move transforming configuration c1 into c2".
answered Nov 18 '18 at 12:35
Jorge AdrianoJorge Adriano
2,220918
answered Nov 18 '18 at 12:35
Jorge AdrianoJorge Adriano
2,220918
answered Nov 18 '18 at 12:35
Jorge AdrianoJorge Adriano
2,220918
answered Nov 18 '18 at 12:35
Jorge AdrianoJorge Adriano
2,220918
2,220918
add a comment |
add a comment |
Thanks for contributing an answer to Stack Overflow!
- 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.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53360408%2fgraph-representation-is-c-algorithm%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Post required information here to add clarity to this post.
– chux
Nov 18 '18 at 12:36