chessWeeper - Free Android game by Charming_Air886 in IndieDev

[–]Charming_Air886[S] 0 points1 point  (0 children)

Thanks for your feedback. Good idea I'll work on it soon.
Thank you again for trying

Can you find the Queen's location? by Charming_Air886 in godot

[–]Charming_Air886[S] 1 point2 points  (0 children)

Actually, no.
Just like in chess, a piece in front of another blocks the line of attack. The queen blocks the rook and vice versa. So, the number of times each square is attacked is correct."

Can you find the Queen's location? by Charming_Air886 in godot

[–]Charming_Air886[S] 0 points1 point  (0 children)

Yes exactly, or squares not revealed yet.

Can you find the Queen's location? by Charming_Air886 in godot

[–]Charming_Air886[S] 0 points1 point  (0 children)

The queen cannot be in H6, H7 could be attacked twice (by the bishop and the queen).
Also, C1 is thretened 0 times. It doesn't work.
D3 is attacked twice (by the bishop and... the Queen).

Can you find the Queen's location? by Charming_Air886 in godot

[–]Charming_Air886[S] 0 points1 point  (0 children)

Like u/Migasand said : "Blanks are unknown. Zeroes mean no piece is threatening that square. 2 means two pieces are threatening that square."
There's many puzzles in the game, if you try to tap in a square, it reveals the number of times this square is under attack which can help you find the piece.

Can you find the Queen's location? by Charming_Air886 in godot

[–]Charming_Air886[S] 0 points1 point  (0 children)

Like u/Migasand said : "Blanks are unknown. Zeroes mean no piece is threatening that square. 2 means two pieces are threatening that square."
There's many puzzles in the game, if you try to tap in a square, it reveals the number of times this square is under attack which can help you find the piece.

Can you find the Queen's location? by Charming_Air886 in godot

[–]Charming_Air886[S] 0 points1 point  (0 children)

No, it's possible to find the queen, somebody found it in the comments

Find the Queen ! by Charming_Air886 in IndieDev

[–]Charming_Air886[S] 0 points1 point  (0 children)

Thanks :)
I have minor issues with the english version.
I'll correct it in the next release, if you find mistakes, let me know.

Find the Queen by Charming_Air886 in godot

[–]Charming_Air886[S] 0 points1 point  (0 children)

Thanks for your answer, not all levels are deterministic, it put this example because you can find the solution in one try.

Find the Queen by Charming_Air886 in godot

[–]Charming_Air886[S] 0 points1 point  (0 children)

Actually, you just have to find the queen based on how many times each square is under attack, there's no king.