Mdthbs

What are the solutions of this Diophantine equation?

How should Thaumaturgy's "three times as loud as normal" be interpreted?

Where on Earth is it easiest to survive in the wilderness?

How do I delete cookies from a specific site?

What exactly is Apple Cider

Why would a Pokémon's silhouette appear on the nearby list, despite already owning it?

First Number to Contain Each Letter

Why would image resources loaded from different origins triggering HTTP authentication dialogs be harmful?

In-universe, why does Doc Brown program the time machine to go to 1955?

What are some countries where you can be imprisoned for reading or owning a Bible?

Looking for a big fantasy novel about scholarly monks that sort of worship math?

Golfball Dimples on spaceships (and planes)?

What do English-speaking kids call ice-cream on a stick?

Why does the UK Prime Minister need the permission of Parliament to call a general election?

Male viewpoint in an erotic novel

Can Adventure creatures always be cast from exile?

Notation: grace note played on the beat with a chord

Add builder hat to other people with tikzpeople

Friend is very nit picky about side comments I don't intend to be taken too seriously

Dissuading my girlfriend from a scam

How do I make my fill-in-the-blank exercise more obvious?

What quests do you need to stop at before you make an enemy of a faction for each faction?

Was the lunar landing site always in the same plane as the CM's orbit?

Remaining in the US beyond VWP admission period

Connect the wires without setting off the bomb

MPire coloring game basic strategyBuilding towers with colored blocksComputer-controlled mazeA problem about oriented face in Square gridA colorful wheelHow many nodes in the network?A Tour Around a TriangleHow to fill $4320$ multiplicative semi-magic square?Stars of the Celestial BaguaThe arrow of time flies in reverse

.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty{ margin-bottom:0;
}

5

2

$begingroup$

You just saw a planted time bomb! Just 5 minutes are remaining until it explodes and as you are in currently in a rural area (no bomb disposal squad) and you know how bombs usually work it is up to you to decide it.

The interesting part of the circuit is below:

To defuse the bomb you have to connect each same-colored pair of nodes (circles) except the red ones. Short circuiting subject to the rules mentioned below or connecting two different colored nodes will set off the bomb.

The 4 master nodes (red) have to be connected such that you can start from any master node and go across wires and come back to the same node, without visiting any node except itself or any wire twice.

Unfortunately you didn't come prepared for this situation, so the only things you have that could be useful are some old wire and a scissor. As those wires are prone to short circuiting, no two wires can touch, and no wire can touch the circuit boundary. Also you are supposed to treat the circuit like it is 2D, as the wires are flimsy and couldn't hold a height. You cannot use the scissor for anything except cutting wires. Wires do not have to be straight and you cannot connect a wire to the middle of an another wire, all wires must start and end at nodes.

Can you save the day?

Abstraction:

In the diagram, connect the nodes with edges so that no two different color nodes are connected, same color node pairs are connected, the red nodes form a cycle, no edge touches the boundary and no two edges intersect.

no-computers graph-theory construction

share|improve this question

edited 9 hours ago

Supersonic

asked 9 hours ago

SupersonicSupersonic

38122 silver badges1010 bronze badges

$endgroup$

add a comment | 

5

2

$begingroup$

You just saw a planted time bomb! Just 5 minutes are remaining until it explodes and as you are in currently in a rural area (no bomb disposal squad) and you know how bombs usually work it is up to you to decide it.

The interesting part of the circuit is below:

To defuse the bomb you have to connect each same-colored pair of nodes (circles) except the red ones. Short circuiting subject to the rules mentioned below or connecting two different colored nodes will set off the bomb.

The 4 master nodes (red) have to be connected such that you can start from any master node and go across wires and come back to the same node, without visiting any node except itself or any wire twice.

Unfortunately you didn't come prepared for this situation, so the only things you have that could be useful are some old wire and a scissor. As those wires are prone to short circuiting, no two wires can touch, and no wire can touch the circuit boundary. Also you are supposed to treat the circuit like it is 2D, as the wires are flimsy and couldn't hold a height. You cannot use the scissor for anything except cutting wires. Wires do not have to be straight and you cannot connect a wire to the middle of an another wire, all wires must start and end at nodes.

Can you save the day?

Abstraction:

In the diagram, connect the nodes with edges so that no two different color nodes are connected, same color node pairs are connected, the red nodes form a cycle, no edge touches the boundary and no two edges intersect.

no-computers graph-theory construction

share|improve this question

edited 9 hours ago

Supersonic

asked 9 hours ago

SupersonicSupersonic

38122 silver badges1010 bronze badges

$endgroup$

add a comment | 

$begingroup$

You just saw a planted time bomb! Just 5 minutes are remaining until it explodes and as you are in currently in a rural area (no bomb disposal squad) and you know how bombs usually work it is up to you to decide it.

The interesting part of the circuit is below:

To defuse the bomb you have to connect each same-colored pair of nodes (circles) except the red ones. Short circuiting subject to the rules mentioned below or connecting two different colored nodes will set off the bomb.

The 4 master nodes (red) have to be connected such that you can start from any master node and go across wires and come back to the same node, without visiting any node except itself or any wire twice.

Unfortunately you didn't come prepared for this situation, so the only things you have that could be useful are some old wire and a scissor. As those wires are prone to short circuiting, no two wires can touch, and no wire can touch the circuit boundary. Also you are supposed to treat the circuit like it is 2D, as the wires are flimsy and couldn't hold a height. You cannot use the scissor for anything except cutting wires. Wires do not have to be straight and you cannot connect a wire to the middle of an another wire, all wires must start and end at nodes.

Can you save the day?

Abstraction:

In the diagram, connect the nodes with edges so that no two different color nodes are connected, same color node pairs are connected, the red nodes form a cycle, no edge touches the boundary and no two edges intersect.

no-computers graph-theory construction

share|improve this question

edited 9 hours ago

Supersonic

asked 9 hours ago

SupersonicSupersonic

38122 silver badges1010 bronze badges

$endgroup$

share|improve this question

edited 9 hours ago

Supersonic

asked 9 hours ago

SupersonicSupersonic

38122 silver badges1010 bronze badges

share|improve this question

edited 9 hours ago

Supersonic

asked 9 hours ago

SupersonicSupersonic

38122 silver badges1010 bronze badges

asked 9 hours ago

SupersonicSupersonic

38122 silver badges1010 bronze badges

asked 9 hours ago

SupersonicSupersonic

38122 silver badges1010 bronze badges

1 Answer
1

active

oldest

votes

6

$begingroup$

This solution works:

(Places where the wires are close together can be pushed apart a bit - there aren't any crossed wires, though.)

My strategy:

The only sorts of topological restrictions involve lines where both ends must be connected to the edge of the grid. That's the only way to cut off any paths - in all other cases, you can just move wires around other wires as necessary. So there's an easy way to solve this puzzle: just do the red loop last, because it's the only thing that can cut off any future lines.


Nothing else cuts the grid into different regions, so as long as you do the red last it's impossible to not solve the puzzle!

share|improve this answer

edited 6 hours ago

answered 9 hours ago

Deusovi♦Deusovi

74.4k77 gold badges256256 silver badges326326 bronze badges

$endgroup$

• 
  
  
  

  
  1
  

  
  
  
  
  
  

  
  $begingroup$
  Wow, congratulations on solving it this quickly! :D
  $endgroup$
  – Supersonic
  9 hours ago
  

  
  
  
  

add a comment | 

Your Answer

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "559"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/4.0/"u003ecc by-sa 4.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});

draft saved

draft discarded

Sign up or log in

StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});

Sign up using Google

Sign up using Facebook

Sign up using Email and Password

Post as a guest

Name

Email

Required, but never shown

StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f87780%2fconnect-the-wires-without-setting-off-the-bomb%23new-answer', 'question_page');
}
);

Post as a guest

Name

Email

Required, but never shown

6

$begingroup$

This solution works:

(Places where the wires are close together can be pushed apart a bit - there aren't any crossed wires, though.)

My strategy:

The only sorts of topological restrictions involve lines where both ends must be connected to the edge of the grid. That's the only way to cut off any paths - in all other cases, you can just move wires around other wires as necessary. So there's an easy way to solve this puzzle: just do the red loop last, because it's the only thing that can cut off any future lines.


Nothing else cuts the grid into different regions, so as long as you do the red last it's impossible to not solve the puzzle!

share|improve this answer

edited 6 hours ago

answered 9 hours ago

Deusovi♦Deusovi

74.4k77 gold badges256256 silver badges326326 bronze badges

$endgroup$

• 
  
  
  

  
  1
  

  
  
  
  
  
  

  
  $begingroup$
  Wow, congratulations on solving it this quickly! :D
  $endgroup$
  – Supersonic
  9 hours ago
  

  
  
  
  

add a comment | 

6

$begingroup$

This solution works:

(Places where the wires are close together can be pushed apart a bit - there aren't any crossed wires, though.)

My strategy:

The only sorts of topological restrictions involve lines where both ends must be connected to the edge of the grid. That's the only way to cut off any paths - in all other cases, you can just move wires around other wires as necessary. So there's an easy way to solve this puzzle: just do the red loop last, because it's the only thing that can cut off any future lines.


Nothing else cuts the grid into different regions, so as long as you do the red last it's impossible to not solve the puzzle!

share|improve this answer

edited 6 hours ago

answered 9 hours ago

Deusovi♦Deusovi

74.4k77 gold badges256256 silver badges326326 bronze badges

$endgroup$

• 
  
  
  

  
  1
  

  
  
  
  
  
  

  
  $begingroup$
  Wow, congratulations on solving it this quickly! :D
  $endgroup$
  – Supersonic
  9 hours ago
  

  
  
  
  

add a comment | 

$begingroup$

This solution works:

(Places where the wires are close together can be pushed apart a bit - there aren't any crossed wires, though.)

My strategy:

The only sorts of topological restrictions involve lines where both ends must be connected to the edge of the grid. That's the only way to cut off any paths - in all other cases, you can just move wires around other wires as necessary. So there's an easy way to solve this puzzle: just do the red loop last, because it's the only thing that can cut off any future lines.


Nothing else cuts the grid into different regions, so as long as you do the red last it's impossible to not solve the puzzle!

share|improve this answer

edited 6 hours ago

answered 9 hours ago

Deusovi♦Deusovi

74.4k77 gold badges256256 silver badges326326 bronze badges

$endgroup$

share|improve this answer

edited 6 hours ago

answered 9 hours ago

Deusovi♦Deusovi

74.4k77 gold badges256256 silver badges326326 bronze badges

answered 9 hours ago

Deusovi♦Deusovi

74.4k77 gold badges256256 silver badges326326 bronze badges

answered 9 hours ago

Deusovi♦Deusovi

74.4k77 gold badges256256 silver badges326326 bronze badges