Logic Masters Deutschland e.V.

Spider with Broken Legs

(Eingestellt am 27. November 2023, 17:10 Uhr von A2U4F)


Standard Sudoku Rules Apply:
Fill in the grid with the integers 1-9 so that the numbers are not repeated in each row, column, and each 3x3 area (grid) separated by a bold line.

Renban Lines Rules Apply:
Digits on a purple line form a set of non-repeating consecutive digits in any order.

Kropki Dots Rules Apply:
Digits separated by a black dot are in a 1:2 ratio. NOT all the black dot are given.

The Max Profit Rules Apply:
(I came up with this special rule by myself.) Regard the digits on the arrow in order as a given stock. You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock. The digit in the circle equals the max profit. In other words, starting with the circle, the digit on the arrow would be a array prices[i] in order. The digit in the circle=MAX{prices[k]-prices[i]}(k>i)Here is an example:(4)->9->2->6->1->4 Max profit:You buy for 2 and sell for 6. You can NOT buy for 1 and sell for 9 to get 8, since 1 cames later than 9.

Click me to play it on SudokuPad (which doesn't include solution.)

This is my first work. Hope you enjoy!

Lösungscode: Row 2

Zuletzt geändert am 1. Dezember 2023, 09:36 Uhr

Gelöst von pms_headache, StefanSch, Chelo, efnenu, kroutu, hannahh, humaLautema, FischmitFahrrad, starelev5
Komplette Liste

Kommentare

Zuletzt geändert am 27. November 2023, 18:43 Uhr

am 27. November 2023, 18:42 Uhr von Chelo
Very nice constraint, thank you for sharing!.. Please keep on setting, you've started the right way.

Zuletzt geändert am 27. November 2023, 17:53 Uhr

am 27. November 2023, 17:47 Uhr von StefanSch
Example for an valid arrow: (3)-6-9-1->3. Max profit: You by for 6 and sell for 9.
Not valid: (8)-6-9-1->3, you can not by for 1 and sell for 9, since 1 cames later than 9.

@pms_headache: You second solution is invalid because of the arrow in block 9.

Schwierigkeit:1
Bewertung:N/A
Gelöst:9 mal
Beobachtet:0 mal
ID:000FZA

Lösung abgeben

Lösungscode:

Anmelden