I tried to solve it by brute-force as well and found out that if I change the order in which I try to brute-forse then a different vallidatar fails (77, another 77 or both). So is it possible that hidden room should be filled with specific order?
If your brute force solution starts with the solution, you’re lucky.
My solution pass the 77 and another 77 without problem but not the 44 and the 55.
I don’t want to make bruteforce.
Anyone as an idea?
Could anyone explain the example given in the puzzle?
0 4 2
3
0 0 0
3 3 2
0 1 3
2 1 3
Why the second line “332” was not “442”? By the mirrors at the top I should be able to see “ZGGZ” in the first two windows from the bottom.
Thanks
Ghosts aren’t visible directly, so you can’t see the one before the mirror. You see Z.GZ from the bottom (where . is an empty room as you can’t see the ghost in it)
Oh I got it. Now it is very clear. Thanks Robo
I did not have enough experience with ghost and monsters to comprehend it immediately 
Need trying it on paper seriously before coding.
Wow! Handy puzzle to play at anywhere. Thanks One
And here’s links to the specific test cases from the puzzle:
3x3 manor
4x4 manor
5x5 manor
7x7 manor
another 7x7 manor
Not much of a manor - Not supported
- danBhentschel
He also proposes the Bridges puzzle.
Casually reviving this thread to say I had a blast with this puzzle. It’s a lot harder than what I thought initially, but that’s part of the fun 
Great puzzle!
But there is one problem with the description.
What is actually given is the number of times we see monsters, not how many monsters we see.
In a situation
/\\
\\Z
I was tring to solve the puzzle based on the fact that we see one monster.
/\\
\\Z 1
But the creators give data that we see the monster twice.
/\\
\\Z 2
Significant difference. ![]()
7x7 manors are cases with this problem.
First 7x7 manor have
/V\
GGG
\VZ\
0334
↑
Zombie counted two times.
Nice puzzle but it’s so frustrating being denied by a validator (the 4th) while passing all the tests.
I’ve read the threads about it and I still can’t figure out what’s wrong…
For the 5x5 test case, the vampire count is 9. But the constraints seem to indicate that 0 ≤ vampireCount ≤ size (size is the grid size)
Thank you for reporting the issue. You’re absolutely correct. The constraints have just been updated.
Are there always unique solutions to the test cases ? For example, I have this made up case,
1 15 0
5
5 2 2 2 1
5 3 3 2 2
5 2 3 3 5
5 1 2 2 5
…
./\\\
.\.\/
..\/.
…
for which there could be these 2 solutions,
ZZZZZ
Z/\\\
Z\V\/
ZZ\/Z
ZZZZZ
or
VZZZZ
Z/\\\
Z\Z\/
ZZ\/Z
ZZZZZ
Anyway good puzzle. I couldn’t get the 04 7x7 to pass at all
For a random setup there is no reason why there cannot be more than one solution (or no solution). The only reason for the test cases to have a unique solution is that the author has done his work to verify there is just one solution, and have all non-unique solution cases excluded from the test.