Logic Masters Deutschland e.V.

Naughty XVs

(Published on 13. December 2024, 20:25 by mimec)

This puzzle is slightly easier than the previous ones in the naughty series (Naughty Line and Naughty Cages), so do have a go and have fun!

Rules:

  • Normal sudoku rules apply.
  • Adjacent digits along the green 6-9 lines must sum to at least 6 and at most 9.
  • Cells connected by an X must sum to 10. Cells connected by a V must sum to 5. Not all Xs and Vs are given.

Play online on SudokuPad

Solution code: Row 9

Last changed on on 13. December 2024, 23:15

Solved by Ploctypus, Joyofrandomness, OutOfMyMindBRB, tobee86, StevenS, Chelo, Uhu, gnidan, SKORP17, johnreid, PinkNickels, Stargazing Albatross, Rearden, popcorn99, BBoris, Fenn, seeppp, Rheax, ... Decapod, Toren, teuthida, mistergoodkat, H.I. McDunnough, atomvic, geronimo92, HelloKetene, Cialoh, 0123coolkid, paranoid, KingIsulgard, TaeChi, timww572, separovich, Kirra, chanelaw
Full list

Comments

on 16. December 2024, 02:17 by ClayLovesLogic
https://www.youtube.com/watch?v=R1VenODl3Fg&ab_channel=ClayLovesLogic Great puzzle. Link to my solve!

on 14. December 2024, 21:59 by josemadre
Nice

on 13. December 2024, 23:47 by wuc
A clever fun 2 star puzzle to me. Thx.

on 13. December 2024, 23:32 by Onkel_Dagobert
A fun puzzle that was much easier than it looked. Well done!

on 13. December 2024, 23:15 by mimec
I emphasised the 6-9 rule to avoid confusion with whispers lines.

on 13. December 2024, 22:29 by Rearden
Much easier if you read the rules first and don't treat the green lines as whispers.. :D

Last changed on 13. December 2024, 23:21

on 13. December 2024, 22:15 by PinkNickels
I cannot recall ever doing a puzzle with 6-9 lines, but the break-in was very smooth so if this variant is new to you, please try this puzzle out. It's very fun!

~~~

Thank you very much! I also haven't seen this rule before, so I decided to make a few more approachable puzzles to try to popularize it.

Difficulty:2
Rating:92 %
Solved:85 times
Observed:3 times
ID:000L3U

Puzzle variant New Online solving tool

Enter solution

Solution code:

Login