UESP Forums

I pass.

May I?
If so, I saw a neat one the other day, though I couldn't get it.

After a local art theft, six suspects were being interviewed. Below is a summary of their statements. Police know that exactly four of them told one lie each and all of the other statements are true. From this information can you tell who committed the crime?

Alan said:
It wasn't Brian
It wasn't Dave
It wasn't Eddie

Brian said:
It wasn't Alan
It wasn't Charlie
It wasn't Eddie

Charlie said:
It wasn't Brian
It wasn't Freddie
It wasn't Eddie

Dave said:
It wasn't Alan
It wasn't Freddie
It wasn't Charlie

Eddie said:
It wasn't Charlie
It wasn't Dave
It wasn't Freddie

Freddie said:
It wasn't Charlie
It wasn't Dave
It wasn't Alan

Unless it's more complicated than I originally thought:

Pretty confident..

A puzzle was here. Removed until my answer is confirmed.

I think too many open puzzles at once will get confusing. I'd rather wait for confirmation of the answer being correct (it's only been about 12 hours. Have patience, man) before another puzzle is posted. Sticking to the guidelines is never a bad thing to do.

Well, sometimes sticking to the guidelines is a bad thing to do... But in this case I agree with you. My puzzle has been removed until my answer is confirmed.

You're right!

Woohoo! In that case:

Here's one that I made myself, so it's a level playing field. No one will know the answer.

Consider the following grid:

Starting and finishing anywhere, and using the moving pattern of a knight in Chess, how many ways could you land on each square once, and what are they? Reversed and mirrored solutions are not separate solutions. The correct answer will contain all solutions, not just one.

Hint: It might be easiest if you showed your answers by numbering this grid.


Feel free to post another puzzle without me confirming your solution, if you're certain that it's correct.

Edit: Solved by TopHatKat

Question: are repeat landings allowed, or can you only touch each square once?

No repeat landings. Land in each square once and only once.

Well that's a complicated one... Any mathematicians on the forums?

Can I assume that the starting position can't be reentered? So for example if you start in the top right corner, you can't land in the top right corner later?

I with scribbane on his question. If we can't revisit on starting square then it's kinda impossible. First move takes up 4 squares and every move after takes 3. You can't reach 12 unless you allow the starting space or a same space to be revisited. If that is allowed, I found the route. I'll label each move in ascending order:



EDIT: See other solution. It is the correct one.

The route doesn't cause the squares to be used, only landing on them.

Land. Use. Same thing in this case.

When you play chess you don't land on each space, you pick the piece up and place it where it would go, so one move from a knight would only use one space, not three. The landing point. That's how I'm interpreting this.

All four spaces equal one move. Why is this relevant? Or are you trying to say that the only space that counts is the starting space of each move? In that case, this could take a while. I'll see what Moeboid says.

Because it's essential to solving the puzzle correctly. Your diagram shows 4 spaces being used immediately, but in my mind it would only be two spaces being used. The starting point and where the knight ends up, with the spaces in between still unused.

I interpreted it the same way Music. I've got a couple of different solutions where I use 11 of the 12 spaces, but I assume the answer will utilize every space, and there may be multiple solutions, so I'll hold off on answering.

I got it! I used a strategy by coping the graph into paint and by going through every possible route with a paint brush, or at least most. I'd start filling it out and if one space had multiple paths, I'd mark it and try all paths later. Out of the MANY tries, I got these three:

TopHatKat, you are SO close. Your first and second solutions are the same (reversed, and flipped upside down, but still the same). And unfortunately, there's more than 2 solutions.

In my search for answers I wrote a little Excel Macro. If you'd like to give it a try, feel free to download it here - Knight Moves.xlsm
(you may have to hit reset twice to get the numbers to go back to 1)

Is this the last one? It's a variation of the first one. It's the only one left I could find unless I'm not looking hard enough or I'm making errors.

Yes, that's correct . You have now provided all three possible solutions . Your turn.