	[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.

The Grade of the Solution
The Zone Rank of the Expert Providing the Solution
The Number of Author and Expert Comments
The Number of Experts Contributing
The Feedback of the Community

Your Input Matters
Because of the way the system is set up, the most important variable in this equation is you. As a member of Experts Exchange, you are able to cast your vote on the quality of the solutions in regard to how complete, accurate, helpful and easy to understand each solution is. When you provide your feedback, each rating is adjusted accordingly. So, if you see a solution that has a poor rating that you think is a good solution, let us know by rating it. As you do, the rating will be adjusted and will become more accurate for other members of our site.

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!

6.8

sudoku in C

Asked by errang in C Programming Language

Tags: sudoku, C

Hey,

I got some pseudocode that I need to translate, I was just wondering if I could get some opinions to see if I got it right.

My main question is with the "UNION" part of this pseudocode... does it mean that they just want us to take the factorial of 9 to get the maximum value?

singleton is a function that returns true or false based on whether a bit is set.

This bit of code relies on a few other functions such as:
bit_count: This function takes an integer and returns the count of the
number of bits set.

get_nth_set_bit: This function takes an integer and an index; it iterates
through the bits of the integer (from LSB to MSB) counting set bits until
it comes to the indexth set bit. The current bit position is returned.

I got these functions figured out, and I know they work because they passed the tests.

Right now... I'm not 100% sure if I'm headed the right way, so some feedback on my translation would be appreciated =)

Thanks in advance!

View the Solution FREE for 30 Days

         
           
             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;
        }
 
    }
}

           
         

20091021-EE-VQP-81 - Hierarchy / EE_QW_3_20080625

Hall of Fame

1. Infinity08561,040
2. evilrix204,131
3. mrjoltcola187,564
4. jkr149,687
5. ozo134,525
6. itsmeandn...92,796
7. masheik68,342
8. pgnatyuk57,959
9. Kdo57,090
10. sunnycoder56,749
11. fridom50,492
12. Let_Me_Be49,246
13. DanRollins27,537
14. _phoenix_19,551
15. woolmilkp...18,264
16. jaime_oliv...17,134
17. lhl6016,254
18. trinitrotolu...15,372
19. abel15,296
20. Zoppo13,150
21. ikework12,814
22. ewest0212,750
23. duncan_roe12,564
24. Subrat2...12,163
25. flob912,150

1. Infinity081,715,300
2. sunnycoder1,090,983
3. jkr926,308
4. Kdo882,217
5. ozo600,952
6. evilrix415,261
7. grg99299,856
8. PaulCasw...299,635
9. itsmeandn...281,273
10. jaime_oliv...230,946
11. fridom225,588
12. mrjoltcola187,564
13. brettmjohn...182,528
14. ankuratvb157,866
15. imladris147,553
16. cwwkie129,383
17. Axter100,363
18. akshayxx96,671
19. josgood83,881
20. AlexViroc...70,328
21. gj6270,227
22. rbr69,997
23. masheik68,342
24. cup63,653
25. ssnkumar61,996

sudoku in C

Asked by errang in C Programming Language

Tags: sudoku, C

About this solution