We want to make a close equivalent of a fair coin throw, by throwing an N-sided fair dice T times. The catch: only one side is marked, by a colored disk on that side's center (like the traditional marking for one on a regular 6-sided dice). We want something that always makes a decision after T t...

32 players are participating in a tournament. It's a knockout tournament, so it looks a lot like march madness. You want to know how all the games went. The problem is that you only know the rankings of each team, and the brackets aren't published. You also know that #32 loses to #1, #31 loses to...

Nothing special, just a cryptic crossword. Hope you enjoy! ACROSS 1 Small stones accent trail border (6) 4 Deceitful spouse breaks down and admits beginnings of cheating and infidelity (8) 10 Minnesota hockey player's explosive rant about short shift (5,4) 11 Fabled Cowboy Bill DuPree finally co...

This sudoku has only 4 leads, but a lot of additional constraints. For starters, I like to know a) where I can find more sudokus with additional constraints (not that urgent, I'm a good googler :-) and b) what is the "maximum minimum" distance of two equal numbers in a standard Sudoku? (I.e., can...

My eight-year-old was recently given a homework assignment to create a small crossword puzzle that demonstrated what he'd learned while studying his class's History topic this term. So we put our heads together and did just that... When he handed in his work, the teacher read through the list of ...

a) In each of these two grids of dots, 5 x 7 and 7 x 9, connect all the dots so as to form polygons of 35 and 63 sides respectively (two consecutive segments can therefore not be collinear as they would then merge two sides of the polygon). b) Is such a connection possible in any grid of n x (n...

This is the fourth puzzle in the Fetching Alchemist series, and is another puzzle that is exclusive to Puzzling SE until solved. Interesting fact: In the game, the ship can move directly from any planet to any other planet. This isn't possible in picture format unfortunately, where roads are lim...

This follows the same rules as previous Fetching Alchemist puzzles, except you choose where you start, and you may now return to your starting place after leaving it. How to Play You are looking for the shortest possible path that allows you to complete all the quests. You choose where you star...

(some letters from below are removed as I would like to do the actual solving of this myself, but the grid is a total of 39 rows & 19 columns = moreso looking for guidance on how to approach this) U2, D4, L32, | 2,5 5,5,5 | GDTB 1,2,3,4 TGCCFYSDXLENMZYPOAS TUYXEVLLJRMEAUQDUER SLNDJCTZRUEEASACXGL ...

A continuation in the Pipes puzzle series. Problem statement for nerds: Let $G(N)$ denote the graph consisting of cardinally adjacently linked lattice points on an $n \times n$ toroidal grid. For which $N$ does there exist a spanning tree of $G(N)$ in which every vertex has degree $1$ or $3$? On ...