Thank you very much Brem for the featured and kind comment! Nice solve! My puzzles have varied difficulty. I liked to explore a lot of different constraints, but friendly cells are one of my favorites. For grid 1, it is also possible to have 2 and 3 overlap row column, and the other one in the box. The diagonal rules help eliminate it. I'm glad that you enjoyed the puzzle Brem. Hope everyone enjoyed it too! :)
At 9:06 it would have been good to point out the no diagonal touching rule, because with the arguments given, 2 could be in R2C2 to combine row and column 2, and then somewhere else in box 2.
Ooooh, the friendly cells took me more than a few moments to wrap my head around, but I've been wondering about 3D-oku for a while; this is such a lovely implementation of it!
Wow! That was different. Lots of fun. I'm so glad you featured this one! There was so much going on, but it worked so well. Definitely my favorite so far this year!
Very nice. I had a rough start on account of my silly self misreading the rules (I read "grid" for "box"), once I read it again paying proper attention all was fine.
Wow wow wow, what an idea to create fantastic puzzle👏🏽👏🏽 once u get going u go till the end, I colored all friendly cell so I finished it in 5 mins 18 secs, brilliant puzzle & also thanks bremmy for the explanation
I got very confused for a while because I stupidly interpreted "May not touch diagonally" as "may not touch" which inevitably led to a lot of dead ends! :) Also for the third grid there was an easier way of going about solving it. You could observe that there are only four possible places for three long diagonals of identical numbers and then just use the other grids to eliminate three of the numbers off each line.
The rule about friendly cells not being able to touch diagonally should have added a phrase about IDENTICAL friendly cells not touching diagonally. With the rule as it is now, there can only be 4 friendly cells in that grid, not a minimum of 6.
Did you do what I did and interpret the non-touch rule as being adjacent too? You can just look at the video to see 6 friendly cells none of which touch diagonally.
@@pacman52280 You have my sympathy! I spent a long time trying to solve without any adjacent until I stepped back and realised that as you say by those rules you could only have four. Even then I had to watch bremster before I properly got it into my head! :)
Was having problems wrapping my head around this today, so just watched BremSter's excellent solve! Really cool puzzle, props to Crusader!
Thank you very much Brem for the featured and kind comment! Nice solve!
My puzzles have varied difficulty. I liked to explore a lot of different constraints, but friendly cells are one of my favorites.
For grid 1, it is also possible to have 2 and 3 overlap row column, and the other one in the box. The diagonal rules help eliminate it.
I'm glad that you enjoyed the puzzle Brem. Hope everyone enjoyed it too! :)
At 9:06 it would have been good to point out the no diagonal touching rule, because with the arguments given, 2 could be in R2C2 to combine row and column 2, and then somewhere else in box 2.
This is quite a clever puzzle! My time was 12:15, solver number 348.
Ooooh, the friendly cells took me more than a few moments to wrap my head around, but I've been wondering about 3D-oku for a while; this is such a lovely implementation of it!
Wow! That was different. Lots of fun. I'm so glad you featured this one! There was so much going on, but it worked so well. Definitely my favorite so far this year!
11:55, very cool puzzle. Thank you!
Absolutely brilliant! Some setters are totally on another level, and Crusader is one of them!
Very nice. I had a rough start on account of my silly self misreading the rules (I read "grid" for "box"), once I read it again paying proper attention all was fine.
Ouch that hurt my brain.
But what a neat puzzle.
Nice solve , explained stuff very nicely.
Wow wow wow, what an idea to create fantastic puzzle👏🏽👏🏽 once u get going u go till the end, I colored all friendly cell so I finished it in 5 mins 18 secs, brilliant puzzle & also thanks bremmy for the explanation
11:15 for me. Fun, and quite approachable! :-D
26 minutes for me
nice puzzle
I was quite confused about today's sudoku. Thanks for your solve. I did the 2 sudoku, but the first and the third one's got me confused 😅
I got very confused for a while because I stupidly interpreted "May not touch diagonally" as "may not touch" which inevitably led to a lot of dead ends! :)
Also for the third grid there was an easier way of going about solving it. You could observe that there are only four possible places for three long diagonals of identical numbers and then just use the other grids to eliminate three of the numbers off each line.
The rule about friendly cells not being able to touch diagonally should have added a phrase about IDENTICAL friendly cells not touching diagonally. With the rule as it is now, there can only be 4 friendly cells in that grid, not a minimum of 6.
No. I got 6 friendly cells into the puzzle and none of them are touching diagonally.
Did you do what I did and interpret the non-touch rule as being adjacent too? You can just look at the video to see 6 friendly cells none of which touch diagonally.
@@ChrisVenus, yes.
@@pacman52280 You have my sympathy! I spent a long time trying to solve without any adjacent until I stepped back and realised that as you say by those rules you could only have four. Even then I had to watch bremster before I properly got it into my head! :)