Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with dominoes
Search options answers only
not deleted
user 12906
A puzzle that involves tiles (or the concept of tiles) in the shape of 2x1 rectangles, divided into 2 squares, each containing 0 to 6 spots. It may require knowledge of general rules of the game, Dominos, or it may simply use the number of spots, on the tiles, as clues for a solution.
13
votes
One rectangle, indivisible
So we know that each horizontal split is prevented by at least two (vertical) dominoes. … Since there are $m-1$ such splits, there must be at least $2m-2$ vertical dominoes, and since there are $2m$ dominoes in total, there can be at most $2$ horizontal dominoes, which are not enough to prevent …
- 2,684