Connecting three black boxes to three red boxes without crossing lines

[Basimalasi]

Hello computer science people,

riddle me this... you have three black boxes and three red boxes. You want to connect each black box with the three red boxes without making the lines interact with each other. can you do it ? or is it unsolvable ?

Like this :

 

[mathman]

I've seen this many times in the past. To the best of my recollection, it is unsolvable (in two dimensions).

 

[Medicol]

Is this possible ? there is no cut.

 

[skeptic2]

Like this?

 

[Borg]

Not in two dimensions - Water, Gas and Electricity problem.

 

[Mark44]

Like this?

I don't think this meets the requirements of a direct link between each red box with each black box, and vice versa. This might not have been stated in the OP but I believe that is what is implied.

 

[Mark44]

Hello computer science people,

riddle me this... you have three black boxes and three red boxes. You want to connect each black box with the three red boxes without making the lines interact with each other. can you do it ? or is it unsolvable ?

Why would you want to use software to solve this puzzle?

 

[AlephZero]

Why would you want to use software to solve this puzzle?

Try designing a complex multi-layer printed circuit board without using a computer track routing algorithm.

 

[Basimalasi]

Like this?

nope

 

[Basimalasi]

Why would you want to use software to solve this puzzle?

because i think its unsolvable

 

[Basimalasi]

solving this riddle is like guessing a 6-charechters password..you have to have an algorithm that will test all the possible paths the 9 arrows are going to take from the black boxes to the red boxes without interacting

 

[Basimalasi]

Is this possible ? there is no cut.

you can't make the lines go "through" the red boxes.

3 arrows from the first black box to all red boxes
3 arrows from the second black box to all red boxes
3 arrows from the third black box to all red boxes

without no interaction between the lines

 

[.Scott]

Unless you use three dimensions - or the surface of a donut - it's easy to show that there is no solution.
Here is a link: http://mathforum.org/dr.math/faq/faq.3utilities.html
Since it's not possible, there is no point is having a computer search for one.

 

[Basimalasi]

I know this stupid of me and a waste of your time guys but I can't be satisfied without an algorithm that would test all the possibilities

 

[Borek]

while there_exist_more_possibilities(); do test_next_possibility();

I don't have much time to waste, so I am not going much deeper. That's your algorithm, just fill in details.

 

[.Scott]

I know this stupid of me and a waste of your time guys but I can't be satisfied without an algorithm that would test all the possibilities

I understand. You trust computers more than people.
Here's a more detailed algorithm. In fact, it's actual C code:

//  For an explanation of why this algorithm works, see:
//    http://mathforum.org/dr.math/faq/faq.3utilities.html
#include <stdio.h>
void main(void) {
printf(“Results from analysis of Red/Black box riddle: No solutions exist!\n");
}

Try it out and let me know if it finds anything.