# Tag Info

0

A modification of @hexomino's answer, which drops six moves:

0

3

I would say the answer is If you look at

0

From the six columns only the fourth contains the same symbol 3 times, namely the symbol $O$. In addition to that, none of the rows contains the same symbol 3 times. If we replace the question mark which is on fourth row with the symbol $X$ then on the fourth row the symbol $X$ appears 3 times as well.

2

Since each block can only receive one laser, all 6 of them (A, C, F, H, Q and S) should go to the outer ring. Specifically, R1,C2 to C4 and C5, R2 to R4. Given how bridges 1, 2, 3, 4, 5 and 6 are orientated, this can be solved WITHOUT rotations. Move directions: d=down r=right u=up l=left My solution: Bd Aru Gl Rdl Bur Ar Cu Rrd Grd 2dr Fu Ql 3d Fr Qu 2l 3u ...

2

Step 1 Step 2 Step 3 Step 4 Step 5 Step 6 Step 7

1

2

1: 2: 3: 4: 5:

1

0

3

8

It was fun, but took a lot of time, so: My solution, now with comment (and adapted to fix some oversights) EDIT: I added step-by step pictures of the first quarter (first 5 pictures) of the puzzle. note: The flawed logic of the fourth deduction is improved here The more condense original solution: Picture 1: Plan: Exclude possibilities one by one, using ...

21

The 'family of 7' clued in this puzzle is: How? First notice that the bottom-right corner shows: If we shade the spaces in each box which correspond to these categories, we see the following: This means the final 9-letter answer is:

2

The intended answer, and what really happened, was:

4

You can solve the problem via integer linear programming as follows. Let $N=\{1,\dots,12\}$, and let $r_i$ and $c_j$ be the required row and column sums, respectively. For $(i,j)\in N \times N$, let $a_{i,j}$ be the region that contains cell $(i,j)$. Let $D=\{(1,0),(0,-1),(0,1)\}$ be the set of gravity directions (down, left, and right), and let G=\{(i,j,...

5

0

I suppose that

0

my guess would be

0

Partial Answer 1: 2: 3: 4: 5: 6: 7: 8: 9: 10:

7

Could it be

14

To me it looks like picture shows

0

As many have mentioned, there is no "inside the box" answer to the problem. Depending on the exact statement of the problem, there may be trick answers. For example, as stated, the lines may not touch, but there is no rule against a line going through another circle in the middle of its route.

3

Looks to me like it's a

0

I think the answer is... Because...

3

12

If the dividing line between the '9' and '?' cells is actually supposed to be positioned more to the right, then the answer is: Because: However, if this is intended as a trick question and the solver is supposed to note that the -5 cell is only above a single box, then: It really depends on whether that line is positioned correctly or if it is intended ...

0

2

4

I know it is optimal:

13

I think the answer is Reasoning

6

This is and it needs to be read Here's an annotated image. Explanations follow. One recurring thing I don't quite understand: I should maybe add that the title

4

Partial Answer: (31/40) Movie / Character Thanks @Prim3numbah for #3!

3

Photo number 5: Photo number 6:

1

My intuition is that the answer is D, for the following reasons: As we go from left to right, the number of highlight squares goes ?, 3, 2, 1. So we would expect the answer to have 4 highlighted squares, as in A and D. As we go from left to right, the background color goes ?, white, black, white. So we would expected the answer to have a black background, ...

3

I think this final configuration would work How do you get this configuration

2

In each step, So the answer is

11

Partial answer - solved Shingoki, have guesses for 3 categories but not certain The Shingoki's solution is: The 16 symbols are: Here are the categories: And there is a character fitting all four of these categories: Solving the Shingoki Initial deductions get us here: More progress can be made in one of the corners: Next, consider Next, look at the 4 ...

18

The groups are The answer fitting all categories is Filled-out Venn diagram:

8

Solved at last! The pieces of the maze should be put together like this: We can then enter the maze through the 'l' in the red block and exit via the 'e' in the same block, spelling a message while we traverse the maze, which says: Found as follows (dashed/dotted lines represent movement forward/back between layers, not all cells are part of the route): ...

2

For me the most likely candidate would be Because

6

It looks like So let's do this first Now switch red and blue with the following moves And move everything back

2

I suspect this question can only be definitively answered with some clever programming, but here's a slight improvement using just manual placement of flags:

8

The flags, from left to right and top to bottom: Group #1: Group #2: Group #3: Group #4: Where did L.B.G. go?

1

...would you mind if I gave a score of...

Top 50 recent answers are included