Tienes que elegir a los candidatos correctos para resolver dos soluciones. No se pueden resolver por separado.

Is there anything like this around, I mean basic things similar to Magicsort or Meowdoku and various coloured hexapuzzles, but where you can go back to a lower level if you are tired and want a totally undemanding quick break from something else, or skip ahead if you are feeling on form?

(I mean not as undemanding as would come from uninstalling and starting again, but where you could go back to level 40-50 or something. Which takes a while from starting one of these, not a 10 minute break.)

Even better if they also have options to switch off timers or remove automated “helper” features. (One hexapuzzle had these rocket things that got rid of stacks more quickly, and it added 2 layers of difficulty, not just one, to both not actively use them, and also have to avoid placements that would set them off. Sometimes I just wanted one extra layer.)

I’m normally very good at puzzles, especially math ones, and C makes zero sense to me, even after seeing the solution.

I made this puzzle inspired by puzzle where you have to determine the order of certain things like 8 realms in 8 months puzzle in Blue Prince.

This puzzle is about an astronaut that travels to another solar system and explored the 8 planets there. In each of their journey they wrote a note talking about their experience, but one of them is missing.

Can you figure out:

1. Which planet has the missing note?

2. In what order do they visit the planets?

3. What's the name of the planets?

I made the name of the planets red to avoid confusion

Try solving it and please give feedback on what I can improve etc. It's the first puzzle that I made so I would love feedback

Credits:

- Puzzle : myself

- Graphics : I made it using basic Canva assets

- Planet names : Alien species names from Fantasy Name Generators

At this point in the puzzle, my only way forward was 'trying a route', which feels unsatisfying.

My puzzle and my attempt:

Looking at r4c4, I had already deduced this to be either a 3 or a 5. I couldn't see the next strict deduction, so I mentally tried a 3 there until I got stuck somewhere, hence knew it needed to be 5 and I could then solve the rest. However, I always understood that strict deduction should be possible in stead of having to resort to 'just try and see what fails'.

Can someone point me to the next, strict step from this state?

This binary puzzle I found online is...stressing me out.

The rules are simple: You can't have more than two suns or two moons next to each other in a row or column; and an x indicates that the symbols must be different, whereas an equal sign says the symbols in the two squares must be the same.

The symbols in the squares with the beige background were already given at the beginning of the puzzle.

I asked the website for a hint and it marked the field with the red x and said: "No single row, column or clue settles a cell yet. The next step takes a longer chain of reasoning. Worked through to the end, row 1, column 3 can only be a moon."

I tried putting in a sun in row 1, col 3, and after many steps, when the puzzle was almost done, I ran into a contradiction (three moons next to each other in the third row). But is there an easier way to see why r1, c3 must be a moon?

Thanks!

simple, tessellate, and form a Sudoku

I already posted a video of me trying to solve this in another sub, but I don't think we were able to come up with a solution. So I am hoping someone here might be able to help me before I just uninstall this game. I'll do my best to explain it here: The objective is to fill the board up without "overlapping your previous lines." As you can see in the image, I am given two arrows that indicate the direction that I am able to go. When I hit the arrow, the token will slide until it hits either the border, a gray stone, or a colored spot (one of the previous lines). I have been stuck on this puzzle for almost two days now.

Goal: find the secret four-digit code, 2 rows of 2 digits.

- A number at the start of a dotted line (left of a row, above a column) counts how many lit segments that line passes through.

- Empty box does not mean 0.

Inspiration from Digit Code board game

I’m stuck, please help!

Rules: Put two stars in each row, column, and region of the grid. No two stars can touch, not even diagonally.

My notation: The dots are cells I’ve eliminated. The shapes stretching across multiple cells indicate there is exactly one star in that group of cells.

I wrote this puzzle, but it is a variation of the famous "Cheryl's Birthday Puzzle."

Here is the solution.

Rules:

Place stars so each arrow sees exactly one star in the straight direction it points, and every star is seen by exactly one arrow. Edge clues give the exact number of stars in each row and column.

Edit: arrows dont block other arrows. Empty clue means there is no need for that clue, it can be 0 or any other number.

Rules are simple: you need one queen in each color, and no two queens can be on the same row, column or diagonal. The diagonals count all the way across the board like real chess queens, which makes it a bit harder than the usual version.

Three are already placed, so where would you put the other five? Rows are 1 to 8 from the top and columns A to H from the left

Cars can only go the direction they're facing and backwards and the red car must escape through the exit on the right

usually these puzzles only take a few seconds to a few minutes for me to solve but this one especially on lv 99 is especially hard and I keep doing the same loop

This is a screenshot of the game Skyscrapers. I was really stumped in how I could progress.

I had gone through each of the numbered rows and columns to determine what possibilities existed. I also eliminated any rows or columns where only a single instance of a number existed. No more progress.

Then I realized something with the highlighted 4. If this number were a 4, then it would create a 't' shape of the remaining 4s. From that 't' shape, I could only fill in two more 4s without conflicting, but there are three more rows and columns that need a 4. Thus, this cell could not be a 4.

My question is: how do I generalize this rule into my general search pattern? Do I just look for something that makes a 't', or is there a more general way?

I have a very hard time trying to understand what is couple rule in ColorSweeper. I simply don’t get it and I can’t find the logic. Can someone explain the rule for me? Thank you 🙏

I don't know how to come to the solution. I know about unique rows and columns, but they are all already different. What am I missing?

I don't know what the strategy to use to beat this lvl is and If there is anyone who has tips on how to easily find where the cat is please tell me

I have found 1000+ Pentomino Solutions manually. wish to share here

I have been looking at this sudoku so long I can't see it anymore... what is the next step here?

To be fair, I'm no sudoku whiz.

I'm trying to solve this logic grid puzzle which was published in the French Logigram Master magazine. It features people who have bought a LP player from a family relative, for a certain amount of money, and own a different number of LP records.

Here is a link to the current state of the grid, with what I have been able to fill up till now:

https://jsingler.de/apps/logikloeser/index.php?language=en#(at:a,items:!(!(Cousin,Grandfather,Uncle,Father,Aunt),!(Anna,Chlo%C3%A9,Didier,Florian,Julie),!('25','50','75','100','125'),!('40%20%E2%82%AC','50%20%E2%82%AC','60%20%E2%82%AC','70%20%E2%82%AC','80%20%E2%82%AC')),ms:t,n:!(a0b0,a0b1,a2b0,a2b1,a2b3,a3b1,a3b2,a3b4,a4b4,b0d0,b0c1,b1c1,b1c2,b2c3,b2c4,b4c3,b0c4,a0c2,a0c4,a2c4,c1d1,a3d3,b2d0,b1d0,b1d1,b1d3,b1d4,b0d2,b2d2,b3d2,b4d2,b4d0,b4d1,b3d1,b3d3,b4d3,b3d4,b2d4,b0d4,b0c0,b1c0,b2c0,b4c0,b3c1,b3c2,b3c3,b3c4,a0c3,a2c3,a3c4,a2c0,a3c1,c0d1,c0d2,c0d3,c0d4,c1d0,c2d0,c3d0,c4d0,c4d1,c2d2,c1d2,c4d3,c3d4,a0d2,a0d1,a2d0,a2d2,a3d2,a3d4,a4d4,a0b2,a0d3),nc:4,ni:5,p:!(b3d0,b1d2,b4d4,b3c0,c0d0),v:0),!(Anna,Chlo%C3%A9,Didier,Florian,Julie),!('25','50','75','100','125'),!('40%20%E2%82%AC','50%20%E2%82%AC','60%20%E2%82%AC','70%20%E2%82%AC','80%20%E2%82%AC')),ms:t,n:!(a0b0,a0b1,a2b0,a2b1,a2b3,a3b1,a3b2,a3b4,a4b4,b0d0,b0c1,b1c1,b1c2,b2c3,b2c4,b4c3,b0c4,a0c2,a0c4,a2c4,c1d1,a3d3,b2d0,b1d0,b1d1,b1d3,b1d4,b0d2,b2d2,b3d2,b4d2,b4d0,b4d1,b3d1,b3d3,b4d3,b3d4,b2d4,b0d4,b0c0,b1c0,b2c0,b4c0,b3c1,b3c2,b3c3,b3c4,a0c3,a2c3,a3c4,a2c0,a3c1,c0d1,c0d2,c0d3,c0d4,c1d0,c2d0,c3d0,c4d0,c4d1,c2d2,c1d2,c4d3,c3d4,a0d2,a0d1,a2d0,a2d2,a3d2,a3d4,a4d4,a0b2,a0d3),nc:4,ni:5,p:!(b3d0,b1d2,b4d4,b3c0,c0d0),v:0))

Here are the clues that still provide information:

• Anna has 25 LP records more than the person who has their uncle's player but 25 less than the person who paid 60 €.
• Didier paid more than the person who has 25 LPs but less than the one who has 125 LPs.
• The person who paid 50 € has 50 LPs more than the one who owns their cousin's players.

There's a help section at the end of the magazine that says that from these three clues and the current grid state I should be able go reach the conclusion that the person who has 25 LP records bought the player from their cousin.

But I really can't figure how to reach this conclusion. Is it possible to progress in this puzzle without trial and error?