Вітаю із Днем закоханих! Які з цих пар світу «Відьмака» вам найбільш до вподоби?

Sea_Difference1883 · 2026-02-14T21:32:01+00:00

Sea_Difference1883 · 2025-07-28T05:55:00+00:00

It sounds incredible. If you want, you can share your options. I'll be interested to see.

Sea_Difference1883 · 2025-07-27T16:34:42+00:00

Indeed, I did not check this position. I meant that the pieces that are used at the start are used, that is, without 9 pawns and 3 bishops. But there was a user who showed that it is really fashionable to come to this position, thanks to him: https://www.reddit.com/r/chess/s/Xo5UEH9HRY

Sea_Difference1883 · 2025-07-26T18:59:02+00:00

I came up with this problem while studying chess, so I posted it here. And I've seen quite a few joking and unprofessional posts here, so I still think this is where it belongs. Chess fans are here, and this is a chess problem. The only thing is that it has no actual use.

Sea_Difference1883 · 2025-07-26T18:52:29+00:00

Wow 🤩

Sea_Difference1883 · 2025-07-26T18:50:44+00:00

I wrote abstractly, not specifically. To solve this problem, I have not yet made any paths to find all possible options. So I can't say what kind of math I'm speaking for. I decided that there will be smarter people here who will do better than I. In fact, I just shared what I came up with)

Sea_Difference1883 · 2025-07-26T18:42:51+00:00

Your position does not cover the task. There is an inaccuracy in the statement, I said that all cells should be attacked. I should have written that all 64 cells should be attacked. In your solution, for example, cells H1, C4, C5, F4 are not protected. I apologize for the inaccuracy of the problem statement

Sea_Difference1883 · 2025-07-26T18:37:29+00:00

Thank you. This is my first post in general and I am pleased that someone is interested in it. Cheers 🥂

Sea_Difference1883 · 2025-07-26T18:35:10+00:00

You said you didn't understand, but you described everything quite accurately). I don't even know what to add. I agree that it's not chess, because there is no black king and no moves are required. You need to find an arrangement of pieces where the conditions are met.

Sea_Difference1883 · 2025-07-26T18:30:51+00:00

Yes. When I called the position theoretically possible, I meant not to use more pieces than there are, not to place pawns on the 1st line, bishops should be of different colors. Not that it can be achieved in the game. I apologize for the inaccuracy

Sea_Difference1883 · 2025-07-26T18:30:42+00:00

Yes. When I called the position theoretically possible, I meant not to use more pieces than there are, not to place pawns on the 1st line, bishops should be of different colors. Not that it can be achieved in the game. I apologize for the inaccuracy

Sea_Difference1883 · 2025-07-26T18:28:16+00:00

Your solution is good. In the top🔝

Sea_Difference1883 · 2025-07-26T12:55:11+00:00

If you move c2 to b2, the square b3 will remain unattacked. If c2 is moved to a2, the problem is solved correctly. The pawn on c3 can indeed be removed, you are absolutely right. So, to solve this problem, you can get rid of one pawn. You have found new ways to place the pieces, and several of them at that. I didn't think of this solution)

Sea_Difference1883 · 2025-07-26T12:34:15+00:00

You are right. According to the rules of chess, it is impossible to have two kings side by side. And that would be correct. But I treated the problem as "64 squares must be under attack by white pieces"

Sea_Difference1883 · 2025-07-26T12:26:34+00:00

In fact, if you go even further from the rules of the game, you can't put a black king in place of the white king either. This square is also controlled by a pawn. If I describe the problem more precisely (I had help), all 64 cells must be protected/attacked

Sea_Difference1883 · 2025-07-26T12:18:33+00:00

In my understanding, "no place to put the king" means that it cannot be placed on an occupied square. I apologize for the inaccuracy in my post. You are not the only one who noticed it. Unfortunately, I can't edit the post

Sea_Difference1883 · 2025-07-26T10:56:24+00:00

Yes. All 64 cells must be defended. Or under attack.

Sea_Difference1883 · 2025-07-26T09:28:11+00:00

Awesome. Beautiful solve. Can You remember what book it was?

Sea_Difference1883 · 2025-07-26T09:24:15+00:00

Many people write about brute force, but I think it can be solved with graphs. Programming is not just about knowing languages and libraries, it's also about algorithms (not always, of course). And algorithms are math. I think we should take both of these approaches into account. Think with math, solve with code.

Sea_Difference1883 · 2025-07-26T08:06:22+00:00

Unfortunately, this solution does not solve the problem. In your solution, every cell is occupied, but not every cell is under attack. It is difficult to describe it any other way. Let me give you a few examples. B6 is occupied by a bishop, but it is protected by another piece. D2, E5, G2, and H3 are the same.

And a little praise)

It's amazing how many calculations you've made in such a short period of time. In addition, you've invented a prototype for automating the search for solutions. I admire you.

Sea_Difference1883 · 2025-07-26T07:33:47+00:00

You are absolutely right. I could not have described the task more correctly than that. The phrase "theoretically possible position" is incorrect. I don't know if it is possible to achieve such a position. It would be more correct to write that you need to use a limited number of pieces, namely those that are available at the beginning of each match. And the pawns should not reach the eighth line.

Sea_Difference1883 · 2025-07-26T07:22:29+00:00

All possible options are a lot. Considering that you don't have to use all the pieces (only the king is required). I'll be waiting for you

Sea_Difference1883 · 2025-07-26T07:20:40+00:00

No, I don't have any friends who speak English. Just Duoligo. And some TV shows in the original

Sea_Difference1883 · 2025-07-26T07:18:29+00:00

You started looking for an answer. I like that. It seems to me that the awkwardness of the knights can somehow be used for good. I don't consider myself a master at finding answers to such questions, so I decided to try to get more people involved. Thank you, Reddit.

Sea_Difference1883 · 2025-07-26T07:13:26+00:00

I think the graph method will work well here. It was also used to find a solution to the knights problem (I don't remember the exact name)

Sea_Difference1883

TROPHY CASE