# Dead or Alive Solution

- Each wanted poster contains 3 relevant pieces of data:
- A picture of "Morgan the Kid"
- A date
- A crime.

- When the posters are grouped by the "Crime" field, solvers will have 5 groups of 5 posters each.
- Within each group, each poster will have 1 of 2 pictures (i.e. A given crime will either have a picture with Morgan wearing a hat or not wearing a hat). These pictures correspond to 5-bit binary.
- When the groups are ordered alphabetically (by crime) and the posters within each group are ordered by date, the binary converted to letters (1-26) will yield the answer.

## Solution

RANCH

# Data

Crime | 1/0 | Binary | Letter |
---|---|---|---|

Assault | Hat/no hat | 10010 | R |

Disturbing the Peace | Straight mustache/curly mustache | 00001 | A |

Graverobbing | Bandana over face/Bandana around neck | 01110 | N |

Impersonating the Sheriff | Vest/no vest | 00011 | C |

Unapproved Mining | Completely different person/Morgan | 01000 | H |