|
[x]
Posted via EE Mobile
|
||
Search, ask, and monitor your questions on the go with EE Mobile. Visit Experts Exchange from your mobile device and never be out of touch again. |
||
| Question |
|
[x]
Attachment Details
|
||
|
[x]
The Solution Rating System
|
||
With so many solutions, how can you tell which solutions are most likely to help you and which ones are not? To provide you with a tool to use, we rate our solutions based on various elements that most accurately determine if a solution is a quality solution. To explain what factors affect the solution rating, here are the elements we take into consideration when formulating our solution rating.
Your Input Matters If you have any suggestions that you would like to make for our rating system, please ask a question in the Suggestions Zone of Community Support. Thank you! |
||
1: 2: 3: 4: 5: 6: 7: 8: 9: 10: 11: 12: 13: 14: 15: 16: 17: 18: 19: 20: 21: 22: 23: 24: 25: 26: 27: 28: 29: 30: 31: 32: 33: 34: 35: 36: 37: 38: 39: 40: 41: 42: 43: 44: 45: 46: 47: 48: 49: 50: 51: 52: 53: 54: 55: |
<PSEUDOCODE>
changed = false
for i in 1 to 9:
for j in 1 to 9:
value = board[i][j]
if value is not a singleton:
isum = UNION of board[k][j] for k in 1 to 9, where k ! = i
if isum is not all possibilities:
set board[i][j] to possibility not in isum
changed = true
jsum = UNION of board[i][k] for k in 1 to 9, where k!= j
if jsum is not all possibilities:
set board[i][j] to possibility not in jsum
changed = true
ksum = UNION of board[x][y] for each square in 3*3 square not including(i,j)
if ksum is not all possibilities:
set board[i][j] to possibility not in ksum
changed = true
endfor
endfor
<This is the semi C code I translated it to>
changed = false;
for(int i = 0; i<=9; i++){
for(int j = 0; j<=9; j++){
value = board[i][j];
if(!(singleton(board[i]))||(singleton(board[j]))){
isum = UNION of board[k][j] for k in 1 to 9, where k!=i
if(isum != 45){
board[i][j] = 45 - (isum + i); //To make sure that board != i and we get a # not in the array.
changed = true;
}
jsum = UNION of board[i][k] for k in 1 to 9, where k!=j
if(jsum != 45){
board[i][j] = 45 - (isum + j); //To make sure that board != j and we get a # not in the array.
changed = true;
}
ksum = UNION of board[x][y] for each square in 3*3 square not including (i,j)
if(ksum != 45){
board[i][j] = 45 - ksum; //To make sure we get a # not in the array.
changed = true;
}
}
}
|
Advertisement
| Hall of Fame |