Logic Masters Deutschland e.V.

GPT stumper

(Eingestellt am 16. März 2023, 03:47 Uhr von SimplePurpleFrog)

This puzzle is part of the Beginner Series: Also check the Easy Doubles Series: Short version:

This is a yin-yang puzzle: shade some cells such that both shaded and unshaded areas are, each, fully orthogonally connected and no 2x2 area is fully in a single region.

The digit in the cell an arrow originates from (points away from) indicates the total number of cells in that direction that belong to the opposite region.

e.g. If r1c4 was a 2 and an arrow pointed down from that cell, then there would be exactly 2 cells in that direction that are not in the same region as r1c4.

You can play GPT stumper on f-puzzles or CtC.


Long handed instructions, given to ChatGPT to test logical reasoning, both ChatGPT 3 and 3.5 fail to apply relevant logic:

Given a 4x4 square where each cell may belong to one of two regions. All cells of each of the two regions must be orthogonally connected. Digits 1 to 4 appear only once each in each row, column, and any of the 4 2x2 square areas defined by the first/last two rows/columns. Lastly, no 2x2 square may be completely in a single region.

Using the notation where an arrow points from a cell in a given direction, the digit in this cell indicates the number of cells in that direction that are in a different region to this cell, in the same row if the arrow is horizontal, or the same column if vertical, there are 6 arrows given as follows:

  • From row 1 col 1 pointing right
  • From row 1 col 2 pointing down
  • From row 1 col 3 pointing left and down
  • From row 3 col 4 pointing left
  • From row 4 col 3 pointing up

Lösungscode: Digits in row 4 from left to right

Zuletzt geändert am 20. Januar 2024, 01:29 Uhr

Gelöst von wooferzfg, e5ten, Jlrice2, brtmns, 85392, Pigeo, TeamSchmidt, DarrenBurnett, Vebby, qwert2812, bernhard, Wolwo, Blazsej007, Goofy, lerroyy, thoughtbyte, ThibautV, dodomos, h5663454, T1geR, Raistlen, ... Javier Rebottaro, Eierkopp121, Skeptica, DanSkorne, tkrahn98, sinomaen, jsxft, lmalergue, superjess42, Eepowiz, NumaPompilius, Zedarflight , Calesch, TVDK, Eldi, CharlieH, risflo, Jdt112, Azvaril
Komplette Liste

Kommentare

am 20. Januar 2024, 01:29 Uhr von SimplePurpleFrog
Link to Anti Knight - Thermo

am 16. Januar 2024, 19:38 Uhr von ave
I didn't find it trivial. Good fun!

am 8. Januar 2024, 22:38 Uhr von superfluid
Found the break in tough but lovely flow thereafter. Thanks!

am 29. November 2023, 03:20 Uhr von SimplePurpleFrog
Link to Little Killer

am 22. Oktober 2023, 02:57 Uhr von SimplePurpleFrog
Added link to RC indexing

am 21. Oktober 2023, 02:40 Uhr von SimplePurpleFrog
Added link to thermo-renban

am 19. Oktober 2023, 23:59 Uhr von SimplePurpleFrog
Added link to anti-knight kropki

am 17. Oktober 2023, 18:24 Uhr von SimplePurpleFrog
Link to arrow-thermo

am 17. Oktober 2023, 02:32 Uhr von SimplePurpleFrog
Added link to killer sudoku

am 16. Oktober 2023, 02:18 Uhr von SimplePurpleFrog
Added link to Kropki sudoku

am 15. Oktober 2023, 01:39 Uhr von SimplePurpleFrog
Added link to beginner Arrow sudoku

am 13. Oktober 2023, 17:14 Uhr von Solved647
Nice intro to this type of puzzle. Thanks

am 13. Oktober 2023, 15:39 Uhr von ViKingPrime
Fantastic little puzzle! Yin-Yang puzzles usually turn my brain to jelly, good intro to the logic with this one.

am 13. Oktober 2023, 03:23 Uhr von SimplePurpleFrog
Added link to beginner thermo

Zuletzt geändert am 13. Oktober 2023, 03:47 Uhr

am 26. April 2023, 14:22 Uhr von Rollo
Eine gute Idee, damit ChatGTP zu quälen ;-). Hast du es schon einmal mit sehr einfachen Regeln probiert? Sobald ich ein bisschen Zeit finde, werde ich das mal auf Deutsch versuchen.

SPF> Now I have: https://logic-masters.de/Raetselportal/Raetsel/zeigen.php?id=000FGT

Zuletzt geändert am 16. März 2023, 11:48 Uhr

am 16. März 2023, 04:09 Uhr von wooferzfg
Cute puzzle, thanks

SPF: very welcome, thank you for your comment

Schwierigkeit:1
Bewertung:82 %
Gelöst:166 mal
Beobachtet:7 mal
ID:000DAJ

Rätselvariante

Lösung abgeben

Lösungscode:

Anmelden