# Tag Info

Accepted

### Deceptive dice game

You can make arbitrarily large sets of dice with this property. Start with Efron's dice: A: 4, 4, 4, 4, 0, 0 B: 3, 3, 3, 3, 3, 3 C: 6, 6, 2, 2, 2, 2 D: 5, 5, 5, 1, 1, 1 A beats B, B beats C, C ...
• 33.7k
Accepted

### How many tries to roll a 6?

The answer is indeed...             ...because the question is equivalent to...   Calculations:
• 21.9k

### How many tries to roll a 6?

This surprisingly beguiling puzzle may also be solved with a surprisingly unsophisticated approach. Symmetry, by itself, predicts the average length of evens-only sequences ending with 6 to ...
• 21.9k
Accepted

### How to simulate one die with three dice?

I believe this set of dice satisfies all your requirements:
• 147k
Accepted

### A Short Dice Puzzle

The answer is Proof Alternative proof
• 137k

### How to simulate one die with three dice?

@Deusovi's answer is totally correct, but I want to add here the general approach for solving such problems as well. No need to upvote, since I did not invent the technique, and you can see it ...
• 6,964
Accepted

• 7,282
Accepted

### Make 2 dice out of 3 dice

All addition is modulo 6 (e.g. 4 + 3 = 1, 3 + 3 = 6, 5 + 3 = 2, 6 + 1 = 1). 3 Dice Roll Resulting 2 Dice Roll Two same, one different: AAB AB 135 14 246 25 All same: AAA 36 Three in a row: A, A +...
• 32.5k
Accepted

### 8 dice with a product being a square

The only prime factors of the numbers 1 through 6 are 2, 3, and 5. Therefore the factorization of the numbers on the paper will only consist of these primes, i.e. they will be of the form:  2^a 3^b ...
• 18.9k

• 474
Accepted

### A dice game, what is the optimal strategy?

Strategy: Expectated gain: Conclusion:
• 4,992

### Fair d5 with as few faces as possible

Surely will suffice for all n > 2. Consider a symmetrical cone with an n-sided regular polygon as its base. If we take a "stubby" one (of a shortish height) and a "pointy" one (...
• 77.7k
Accepted

• 18.2k

### How many tries to roll a 6?

Let $X_n$ be the event that the dice takes $n$ rolls to get the first 6, given all the rolls are even. Let $A_n$ be the event that it takes $n$ rolls to get the first 6, and let $B$ be the event that ...
• 22k

### Three Dice minimum value

The answer is First I show that a lower number is not possible: This establishes a lower bound. The upper bound is established by providing an actual solution. First die: Second die: Third die: ...
• 1,287
Accepted

Easy:
• 35.6k
Accepted

### Chain Puzzle: Tabletop Games #05 - It's Yahtzee, Jim, but not as we know it

I rotated the grid 90 degrees clockwise before solving the grid deductions, in order to reduce vertical space. Let's solve Statue Park first. Now to the Fillomino. Now that the two grids are solved, ...
• 15.5k
Accepted

I make it
Accepted

### Two dice with the same probability for each sum?

I think: Here's my proof:
• 17.9k

### Three Dice minimum value

A lower bound is An upper bound is
• 496
Accepted

### Generating Roman numerals with dice

UPDATE (after a pretty sturdy hint from OP): (Again, one more number can be constructed, if flipping the dice is allowed.) Original answer: I got all the way up to with these dice: Here's how to ...
• 77.7k
Accepted

### A bet with your friend

Suppose we have $n$ dice. Then When $n=15$ Just for fun, here's a smartass combinatorial way to prove the identity I used above: Perhaps there's a smarter-ass way to do it a bit more briefly.
• 120k
Accepted

### Building the ideal Scrabble dice set

I chose to use a standard set of D&D dice, as you might get from a game shop, for ease of manufacturing and rolling. Incidentally, it contains seven dice, which is the number of tiles that form a ...
• 19.7k

### How many tries to roll a 6?

I believe the answer is This is computational calculation, so it is not statistical answer. It is for the people who try to find it probabilistically. Here is the probabilistic solution: First of ...
• 30.4k

### Putting the pips on a d6

I decided to solve this in the second hardest possible way myself, and created a 3D model of all the possibilities. Here it is: The sides that are not visible are fully determined by the visible ones,...
• 77.7k

### What is the 'best' way to tilt through a D20?

One should note that we may break this problem down into a number of subproblems: What is the path from $n$ to $n+1$ containing the least number of negative points? It is relatively clear that ...
• 7,891
Accepted

### Cheating aplenty at Build-a-Die 2017

I wrote up some Python code to find the optimal solution in each case. Here are the dice everyone chose: And here's who won:
• 993
Accepted

### A strange message full of dice came in my mail

It seems to translate to: Found by
• 2,631