can u give me any possible algorithm for solving sudoku & the related websites?
475864
Wikipedia has lots of good details on Sudoku including manual algorithms for solving, as well as computer algorithms.  I wasn't sure which one you wanted.\n\nFor solving it yourself, the most obvious way to start it by eliminating rows and columns for a region until there is only one choice for where a digit goes.\n\nFor computer solving, there is the brute force depth-first search known as Ariadne's thread.  It essentially tries a solution and keeps going until it finds an inconsistency, then it backtracks.  Other methods follow the human style of solving by putting all possible numbers in each square and then eliminating them until there is only one choice.  This then cascades to affecting other squares, etc.
601270
I can do it... but let me think a little on it.  Can I take the full 4 months?  :-)\n\nOkay, I think I have a solution... took me about 5 minutes I think:\n\nIf I move the dot from B1 -> B2 and C1 -> C2, then B and C will still have 4 dots, and row four will still have 4 dots, but now row two will have 4 dots.\n\nYou didn't say they couldn't share the same square!!!!\n------------\nI'm back\n\nYou didn't exactly state what a "row" was.  I would have called that a "line" but maybe that's what you meant.\n\nOkay, I have a couple revised solutions.  A "row" is now defined as 4 dots that are colinear (on the same line) but each point must be distinct.  This invalidates my previous answer.\n\nOne solution matches with what has already been stated, which is:\nA4 --> B5  and  D4 --> C5.  This makes two pairs of overlapping lines each with 4 dots.\n\nHowever, my new solution is to take C1 and place it halfway between columns B and C and halfway between rows 2 and 3.\n\nThen you have a line on row 4, a line on column B, and two diagonal lines!!!!\n\nOne dot moved, 4 lines created!!!!\n\nAnd if you *must* move two dots, then just move B1 --> B5 and you still have a valid answer.
440185
Crosswords: http://www.crosskit.com/\nSudoku: http://www.websudoku.com/\nAll around: http://www.braingle.com/
182799
Sas will do it for you.\n\nHere is the article:\nhttp://support.sas.com/techsup/technote/ts498.html\n\nIf you know visual basic (and you can do this from excel using VBA) here is some code for generating combinations:\n\nhttp://www.codeguru.com/vb/gen/vb_misc/algorithms/article.php/c5607/
93141
Its obviously problem solving, because the whole sudoku is a big proble (puzzle). Its like a math problem. Therefore you need the problem solving skills (loogically)
626218
You can try these. \n\nhttp://www.soduko.org/sudoku-play-online.php\nhttp://gamehouse.com/onlinegames/?navnum=0\nhttp://games.yahoo.com/games/agl/goto?gn=gn_web&s=name&d=asc&p=1\nhttp://lol.com/\nwww.hi5.com\nhttp://www.howstuffworks.com/
191190
check out www.quickmath.com\n\nAlmost everything is there.
490862
6670903752021072936960\n\nThey wrote  an article that can be found here:\nhttp://www.afjarvis.staff.shef.ac.uk/sudoku/sudoku.pdf\n\nThere is also a whole dicussion on wheather symetrical Soduko puzzles are actually the same puzzle.
665615
Here you are:\nhttp://www.rhlschool.com/math.htm\nhttp://dmoz.org/Science/Math/Recreations/Games_and_Puzzles/\nhttp://www.riddles-online.com/maths-riddles.htm
453471
http://www.puzzlemaker.com/CrissCrossSetupForm.html
147281
It's usually a good idea to ask before printing someone else's material. If you're looking for a good regular sudoku site that allows you to use in a print source, try http://www.brainbashers.com/sudoku.asp. All he asks is that you use his copyright notice, and send him a copy of the first printing. The puzzles he creates are wonderful, and there's one out every day.
46941
" Fill in the grid so that every row,\nevery column, and every 3x3 box\ncontains the digits 1 through 9.\nRead this page:\nhttp://www.sudoku.com/
84916
Main article: Mathematics of Sudoku\n\nThe general problem of solving Sudoku puzzles on n2 x n2 boards of n x n blocks is known to be NP-complete [8]. This gives some indication of why Sudoku is difficult to solve, although on boards of finite size the problem is finite and can be solved by a deterministic finite automaton that knows the entire game tree.\n\nSolving Sudoku puzzles (as well as any other NP-hard problem) can be expressed as a graph colouring problem. The aim of the puzzle in its standard form is to construct a proper 9-colouring of a particular graph, given a partial 9-colouring. The graph in question has 81 vertices, one vertex for each cell of the grid. The vertices can be labelled with the ordered pairs (x,&#92;, y), where x and y are integers between 1 and 9. In this case, two distinct vertices labelled by (x,&#92;, y) and (x',&#92;, y') are joined by an edge if and only if:\n\n    * x = x'&#92;, or,\n    * y = y'&#92;, or,\n    * &#92;lceil x/3 &#92;rceil = &#92;lceil x'/3 &#92;rceil and &#92;lceil y/3 &#92;rceil = &#92;lceil y'/3 &#92;rceil\n\nThe puzzle is then completed by assigning an integer between 1 and 9 to each vertex, in such a way that vertices that are joined by an edge do not have the same integer assigned to them.\n\nA valid Sudoku solution grid is also a Latin square. There are significantly fewer valid Sudoku solution grids than Latin squares because Sudoku imposes the additional regional constraint. Nonetheless, the number of valid Sudoku solution grids for the standard 9×9 grid was calculated by Bertram Felgenhauer in 2005 to be 6,670,903,752,021,072,936,960 [9] (sequence A107739 in OEIS). This number is equal to 9! × 722 × 27 × 27,704,267,971, the last factor of which is prime. The result was derived through logic and brute force computation. The derivation of this result was considerably simplified by analysis provided by Frazer Jarvis and the figure has been confirmed independently by Ed Russell. Russell and Jarvis also showed that when symmetries were taken into account, there were 5,472,730,538 solutions [10] (sequence A109741 in OEIS). The number of valid Sudoku solution grids for the 16×16 derivation is not known.\n\nThe maximum number of givens that can be provided while still not rendering the solution unique is four short of a full grid; if two instances of two numbers each are missing and the cells they are to occupy form the corners of an orthogonal rectangle, and exactly two of these cells are within one region, there are two ways the numbers can be assigned. Since this applies to Latin squares in general, most variants of Sudoku have the same maximum. The inverse problem—the fewest givens that render a solution unique—is unsolved, although the lowest number yet found for the standard variation without a symmetry constraint is 17, a number of which have been found by Japanese puzzle enthusiasts [11] [12], and 18 with the givens in rotationally symmetric cells.
833281
Sudoku is a neat game of logic.  No math skills are needed other than recognizing the numbers 1 to 9, although there are more complicated versions now that use a grid larger than 9 x 9.  Games range from very easy to very difficult.  As with most games now, you can play on line if you choose.  It is VERY addicting!!  Here are a few links that might get you started if you want to learn to play Sudoku.  Also, check your local newspaper.  Many now carry a sudoku puzzle everyday.  Have fun!
23859
I run through the numbers from 1-9, looking at each to see where the constraints ensure that there is only one spot left to place an additional number.  To do this, realize that each row, each column and each block need exactly one of each number, so starting with 1, I look for combos with limited possibilities.\n\nIf the blocks 1,2 have a 1 in them, then 3 should be easy to find, look at blocks 6,9 to see if they have a 1, and mentally cross out the rows and columns that those 1's eliminate and see whats left.  Similary, if 2 and 6 have 1's in them try looking at blocks 5 and 3 for enough eliminated squares to ensure there is only one remaining spot for 1 in those blocks. Once you've tried all the possibilities for 1, move on to 2, and keep going until you've been through the whole list of numbers once without finding any new entries.\n\nFinally, a trick I really like, is when a block has only one row or one column with space remaining. You know that the remaining numbers in this mostly complete block will be in that row or column, and so you can use that information and apply it to other blocks even though you could not exactly place the numbers in the mostly complete block.\n\nHope that helps!
848509
http://mathworld.wolfram.com/johnsonsoli...
328609
Try this site:\n\nhttp://puzzlemaker.school.discovery.com/