Is it a sin to give people puzzles that have no solution?
398890
NO> They all have solutions.\nOne is an eraser, the other is a delete button.
458431
look in the answers in the back of your puzzle book
99029
An answer may be to a problem, not just to a question.
1122124
Is this a joke or a riddle? I'm not sure how to answer this one.
1069858
Use your 'Check Spelling' button.  There is nothing worse than having a riddle that isn't worded properly.
86472
http://www.websudoku.com/\n\nYou can play online or print these. My wife and I like to do these -- we print two copies and then we both work the same puzzle... Ahem... I always finish first (go ahead and make the obvious joke).\n\nActually, she likes the printout larger, so I don't print them directly. Instead I print them to pdf (using free software like pdf995 or ghostscript) and then open them in PDF. I then select just the puzzle and tell Acrobat to print the current view, autosized to the paper. That way we get large copies of the puzzle.\n\nHave fun!
417082
Yes.  Sounds like a crazy, crazy puzzle that even Blaine himself never imagined someone would solve this quickly...\n\nFor the answer:\n\nhttp://thefoolsparadise.com/db/solution.htm\n\nAnd the story of the winner:\n\nhttp://thefoolsparadise.com/db/winners-tale.htm
145602
Aren't we supposed to answer the riddle?
300027
connect the dots games. They make puzzle books. Try a newstand.
217153
While it may appear to you that since life dows exist which in itself is a mystery, mankind relies upon logic. When he cannot reason out the answers, determain, a formula to exctact and solve questions, discover a sep by step sequince he is then lost. When we are confused by controversy and we cannot find a conventional means to resolve our questions we become lost and will not accept what is put before us.
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.
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.
557802
From Western tradition, puzzles called Magic Squares.  These are often as large as 8 X 8 and might take days to solve.
869995
I think this person is God....he fits perfectly into the riddle :)\n\nHope I get that money :D
362191
the answer is no cuz in the end of the riddle it asks you if u know the answer to the riddle and there is no answer...
480003
It's not just a question of puzzle logic, but also a question of people logic. It works like this.\n\nSince all 3 of the men raised their hand, they could all see at least one green dot. By this, they could all determine that there were at least 2 green dots. That's the puzzle logic part.\n\nFor the people logic, you have to remember that all three of the men were wise and probably came to the first conclusion immediately. However, they hesitated for a couple of seconds after their blindfolds were removed. This hesitation is important.\n\nThey all knew there were at least 2 green dots. So, if any of them could see a red dot, then he would have said immediately "I have a green dot". After all, if there must be two green dots and he (any of the wise men) could see only one, then he could easily conclude that the second green dot is on his own forehead.\n\nNone of them did that. They each saw 2 green dots which was the minimum amount that could be there according to the puzzle logic. So, they didn't know if the dot on their own forehead was green or red. Since they all hesitated, the one man who stood up concluded that the other two were having the same issue of seeing two green dots that he was. The only way that could happen was if all three dots were green.
29155
Sudoku puzzles are good at exercising your reasoning and pattern recognition skills.\n\nYou can even play onliine here:\nhttp://www.websudoku.com/