FEATURED

## Puzzle Tournament 4

Puzzle Prime’s fourth puzzle tournament was organized on February 26, 2022. Congrats to REDCROUTONS who solved all the puzzles (even found a small mistake in one of them)!

You have 60 minutes to solve 6 puzzles, each worth 1 point. Upload your solutions as a pdf, document, or image, using the form below. Good luck!

Time for work: 1 hour

Each problem is worth 1 point. Use the form at the bottom of the post to send your solutions.

## 1. The Grid

by Puzzle Prime

Figure out how the last portion (7×5 in yellow) of the grid should be colored in black and white.

Place arrows along hexagon edges so that the number of arrows pointing to each hexagon equals the number of dots inside, adhering to the following rules:

1. Arrows cannot be touching.
2. Arrows cannot be placed on dashed edges.

## 3. Segments

by Puzzle Prime

Use at most 27 segments to create the largest number with distinct digits.

Notes: For example, the number 273914 would use 5+3+5+6+2+4=25 segments.

## 4. Constellations

Connect the stars with lines, so that the number inside each star corresponds to the number of lines connected to it, and the number outside each star corresponds to the total number of stars in its group.

Note: No line connecting two stars can pass through a third star.

## 5. Chess Connect

by Puzzle Prime

The starting and ending positions of 6 chess pieces are shown on the board. Find the trajectories of the pieces, if you know that they do not overlap and completely cover the board.

Notes: The pieces can not backtrack. Two trajectories can intersect diagonally but can not pass through the same square. Only the Knight has a discontinuous trajectory.

## 6. Broken Square

by Puzzle Prime

Use exactly 5 out of these 16 pieces to build a 7×7 grid, without overlapping.

Note: You can rotate the pieces, but you cannot mirror them.

FEATURED

## Puzzle Tournament 3

Puzzle Prime’s third puzzle tournament was organized on January 31, 2021. Congrats to Elyot G. who is once again a winner! You can see the problems and the rankings below.

You have 60 minutes to solve 5 puzzles, each worth 1 point. Upload your solutions as a pdf, document, or image, using the form below. Good luck!

Time for work: 1 hour

## 1. Constellation

Connect the stars with lines, so that the number inside each star corresponds to the number of lines connected to it, and the number in each barrier corresponds to the number of lines intersecting it.

Note: The stars in the corners cannot be connected, since the lines would pass through other stars.

## 2. Lineon

GOAL:
Move one of the Friends to the Exit Point.

PLAYING THE GAME:
Draw lines to move Friends. A move is connecting a point on the Grid to another point on the Grid by drawing a straight line. The line can be made in any direction, as long as it connects exactly two points and doesn’t cross or touch another line.

TIMELINE:
You move each Friend as many times as it says on the Timeline, starting with the topmost Friend and continuing in the order all the way down to the bottom one.

KEY POINTS, EXIT POINT, AND WALLS:
One of the Friends must move to the Exit Point, but before he does that, each of the Key Points must be already connected with a line. A Wall is a double line and no Friend can cross or touch it.

## 3. Vinculus

Circles are particles and lines joining them are bonds. The objective is to find all the hidden values, following these four rules:

1. Particle values must be the sum of their bond values.
2. Particles can have the following values: 0, 1, 2, 4, 8, 12, 16.
3. Bonds can have the following values: 0, 1, 2, 4.
4. If two particles have the same value, the bond between them must have value 0.

## 4. Chess Connect

by Puzzle Prime

The starting and ending positions of 6 chess pieces are shown on the board. Find the trajectories of the pieces, if you know that they do not overlap and completely cover the board.

Notes: The pieces can not backtrack. Two trajectories can intersect diagonally but can not pass through the same square. Only the Knight has a discontinuous trajectory.

## 5. Murder Mystery

In the three murder cases below, you can read the testimonies of all suspects. For each case, find who the killer is, knowing that no 2 people are in the same row or column, and that the killer was alone in a room with the victim.

## Results

REWARDS

The TOP 3 players will win codes for some of our favorite puzzle video games. Thanks to Other Tales Interactive, Thomas Bowker, and Daniel Nora for supporting our tournament.

FEATURED

## Puzzle Tournament 2

Puzzle Prime’s second puzzle tournament was organized on June 27, 2020. Congrats to Elyot G. who solved all the puzzles! You can see the problems and the rankings below.

You have 60 minutes to solve 6 puzzles, each worth 1 point. Upload your solutions as a pdf, document, or image, using the form below. Good luck!

Time for work: 1 hour

Puzzle Prime Knight

Start from a square with a P on the chessboard, and keep jumping via knight’s move, consequently landing on squares with the letters U-Z-Z-L-E-P-R-I-M-E.

Point of View

8 of these diagrams correspond to views of the object in the corner when it is looked from different perspectives. Which 2 aren’t?

Note: The projections below are parallel (not perspective).

Chess Fight

Choose a chess piece on the board. Then, move the piece to a cell with another piece, and remove the first piece. Repeat, by moving the second piece to a cell with a new piece, and removing it. Continue until there is only one piece remaining on the board.

Note: For example, we can move the Queen on d2 to the Bishop on b2, the Knight on c3, or the Bishop on d4. If we move the Queen to d4 and remove it from the board, then we must move the Bishop on d4. The only available cell is c3, where a Knight is positioned. We must remove the bishop and move the Knight on c3 either to the Rook on b1 or the Rook on a2…

Special Date

On April 5, 2013 (5.4.2013), the digits used for expressing the date were all different and consecutive. When was the last date before it with this property?

Remark: The digits 9 and 0 are not consecutive.

Splitting the Area

You have 1 square with side length 1 and 2 circles with diameter length 1. Draw a single line so that the resulting areas on the left and on the right of the line are equal.

Notes: You need to specify how you find a line satisfying the condition above.

Chess Connect

The starting and ending positions of 6 chess pieces are shown on the board. Find the trajectories of the pieces, if you know that they do not overlap and completely cover the board.

Notes: The pieces can not backtrack. Two trajectories can intersect diagonally but can not pass through the same square. Only the Knight has a discontinuous trajectory.

## Solutions

The answer to Point of View is C and J.
The answer to Special Date is 23.4.1765.
The solutions of the other puzzles are shown below.

## Prizes

#1.
$10 Gift Card (iTunes or Play Store) Puzzle Avatar (custom made) Puzzle Pelago (mobile game by Hallgrim Games) Hook (mobile game by Rainbow Train) #2.$5 Gift Card (iTunes or Play Store)
Puzzle Pelago (mobile game by Hallgrim Games)
Hook (mobile game by Rainbow Train)

#3.
Puzzle Pelago (mobile game by Hallgrim Games)
Hook (mobile game by Rainbow Train)

#4-5.
Puzzle Pelago (mobile game by Hallgrim Games)
Hook (mobile game by Rainbow Train)

## Puzzle Giveaway 3

Our third giveaway is over. Congratulations to Steven W. who won a whole pack of socks which he plans to wear in his future Escape Room adventures.

Hey, puzzlers, our friends at Soxy are offering their comfy socks in a new puzzle pattern and want to share 5 pairs with you. Solve the puzzle below, post the answer on our Facebook wall, and you can be the lucky winner of a whole set of fun socks. Click the banner below to check Soxy’s other cool items.

Last week, I got from Soxy 1 pair of brown socks, 3 pairs of brown shoes, 2 pairs of black socks, 2 pairs of black shoes, and put them all in a wooden chest. How many times should I pick a random item from the chest, so that I end up with all-matching shoes and socks to wear on Comic-Con?