Cinematrix helper

How the Cinematrix helper works

• Enter the three row and three column constraints.
• Each proposed film must have recorded positive evidence for both clues; the matching algorithm uses each entity once.

Find film intersections and a non-repeating nine-cell assignment. Results show their reference coverage and evidence links.

Results use the puzzle you enter; they are not verified daily answers. Your entries stay out of public URLs.

Solve intersections with alternatives in reserve

For each cell, combine the row and column clues and inspect films with positive evidence for both. The tool also finds a nine-film assignment that does not reuse an entity. Keeping several alternatives matters because a film that fits one cell may be the only recorded option for another.

Read a failed assignment cautiously

Nine nonempty cells can still fail the distinctness requirement if several depend on the same small set of films. The matching algorithm detects that conflict. A failure in this selected reference does not prove the actual puzzle unsolvable, and no current Cinematrix scoring rule or puzzle feed is assumed.

Supported puzzle types

• Entered film grid

Scope of this helper

• 647 selected films: Best Picture winners/nominees plus Christopher Nolan and Hayao Miyazaki films; not a complete film or publisher catalogue.
• No screenshots, cast portraits, IMDb ratings, box-office receipts or publisher answers are imported.
• Dates are earliest recorded releases, which can differ from the game’s release market.
• Cinematrix’s current official page was inaccessible during this check; no current puzzle, scoring details or release schedule is asserted.

Play the original at Cinematrix. This is an unofficial helper with no publisher affiliation.

Choose another game · Find daily hints and archives · Report a problem