Intersection PuzzleOptimal play for 2 by 2 dots and boxesIn the Undead Game, what makes one board more...

Plagiarism or not?

Expand and Contract

Why didn't Miles's spider sense work before?

What killed these X2 caps?

What's the in-universe reasoning behind sorcerers needing material components?

Venezuelan girlfriend wants to travel the USA to be with me. What is the process?

Personal Teleportation: From Rags to Riches

Which is the best way to check return result?

Method Does Not Exist error message

Why would the Red Woman birth a shadow if she worshipped the Lord of the Light?

Detention in 1997

Is it acceptable for a professor to tell male students to not think that they are smarter than female students?

Why doesn't using multiple commands with a || or && conditional work?

Unlock My Phone! February 2018

Do UK voters know if their MP will be the Speaker of the House?

What exploit Are these user agents trying to use?

What do you call someone who asks many questions?

What about the virus in 12 Monkeys?

Mathematica command that allows it to read my intentions

How could indestructible materials be used in power generation?

What mechanic is there to disable a threat instead of killing it?

Can a virus destroy the BIOS of a modern computer?

Why is consensus so controversial in Britain?

Why do bosons tend to occupy the same state?



Intersection Puzzle


Optimal play for 2 by 2 dots and boxesIn the Undead Game, what makes one board more difficult than another?Oct - Dots and Boxes on Steroids!A Total Masyu puzzleLatin square puzzleLatin Square Puzzle - Difficult$verb|Eight Circles|$Finding the hidden path (new grid puzzle concept?)A “Find the Path” PuzzleMasyu puzzles with many circles













5












$begingroup$


I have invented a new puzzle called Intersection. Let's find out what it is!





Intersection



You are given an $ntimes n$ grid with circles and boxes inside arbitrary squares. A circle cannot be in the same grid square as another box; there must always be at least two circles, but at least one box; the circles and/or boxes cannot fill up every square in the grid. Now onto the real rules of the game!



Suppose we let $n=3$ and have the following configuration:




$$begin{array}{|r|c|} hline
& & \ hline
&bigcirc &square \ hline
bigcirc & & \ hline
end{array}$$




The aim of the game in this case is to connect the two circles with lines, but the lines must intersect at the grid square with the box in the middle.




  • Lines only start from circles, not boxes or anywhere else;

  • When a line reaches an outer edge of the grid from a particular grid square, the line can be continued from the grid square on the directly opposite end of the same row/column, unless a line or circle is in the grid square on that very opposite end (kind of like how Pac-Man can leave the maze from one end and enter it back in from the directly opposite end);

  • Lines cannot start from a circle and then connect back to the same circle;

  • Lines cannot interfere with each other in regular grid squares, but only on the squares where the boxes are in;

  • Lines can only travel in rows and columns, no diagonals;

  • Up to four lines can protrude from a given circle in general, but that can vary depending on the position of a circle.

  • Lines can only connect to other circles by crossing at least one grid square — if two circles are in grid squares adjacent to each other, a line cannot connect them in between.

  • Lines must fill every grid square!


With those rules, here is the solution (though there could be more than one, but that I don't know for sure):




$qquadqquadqquadqquadqquadquad$Solution




How about something else?




$$begin{array}{|r|c|} hline
& &bigcirc \ hline
&bigcirc & \ hline
square & & \ hline
end{array}$$




The solution to this is:




$qquadqquadqquadqquadqquadqquadquad$Solution 2
(sorry for the bad drawing skill; trust me, I'm better by hand than by software, but that's besides the point)




So, let's bump it up to something a little harder, shall we?





Puzzle



Solve the following intersection grid!




$$begin{array}{|r|c|} hline
bigcirc& & & \ hline
& &bigcirc & \ hline
&square &square & \ hline
& &bigcirc &square \ hline
end{array}$$




The first user to answer with a solution will get the tick; another answer to follow that might also have a solution will get a $+50$ rep bounty; if an answer holds more than one solution, then it will get a $+100$ rep bounty (and if that one comes first, it will instead get the tick).



I hope my puzzle makes sense.



Good luck! :D





P.S. This game is like Flow for those who know that game, except the lines, well, intersect each other.










share|improve this question











$endgroup$












  • $begingroup$
    Must we fill in every square? Asking this given the "Flow" reference.
    $endgroup$
    – EKons
    2 hours ago










  • $begingroup$
    This is like the sequel Flow Free: Bridges.
    $endgroup$
    – noedne
    2 hours ago










  • $begingroup$
    @EKons yes! I will add that in
    $endgroup$
    – user477343
    2 hours ago










  • $begingroup$
    @noedne I have never heard of that... please don't tell me my game is the exact concept :(
    $endgroup$
    – user477343
    2 hours ago










  • $begingroup$
    I don't think it's the exact concept, since we have to connect all pairs of circles, not just each pair of same-colored circles (your grid has three such pairs, for example, Flow Free: Bridges needs an even number of circles because of the way it works).
    $endgroup$
    – EKons
    2 hours ago
















5












$begingroup$


I have invented a new puzzle called Intersection. Let's find out what it is!





Intersection



You are given an $ntimes n$ grid with circles and boxes inside arbitrary squares. A circle cannot be in the same grid square as another box; there must always be at least two circles, but at least one box; the circles and/or boxes cannot fill up every square in the grid. Now onto the real rules of the game!



Suppose we let $n=3$ and have the following configuration:




$$begin{array}{|r|c|} hline
& & \ hline
&bigcirc &square \ hline
bigcirc & & \ hline
end{array}$$




The aim of the game in this case is to connect the two circles with lines, but the lines must intersect at the grid square with the box in the middle.




  • Lines only start from circles, not boxes or anywhere else;

  • When a line reaches an outer edge of the grid from a particular grid square, the line can be continued from the grid square on the directly opposite end of the same row/column, unless a line or circle is in the grid square on that very opposite end (kind of like how Pac-Man can leave the maze from one end and enter it back in from the directly opposite end);

  • Lines cannot start from a circle and then connect back to the same circle;

  • Lines cannot interfere with each other in regular grid squares, but only on the squares where the boxes are in;

  • Lines can only travel in rows and columns, no diagonals;

  • Up to four lines can protrude from a given circle in general, but that can vary depending on the position of a circle.

  • Lines can only connect to other circles by crossing at least one grid square — if two circles are in grid squares adjacent to each other, a line cannot connect them in between.

  • Lines must fill every grid square!


With those rules, here is the solution (though there could be more than one, but that I don't know for sure):




$qquadqquadqquadqquadqquadquad$Solution




How about something else?




$$begin{array}{|r|c|} hline
& &bigcirc \ hline
&bigcirc & \ hline
square & & \ hline
end{array}$$




The solution to this is:




$qquadqquadqquadqquadqquadqquadquad$Solution 2
(sorry for the bad drawing skill; trust me, I'm better by hand than by software, but that's besides the point)




So, let's bump it up to something a little harder, shall we?





Puzzle



Solve the following intersection grid!




$$begin{array}{|r|c|} hline
bigcirc& & & \ hline
& &bigcirc & \ hline
&square &square & \ hline
& &bigcirc &square \ hline
end{array}$$




The first user to answer with a solution will get the tick; another answer to follow that might also have a solution will get a $+50$ rep bounty; if an answer holds more than one solution, then it will get a $+100$ rep bounty (and if that one comes first, it will instead get the tick).



I hope my puzzle makes sense.



Good luck! :D





P.S. This game is like Flow for those who know that game, except the lines, well, intersect each other.










share|improve this question











$endgroup$












  • $begingroup$
    Must we fill in every square? Asking this given the "Flow" reference.
    $endgroup$
    – EKons
    2 hours ago










  • $begingroup$
    This is like the sequel Flow Free: Bridges.
    $endgroup$
    – noedne
    2 hours ago










  • $begingroup$
    @EKons yes! I will add that in
    $endgroup$
    – user477343
    2 hours ago










  • $begingroup$
    @noedne I have never heard of that... please don't tell me my game is the exact concept :(
    $endgroup$
    – user477343
    2 hours ago










  • $begingroup$
    I don't think it's the exact concept, since we have to connect all pairs of circles, not just each pair of same-colored circles (your grid has three such pairs, for example, Flow Free: Bridges needs an even number of circles because of the way it works).
    $endgroup$
    – EKons
    2 hours ago














5












5








5





$begingroup$


I have invented a new puzzle called Intersection. Let's find out what it is!





Intersection



You are given an $ntimes n$ grid with circles and boxes inside arbitrary squares. A circle cannot be in the same grid square as another box; there must always be at least two circles, but at least one box; the circles and/or boxes cannot fill up every square in the grid. Now onto the real rules of the game!



Suppose we let $n=3$ and have the following configuration:




$$begin{array}{|r|c|} hline
& & \ hline
&bigcirc &square \ hline
bigcirc & & \ hline
end{array}$$




The aim of the game in this case is to connect the two circles with lines, but the lines must intersect at the grid square with the box in the middle.




  • Lines only start from circles, not boxes or anywhere else;

  • When a line reaches an outer edge of the grid from a particular grid square, the line can be continued from the grid square on the directly opposite end of the same row/column, unless a line or circle is in the grid square on that very opposite end (kind of like how Pac-Man can leave the maze from one end and enter it back in from the directly opposite end);

  • Lines cannot start from a circle and then connect back to the same circle;

  • Lines cannot interfere with each other in regular grid squares, but only on the squares where the boxes are in;

  • Lines can only travel in rows and columns, no diagonals;

  • Up to four lines can protrude from a given circle in general, but that can vary depending on the position of a circle.

  • Lines can only connect to other circles by crossing at least one grid square — if two circles are in grid squares adjacent to each other, a line cannot connect them in between.

  • Lines must fill every grid square!


With those rules, here is the solution (though there could be more than one, but that I don't know for sure):




$qquadqquadqquadqquadqquadquad$Solution




How about something else?




$$begin{array}{|r|c|} hline
& &bigcirc \ hline
&bigcirc & \ hline
square & & \ hline
end{array}$$




The solution to this is:




$qquadqquadqquadqquadqquadqquadquad$Solution 2
(sorry for the bad drawing skill; trust me, I'm better by hand than by software, but that's besides the point)




So, let's bump it up to something a little harder, shall we?





Puzzle



Solve the following intersection grid!




$$begin{array}{|r|c|} hline
bigcirc& & & \ hline
& &bigcirc & \ hline
&square &square & \ hline
& &bigcirc &square \ hline
end{array}$$




The first user to answer with a solution will get the tick; another answer to follow that might also have a solution will get a $+50$ rep bounty; if an answer holds more than one solution, then it will get a $+100$ rep bounty (and if that one comes first, it will instead get the tick).



I hope my puzzle makes sense.



Good luck! :D





P.S. This game is like Flow for those who know that game, except the lines, well, intersect each other.










share|improve this question











$endgroup$




I have invented a new puzzle called Intersection. Let's find out what it is!





Intersection



You are given an $ntimes n$ grid with circles and boxes inside arbitrary squares. A circle cannot be in the same grid square as another box; there must always be at least two circles, but at least one box; the circles and/or boxes cannot fill up every square in the grid. Now onto the real rules of the game!



Suppose we let $n=3$ and have the following configuration:




$$begin{array}{|r|c|} hline
& & \ hline
&bigcirc &square \ hline
bigcirc & & \ hline
end{array}$$




The aim of the game in this case is to connect the two circles with lines, but the lines must intersect at the grid square with the box in the middle.




  • Lines only start from circles, not boxes or anywhere else;

  • When a line reaches an outer edge of the grid from a particular grid square, the line can be continued from the grid square on the directly opposite end of the same row/column, unless a line or circle is in the grid square on that very opposite end (kind of like how Pac-Man can leave the maze from one end and enter it back in from the directly opposite end);

  • Lines cannot start from a circle and then connect back to the same circle;

  • Lines cannot interfere with each other in regular grid squares, but only on the squares where the boxes are in;

  • Lines can only travel in rows and columns, no diagonals;

  • Up to four lines can protrude from a given circle in general, but that can vary depending on the position of a circle.

  • Lines can only connect to other circles by crossing at least one grid square — if two circles are in grid squares adjacent to each other, a line cannot connect them in between.

  • Lines must fill every grid square!


With those rules, here is the solution (though there could be more than one, but that I don't know for sure):




$qquadqquadqquadqquadqquadquad$Solution




How about something else?




$$begin{array}{|r|c|} hline
& &bigcirc \ hline
&bigcirc & \ hline
square & & \ hline
end{array}$$




The solution to this is:




$qquadqquadqquadqquadqquadqquadquad$Solution 2
(sorry for the bad drawing skill; trust me, I'm better by hand than by software, but that's besides the point)




So, let's bump it up to something a little harder, shall we?





Puzzle



Solve the following intersection grid!




$$begin{array}{|r|c|} hline
bigcirc& & & \ hline
& &bigcirc & \ hline
&square &square & \ hline
& &bigcirc &square \ hline
end{array}$$




The first user to answer with a solution will get the tick; another answer to follow that might also have a solution will get a $+50$ rep bounty; if an answer holds more than one solution, then it will get a $+100$ rep bounty (and if that one comes first, it will instead get the tick).



I hope my puzzle makes sense.



Good luck! :D





P.S. This game is like Flow for those who know that game, except the lines, well, intersect each other.







grid-deduction puzzle-creation pencil-and-paper-games connections-puzzle






share|improve this question















share|improve this question













share|improve this question




share|improve this question








edited 2 hours ago







user477343

















asked 3 hours ago









user477343user477343

3,2211857




3,2211857












  • $begingroup$
    Must we fill in every square? Asking this given the "Flow" reference.
    $endgroup$
    – EKons
    2 hours ago










  • $begingroup$
    This is like the sequel Flow Free: Bridges.
    $endgroup$
    – noedne
    2 hours ago










  • $begingroup$
    @EKons yes! I will add that in
    $endgroup$
    – user477343
    2 hours ago










  • $begingroup$
    @noedne I have never heard of that... please don't tell me my game is the exact concept :(
    $endgroup$
    – user477343
    2 hours ago










  • $begingroup$
    I don't think it's the exact concept, since we have to connect all pairs of circles, not just each pair of same-colored circles (your grid has three such pairs, for example, Flow Free: Bridges needs an even number of circles because of the way it works).
    $endgroup$
    – EKons
    2 hours ago


















  • $begingroup$
    Must we fill in every square? Asking this given the "Flow" reference.
    $endgroup$
    – EKons
    2 hours ago










  • $begingroup$
    This is like the sequel Flow Free: Bridges.
    $endgroup$
    – noedne
    2 hours ago










  • $begingroup$
    @EKons yes! I will add that in
    $endgroup$
    – user477343
    2 hours ago










  • $begingroup$
    @noedne I have never heard of that... please don't tell me my game is the exact concept :(
    $endgroup$
    – user477343
    2 hours ago










  • $begingroup$
    I don't think it's the exact concept, since we have to connect all pairs of circles, not just each pair of same-colored circles (your grid has three such pairs, for example, Flow Free: Bridges needs an even number of circles because of the way it works).
    $endgroup$
    – EKons
    2 hours ago
















$begingroup$
Must we fill in every square? Asking this given the "Flow" reference.
$endgroup$
– EKons
2 hours ago




$begingroup$
Must we fill in every square? Asking this given the "Flow" reference.
$endgroup$
– EKons
2 hours ago












$begingroup$
This is like the sequel Flow Free: Bridges.
$endgroup$
– noedne
2 hours ago




$begingroup$
This is like the sequel Flow Free: Bridges.
$endgroup$
– noedne
2 hours ago












$begingroup$
@EKons yes! I will add that in
$endgroup$
– user477343
2 hours ago




$begingroup$
@EKons yes! I will add that in
$endgroup$
– user477343
2 hours ago












$begingroup$
@noedne I have never heard of that... please don't tell me my game is the exact concept :(
$endgroup$
– user477343
2 hours ago




$begingroup$
@noedne I have never heard of that... please don't tell me my game is the exact concept :(
$endgroup$
– user477343
2 hours ago












$begingroup$
I don't think it's the exact concept, since we have to connect all pairs of circles, not just each pair of same-colored circles (your grid has three such pairs, for example, Flow Free: Bridges needs an even number of circles because of the way it works).
$endgroup$
– EKons
2 hours ago




$begingroup$
I don't think it's the exact concept, since we have to connect all pairs of circles, not just each pair of same-colored circles (your grid has three such pairs, for example, Flow Free: Bridges needs an even number of circles because of the way it works).
$endgroup$
– EKons
2 hours ago










2 Answers
2






active

oldest

votes


















3












$begingroup$


solution­­­­­­­­­­­­­­­­­­­­­­­­­­­­­­







share|improve this answer









$endgroup$





















    2












    $begingroup$

    I think I've got an alternative solution to noedne




    enter image description here







    share|improve this answer









    $endgroup$














      Your Answer





      StackExchange.ifUsing("editor", function () {
      return StackExchange.using("mathjaxEditing", function () {
      StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
      StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
      });
      });
      }, "mathjax-editing");

      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/3.0/"u003ecc by-sa 3.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


















      StackExchange.ready(
      function () {
      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f81367%2fintersection-puzzle%23new-answer', 'question_page');
      }
      );

      Post as a guest















      Required, but never shown

























      2 Answers
      2






      active

      oldest

      votes








      2 Answers
      2






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes









      3












      $begingroup$


      solution­­­­­­­­­­­­­­­­­­­­­­­­­­­­­­







      share|improve this answer









      $endgroup$


















        3












        $begingroup$


        solution­­­­­­­­­­­­­­­­­­­­­­­­­­­­­­







        share|improve this answer









        $endgroup$
















          3












          3








          3





          $begingroup$


          solution­­­­­­­­­­­­­­­­­­­­­­­­­­­­­­







          share|improve this answer









          $endgroup$




          solution­­­­­­­­­­­­­­­­­­­­­­­­­­­­­­








          share|improve this answer












          share|improve this answer



          share|improve this answer










          answered 2 hours ago









          noednenoedne

          8,51412365




          8,51412365























              2












              $begingroup$

              I think I've got an alternative solution to noedne




              enter image description here







              share|improve this answer









              $endgroup$


















                2












                $begingroup$

                I think I've got an alternative solution to noedne




                enter image description here







                share|improve this answer









                $endgroup$
















                  2












                  2








                  2





                  $begingroup$

                  I think I've got an alternative solution to noedne




                  enter image description here







                  share|improve this answer









                  $endgroup$



                  I think I've got an alternative solution to noedne




                  enter image description here








                  share|improve this answer












                  share|improve this answer



                  share|improve this answer










                  answered 1 hour ago









                  hexominohexomino

                  45.4k4139219




                  45.4k4139219






























                      draft saved

                      draft discarded




















































                      Thanks for contributing an answer to Puzzling Stack Exchange!


                      • Please be sure to answer the question. Provide details and share your research!

                      But avoid



                      • Asking for help, clarification, or responding to other answers.

                      • Making statements based on opinion; back them up with references or personal experience.


                      Use MathJax to format equations. MathJax reference.


                      To learn more, see our tips on writing great answers.




                      draft saved


                      draft discarded














                      StackExchange.ready(
                      function () {
                      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f81367%2fintersection-puzzle%23new-answer', 'question_page');
                      }
                      );

                      Post as a guest















                      Required, but never shown





















































                      Required, but never shown














                      Required, but never shown












                      Required, but never shown







                      Required, but never shown

































                      Required, but never shown














                      Required, but never shown












                      Required, but never shown







                      Required, but never shown







                      Popular posts from this blog

                      ORA-01691 (unable to extend lob segment) even though my tablespace has AUTOEXTEND onORA-01692: unable to...

                      Always On Availability groups resolving state after failover - Remote harden of transaction...

                      Circunscripción electoral de Guipúzcoa Referencias Menú de navegaciónLas claves del sistema electoral en...