Timeline for How to solve Rogo Puzzle with an extra constraint?
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 3, 2023 at 15:26 | comment | added | user1502040 | You could also use the parity of the number of transitions from off_path -> on_path to the left of a square to classify it as inside or outside. | |
| May 30, 2022 at 11:53 | vote | accept | Optimization team | ||
| May 24, 2022 at 13:17 | vote | accept | Optimization team | ||
| May 27, 2022 at 21:49 | |||||
| May 24, 2022 at 13:17 | comment | added | Optimization team | Great Idea. Thanks for letting me know. | |
| May 24, 2022 at 12:29 | comment | added | RobPratt | To avoid trapping a banned cell inside the loop, there must be a path from the depot (outside the loop) to the banned cell such that the path does not cross the loop. My formulation enforces such a path by sending a unit of flow from the depot to each banned cell. | |
| May 24, 2022 at 12:19 | comment | added | Optimization team | I am not sure if i was succesful in explaining the problem. Here, avoiding entering/existing the blocked cells (black squares) is easy to do The idea is to avoid creating a loop in which a black square is trapped like the foloowing one , it is not clear to me how your proposed solution avoids trapping a black square | |
| May 24, 2022 at 2:53 | history | edited | RobPratt | CC BY-SA 4.0 |
changed notation to avoid collision with linked formulation
|
| May 24, 2022 at 2:46 | history | edited | RobPratt | CC BY-SA 4.0 |
deleted 49 characters in body
|
| May 24, 2022 at 2:29 | history | edited | RobPratt | CC BY-SA 4.0 |
added 73 characters in body
|
| May 23, 2022 at 21:23 | history | edited | RobPratt | CC BY-SA 4.0 |
added 45 characters in body
|
| May 23, 2022 at 21:15 | history | answered | RobPratt | CC BY-SA 4.0 |