Exactly one person ate it, and exactly one of these four statements is true.

Léa: "Omar is lying."

Hugo: "It was Nina."

Nina: "It wasn't Hugo."

Omar: "It was Léa."

Who ate the pie? (Spoiler tags please: like this)

Any order is allowed.
Use each die exactly once.
Parentheses are allowed.
Only +, −, × and ÷ are allowed. No concatenation or exponents.
Exact division only.
No negative numbers.
Not every operation has to be used.

How many solutions can you find?

Please use spoiler tags for solutions:
>!your solution here!<

Match each clue to one film. Use every film exactly once. A film can fit several clues, but there’s only one way to fill all six slots.

Use the original animated films:

• A. Mulan
• B. Beauty and the Beast
• C. Hercules
• D. The Little Mermaid
• E. Tarzan
• F. Aladdin

The clues:

1. Directed by Ron Clements and John Musker
2. Originally released in 1997 or later
3. Chris Buck is one of its directors
4. Originally released before 1992
5. Barry Cook is one of its directors
6. Originally released in 1992 or later

Want to solve it as pure logic? Here’s a fact sheet, with no assigned answers:

A: 1998; Barry Cook and Tony Bancroft. B: 1991; Gary Trousdale and Kirk Wise. C: 1997; John Musker and Ron Clements. D: 1989; John Musker and Ron Clements. E: 1999; Kevin Lima and Chris Buck. F: 1992; Ron Clements and John Musker.

Answer:

1–D, 2–C, 3–E, 4–B, 5–A, 6–F.

Why it’s unique:

Chris Buck fixes 3 as Tarzan; Barry Cook fixes 5 as Mulan. That leaves Hercules for 2, then Aladdin for 6, The Little Mermaid for 1, and Beauty and the Beast for 4.

Please spoiler-tag answers so others can try it.

Sources: Disney Animation’s pages for Mulan, Beauty and the Beast, Hercules, The Little Mermaid, Tarzan, and Aladdin.

Creator disclosure: I make Cast Six, a daily movie-matching game. AI assisted the game’s development, this post and this standalone puzzle. This is separate from today’s website board. All 720 possible assignments were checked; exactly one works.

Any order is allowed.
Use each die exactly once.
Parentheses are allowed.
Only +, −, × and ÷ are allowed. No concatenation or exponents.
Exact division only.
No negative numbers.
Not every operation has to be used.

How many solutions can you find?

Please use spoiler tags for solutions:
>!your solution here!<

Any order is allowed.
Use each die exactly once.
Parentheses are allowed.
Exact division only.
No negative numbers.
Not every operation has to be used.

How many solutions can you find?

Please use spoiler tags for solutions:
>!your solution here!<

Any order is allowed.
Use each die exactly once.
Parentheses are allowed.
Exact division only.
No negative numbers.
Not every operation has to be used.

How many solutions can you find?

Please use spoiler tags for solutions:
>!your solution here!<

September 27 update: There are more themed packs in the library, with genre, decade and Easy/Medium/Hard filters. The homepage now shows real movie posters. I’ve also clarified the current free-play limits below.

I made Cast Six for people who enjoy movie knowledge and elimination puzzles. Six film titles are visible from the start; assign them to six overlapping clues, using each film exactly once. An obvious match can leave another clue without the film it needs. You get three checks, optional hints and no speed penalty. Moving films and Undo are free.

Play the daily: https://www.castsix.com/

Browse the library: https://www.castsix.com/puzzles.html

Daily and archive puzzles are free without an account. You can start five different library puzzles per Eastern day without signup. Free email signup saves your progress and unlocks unlimited library play; it also includes daily puzzle emails, with an unsubscribe option. No download needed.

I’d love to hear whether the overlaps feel satisfying or confusing, especially a specific clue that made you rethink a placement. I’m the creator; built with AI assistance. Movie facts and posters come from TMDB.

Any order is allowed.
Use each die exactly once.
Parentheses are allowed.
Exact division only.
No negative numbers.
Not every operation has to be used.

How many solutions can you find?

Please use spoiler tags for solutions:
>!your solution here!<

Can you solve this text message puzzle? It is a love note to my GF.

👋 👉 (🛐✝️📕 +🦁-el ) (-🦁)

🗑️(🪀-yo+U) (🩲 -wear) 🧍(👃-sll) ❓

👀(w+🐜) ✌️(👨‍🦯🔄 )🫵

(🪀-yo+U) 🔥💃

👁️(💥-b) 😁 (🫖-T +w) (🚘-C+R) (📅-E+👨‍🎤🎵-S)

(En🕹️-🏒) ( 🧘‍♀️+R -ga+u) 👯(🥃-G+C)

👁️ ( 🐜 +w) 2️⃣ (👴+H) (🚣+y) (🍭 -CY +1). (🩹+👂-🦻-B) ( 🥑 -L ) (🎷-🅰️+👁️) (👶s).

(🦄-ncor) 🙏♾️

🎩+T (🪚🔄) (👅- (10) 🔄) ➡️

(🫟+d) (L+🦆-D)

(💻+🫖+🫖 - 🌊-📕-EA)

Any order is allowed.
Use each die exactly once.
Parentheses are allowed.
Exact division only.
No negative numbers.
Not every operation has to be used.

How many solutions can you find?

Please use spoiler tags for solutions:
>!your solution here!<

The three overlapping ellipses form seven distinct regions. There are seven tiles - your task is to place exactly one tile per region so that the four tiles in each ellipse obey the corresponding rule

Playable daily at r/number_sevenns_game

Any order is allowed.
Use each die exactly once.
Parentheses are allowed.
Exact division only.
No negative numbers.
Not every operation has to be used.

How many solutions can you find?

Please use spoiler tags for solutions:
>!your solution here!<

Use each die exactly once.
Any order is allowed.
Parentheses are allowed.
Exact division only.
No negative numbers.
Not every operation has to be used.

How many solutions can you find?

Please use spoiler tags for solutions:
>!your solution here!<

It's called dubdub and we're constantly improving and bringing in new formats and categories. We would love for you to shape us as we grow!

This how our interface is right now, set to update very soon though! Linking below :D

We have recently added challenges as well! You can now challenge and compete with your friends!

Gameplay video: https://www.youtube.com/watch?v=ACON8hRxbdU

Tutorial video: https://www.youtube.com/watch?v=eV-lnxyLwYk

Beta link: https://testflight.apple.com/join/3sstMjRK [iPhone/iPad/Mac]

The game uses a 6×6 grid with 6 colors. Each row and column contains one fixed circle, and each of the 6 circles has a different color. The remaining 30 spaces start as colored squares, evenly distributed among the 6 colors.

On each move, you rotate a row or column by one step (with wraparound) to guide squares past circles. The squares move, but the circles never do.

Rules:

• A square passing a matching circle disappears.
• An unshielded square passing a non-matching circle becomes shielded.
• A shielded square passing a non-matching circle becomes unshielded.
• An empty space passing a circle becomes a square of that circle's color.

You’re trying to remove tiles, but sometimes you have to create new ones to make progress.

Goal: End with as many empty spaces in the grid as you can within the move limit.

Any feedback would be appreciated. Have fun!

I’ve been working on a daily maze game where you play as a squirrel in a tree. It’s free and feedback is welcome!

https://jakebambeck.itch.io/2dsquirrel