Talk:Eight options with six sides - Revision history

Oscarlevin at 13:56, 29 December 2010

2010-12-29T13:56:38Z

← Older revision		Revision as of 07:56, 29 December 2010
Line 25:		Line 25:

	:: [[User:Zerrakhi\|Zerrakhi]] 21:40, 23 December 2010 (EST)		:: [[User:Zerrakhi\|Zerrakhi]] 21:40, 23 December 2010 (EST)

			::: Very good. I was definitely hoping for the second sort of answer - I've updated the puzzle to hopefully make that clearer. I always have trouble phrasing puzzles like this: the goal is to find methods using N rolls such that at the completion of the algorithm the task will be complete (here, a fair choice is made) and then minimize N over all such methods. That's just not all that poetic however.

			::: As for your solutions, your method (in the second case) is sound, however there are ways to get the number of rolls down lower than 3. It is possible to do with only one roll, although I admit the puzzle becomes more of a lateral thinking puzzle then. Think about the other sides of the die when you roll.
			::: [[User:Oscarlevin\|Oscar Levin]] 08:56, 29 December 2010 (EST)

2010-12-24T02:40:59Z

This seems too easy

@@ Line 1: / Line 1: @@
 == This seems too easy ==
-Determining the <i>least</i> number of rolls he <i>will</i> have to make is so trivial I wouldn't even call it a puzzle. Determining the <i>greatest</i> number of rolls he <i>may</i> have to make is a slightly less trivial, but still very simple. One can optimise either of these values or both of them. Perhaps one for [[:Category:Easy puzzles]]?
+Determining the <i>least</i> number of rolls he <i>will</i> have to make is so trivial I wouldn't even call it a puzzle. Determining the <i>greatest</i> number of rolls he <i>may</i> have to make is a slightly less trivial, but still very simple. One can optimise either of these values. Perhaps one for [[:Category:Easy puzzles]]?
 As far as I can tell, I'm not missing anything. [[User:Zerrakhi|Zerrakhi]] 03:43, 22 October 2010 (EDT)
 : Hmmm.  I'm not seeing this as easy.  Perhaps I am missing something.  That or I worded the question in an unclear way.  Could you tell me what you think the answer is?  That would help me understand what is going on here.  [[User:Oscarlevin|Oscarlevin]] 15:03, 18 November 2010 (EST)

2010-11-18T20:03:30Z

← Older revision		Revision as of 14:03, 18 November 2010
Line 4:		Line 4:

	As far as I can tell, I'm not missing anything. [[User:Zerrakhi\|Zerrakhi]] 03:43, 22 October 2010 (EDT)		As far as I can tell, I'm not missing anything. [[User:Zerrakhi\|Zerrakhi]] 03:43, 22 October 2010 (EDT)

			: Hmmm. I'm not seeing this as easy. Perhaps I am missing something. That or I worded the question in an unclear way. Could you tell me what you think the answer is? That would help me understand what is going on here. [[User:Oscarlevin\|Oscarlevin]] 15:03, 18 November 2010 (EST)