Posted by dve83

Announcements | Last Post | |
---|---|---|

SoC Curricula | 09/30/2017 01:08PM | |

Demarcation or scoping of examinations and assessment | 02/13/2017 07:59AM | |

School of Computing Short Learning Programmes | 11/24/2014 08:37AM | |

Unisa contact information | 07/28/2011 01:28PM |

mmm, seems very quiet here...

question on the suduko:

they ask for the full state diagram, showing only legal states...

if I take the initial state as the 2x2 diagram they provide, and then try to draw out each possible legal state (one move at a time), im going to end up with the combination of the first 11 moves, each followed by a combination of the next 10 moves, 9, 8, 7. Hence a tree structure that has the same number of nodes in each branch... each of which will eventually get to the goal state...

Am I correct? or am i missing something here...

help would be appreciated, finding this kind of difficult.

Danie van Eeden

------------------------

question on the suduko:

they ask for the full state diagram, showing only legal states...

if I take the initial state as the 2x2 diagram they provide, and then try to draw out each possible legal state (one move at a time), im going to end up with the combination of the first 11 moves, each followed by a combination of the next 10 moves, 9, 8, 7. Hence a tree structure that has the same number of nodes in each branch... each of which will eventually get to the goal state...

Am I correct? or am i missing something here...

help would be appreciated, finding this kind of difficult.

Danie van Eeden

------------------------

Re: suduko February 21, 2011 11:43AM |
Registered: 11 years ago Posts: 239 Rating: 0 |

I haven't done this question yet, but I am a Suduko fan,

I don't think every possible move will reach the goal state. And at each stage there will be very few legal moves. As soon as you reach a fail move you stop that branch. So the tree shouldn't actually be all that big.

Anybody else? Come on!!!!! Some of you must be working on this by now and have some thoughts to share, right or wrong.

I don't think every possible move will reach the goal state. And at each stage there will be very few legal moves. As soon as you reach a fail move you stop that branch. So the tree shouldn't actually be all that big.

Anybody else? Come on!!!!! Some of you must be working on this by now and have some thoughts to share, right or wrong.

Re: suduko February 21, 2011 11:53AM |
Registered: 13 years ago Posts: 129 Rating: 1 |

Hi,

thx again for participating

see the thing is, they ask ONLY LEGAL moves to be shown in the state space.

thus

in based on that, we can never fail... hence we will never stop in a branch because of an illegal move. We will simply be entering all the legal moves in different combinations.. which to me sounds kind of silly.

Danie van Eeden

------------------------

thx again for participating

see the thing is, they ask ONLY LEGAL moves to be shown in the state space.

thus

As soon as you reach a fail move you stop that branch

in based on that, we can never fail... hence we will never stop in a branch because of an illegal move. We will simply be entering all the legal moves in different combinations.. which to me sounds kind of silly.

Danie van Eeden

------------------------

Re: suduko February 21, 2011 02:09PM |
Registered: 11 years ago Posts: 239 Rating: 0 |

Re: suduko February 22, 2011 04:57PM |
Registered: 8 years ago Posts: 25 Rating: 0 |

Re: suduko February 23, 2011 09:47PM |
Registered: 13 years ago Posts: 129 Rating: 1 |

Re: suduko February 23, 2011 10:00PM |
Registered: 13 years ago Posts: 129 Rating: 1 |

regarding the states

imagine the following

2 1 a b

4 c d e

f g h 4

i j 1 k

this is the initial state,

a possible next state would be

2 1 4 b

4 c d e

f g h 4

i j 1 k

where a = 4

OR even with a = 3 (nothing prohibits this, if this is your first choice - even though you might find it wrong later).

but seeing as though a=3 is NOT the correct state, a=4 is the only option (hence we should only show this state - this is what we are asked to do - to show only legal states)

if so, we could start at any of the possible 11 blank blocks, Enter the correct value, and then follow any of the remaining 10 blocks - entering the value. Then any of the remaining 9 blocks entering the correct value.

eg. two possible initial states

2 1 4 b

4 c d e

f g h 4

i j 1 k

2 1 a 3

4 c d e

f g h 4

i j 1 k

then a possible 2nd state

2 1 4 3

4 c d e

f g h 4

i j 1 k

which would overlap coming from one of the previous two.

Is this what we are aiming at? or am I mad?

Danie van Eeden

------------------------

imagine the following

2 1 a b

4 c d e

f g h 4

i j 1 k

this is the initial state,

a possible next state would be

2 1 4 b

4 c d e

f g h 4

i j 1 k

where a = 4

OR even with a = 3 (nothing prohibits this, if this is your first choice - even though you might find it wrong later).

but seeing as though a=3 is NOT the correct state, a=4 is the only option (hence we should only show this state - this is what we are asked to do - to show only legal states)

if so, we could start at any of the possible 11 blank blocks, Enter the correct value, and then follow any of the remaining 10 blocks - entering the value. Then any of the remaining 9 blocks entering the correct value.

eg. two possible initial states

2 1 4 b

4 c d e

f g h 4

i j 1 k

2 1 a 3

4 c d e

f g h 4

i j 1 k

then a possible 2nd state

2 1 4 3

4 c d e

f g h 4

i j 1 k

which would overlap coming from one of the previous two.

Is this what we are aiming at? or am I mad?

Danie van Eeden

------------------------

Re: suduko March 01, 2011 11:26AM |
Registered: 13 years ago Posts: 129 Rating: 1 |

spoken to the lecturer:

we are suppose to choose a method of solving this thing - not just start at a state and then try and figure out all possible states to follow that selection.

Hence, we choose to solve either LINE by LINE or ROW by ROW - also we are NOT to show any state that resolves to ILLEGAL. hence if you are to insert a 3 somewhere (and that 3 is going to cause it to be ILLEGAL), just skip everything down that path.

basically we are limiting our solution states - eg. by choosing row by row solution - you will have only two states in the first row that are legal. There after, the forst row is considered COMPLETE, then you start with row2.

My mistake was to fill in one value in ROW1, and then try and make up all possible choices in all other rows and columns thereafter. I ended up with 70 states (halfway through the combinations from the 2nd state) and then finally decided that I needed some advice

Danie van Eeden

------------------------

we are suppose to choose a method of solving this thing - not just start at a state and then try and figure out all possible states to follow that selection.

Hence, we choose to solve either LINE by LINE or ROW by ROW - also we are NOT to show any state that resolves to ILLEGAL. hence if you are to insert a 3 somewhere (and that 3 is going to cause it to be ILLEGAL), just skip everything down that path.

basically we are limiting our solution states - eg. by choosing row by row solution - you will have only two states in the first row that are legal. There after, the forst row is considered COMPLETE, then you start with row2.

My mistake was to fill in one value in ROW1, and then try and make up all possible choices in all other rows and columns thereafter. I ended up with 70 states (halfway through the combinations from the 2nd state) and then finally decided that I needed some advice

Danie van Eeden

------------------------

Re: suduko March 10, 2011 05:27PM |
Registered: 8 years ago Posts: 25 Rating: 0 |

Sorry, only registered users may post in this forum.