Reflections in a SquareRay reflection inside the cubeDissecting a squareEnlarge the Square?Quadrilateral inside a squareThe Challenge SquareThe square and the compassNo ordinary magic squareSide length of square inside a triangleDissect a square into 3:1 rectanglesUgh! The extra SQUARE!Looking for Euler square solver
Stark VS Thanos
Unidentified items in bicycle tube repair kit
Was Unix ever a single-user OS?
Why was Germany not as successful as other Europeans in establishing overseas colonies?
Any examples of headwear for races with animal ears?
Melee attacking upwards (enemy on 10ft ceiling)
What was the state of the German rail system in 1944?
When and why did journal article titles become descriptive, rather than creatively allusive?
How did Captain America use this power?
Pigeonhole Principle Problem
Public Salesforce Site and Security Review
How to creep the reader out with what seems like a normal person?
I caught several of my students plagiarizing. Could it be my fault as a teacher?
Binary Numbers Magic Trick
If Melisandre foresaw another character closing blue eyes, why did she follow Stannis?
Loading but not using TikZ changes a file
Password expiration with Password manager
How to reply this mail from potential PhD professor?
Can I use 1000v rectifier diodes instead of 600v rectifier diodes?
How to implement float hashing with approximate equality
Surprising behavior of Part[ ]
Pressure to defend the relevance of one's area of mathematics
How to assert on pagereference where the endpoint of pagereference is predefined
Is balancing necessary on a full-wheel change?
Reflections in a Square
Ray reflection inside the cubeDissecting a squareEnlarge the Square?Quadrilateral inside a squareThe Challenge SquareThe square and the compassNo ordinary magic squareSide length of square inside a triangleDissect a square into 3:1 rectanglesUgh! The extra SQUARE!Looking for Euler square solver
$begingroup$
An ideal billiards table (no friction, ideal reflections off of the walls, no pockets) is shaped like a square. From the bottom-left corner, shoot a point-sized cue ball at some angle.
What is the shortest path that hits all 4 edges of the table at least once each and ends in the top-right corner?
Note 1: hitting a corner ends the path without counting as hitting the walls on either side of it.
Note 2: I'm aware of this puzzle, which is higher-dimensional and more mathematically involved but has a similar answer to this one. I felt that this warranted its own puzzle, though, because I want more people to have the chance to find its elegant, visual solution without being intimidated by the apparent need to use math (and it's not asking for exactly the same thing).
logical-deduction geometry
$endgroup$
add a comment |
$begingroup$
An ideal billiards table (no friction, ideal reflections off of the walls, no pockets) is shaped like a square. From the bottom-left corner, shoot a point-sized cue ball at some angle.
What is the shortest path that hits all 4 edges of the table at least once each and ends in the top-right corner?
Note 1: hitting a corner ends the path without counting as hitting the walls on either side of it.
Note 2: I'm aware of this puzzle, which is higher-dimensional and more mathematically involved but has a similar answer to this one. I felt that this warranted its own puzzle, though, because I want more people to have the chance to find its elegant, visual solution without being intimidated by the apparent need to use math (and it's not asking for exactly the same thing).
logical-deduction geometry
$endgroup$
$begingroup$
Um, sorry, but ideal billiards table is shaped like a rectangle.
$endgroup$
– Zereges
Apr 22 at 20:46
1
$begingroup$
It has no pockets either - it's such an ideal billiards table that you can't play billiards with it. I'm a physicist. Making useful, non-ideal things is the engineer's job. :P
$endgroup$
– Gilad M
Apr 22 at 22:10
add a comment |
$begingroup$
An ideal billiards table (no friction, ideal reflections off of the walls, no pockets) is shaped like a square. From the bottom-left corner, shoot a point-sized cue ball at some angle.
What is the shortest path that hits all 4 edges of the table at least once each and ends in the top-right corner?
Note 1: hitting a corner ends the path without counting as hitting the walls on either side of it.
Note 2: I'm aware of this puzzle, which is higher-dimensional and more mathematically involved but has a similar answer to this one. I felt that this warranted its own puzzle, though, because I want more people to have the chance to find its elegant, visual solution without being intimidated by the apparent need to use math (and it's not asking for exactly the same thing).
logical-deduction geometry
$endgroup$
An ideal billiards table (no friction, ideal reflections off of the walls, no pockets) is shaped like a square. From the bottom-left corner, shoot a point-sized cue ball at some angle.
What is the shortest path that hits all 4 edges of the table at least once each and ends in the top-right corner?
Note 1: hitting a corner ends the path without counting as hitting the walls on either side of it.
Note 2: I'm aware of this puzzle, which is higher-dimensional and more mathematically involved but has a similar answer to this one. I felt that this warranted its own puzzle, though, because I want more people to have the chance to find its elegant, visual solution without being intimidated by the apparent need to use math (and it's not asking for exactly the same thing).
logical-deduction geometry
logical-deduction geometry
asked Apr 22 at 10:49
Gilad MGilad M
1584
1584
$begingroup$
Um, sorry, but ideal billiards table is shaped like a rectangle.
$endgroup$
– Zereges
Apr 22 at 20:46
1
$begingroup$
It has no pockets either - it's such an ideal billiards table that you can't play billiards with it. I'm a physicist. Making useful, non-ideal things is the engineer's job. :P
$endgroup$
– Gilad M
Apr 22 at 22:10
add a comment |
$begingroup$
Um, sorry, but ideal billiards table is shaped like a rectangle.
$endgroup$
– Zereges
Apr 22 at 20:46
1
$begingroup$
It has no pockets either - it's such an ideal billiards table that you can't play billiards with it. I'm a physicist. Making useful, non-ideal things is the engineer's job. :P
$endgroup$
– Gilad M
Apr 22 at 22:10
$begingroup$
Um, sorry, but ideal billiards table is shaped like a rectangle.
$endgroup$
– Zereges
Apr 22 at 20:46
$begingroup$
Um, sorry, but ideal billiards table is shaped like a rectangle.
$endgroup$
– Zereges
Apr 22 at 20:46
1
1
$begingroup$
It has no pockets either - it's such an ideal billiards table that you can't play billiards with it. I'm a physicist. Making useful, non-ideal things is the engineer's job. :P
$endgroup$
– Gilad M
Apr 22 at 22:10
$begingroup$
It has no pockets either - it's such an ideal billiards table that you can't play billiards with it. I'm a physicist. Making useful, non-ideal things is the engineer's job. :P
$endgroup$
– Gilad M
Apr 22 at 22:10
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Suppose we label the corner on the table like this:
Now we want to move from $A$ to $D$.
Now, imagine the table like this:
Here,
We can simulate the path as a single straight line.
As the line passes the border, it will simulate the result of the ball's reflection hence the table will be mirrored as above.
Now, to hits all $4$ edges, that means
The path should pass $overlineAB$, $overlineCD$, $overlineAC$, and $overlineBD$.
In other words, the path must go beyond $2 times 2$ tables.
To get the shortest path,
We should choose the nearest $D$ (beyond $2 times 2$ tables).
One of the options is the $D$ located $3$ above and $3$ right. But we can't choose this because the line will hit only both corners $A$ and $D$.
Thus,
We can choose the next nearest $D$ which is located $3$ above and $5$ right (or $5$ above and $3$ right). This is the shortest path.
The overall length will be $sqrt5^2 + 3^2 = sqrt34$ times the table length.
Which is like this:
$endgroup$
1
$begingroup$
Can you add another picture at the end with the line drawn over the first image? Just to save us from rotating our heads repeatedly :-D
$endgroup$
– Ahmed Abdelhameed
Apr 22 at 12:50
1
$begingroup$
@AhmedAbdelhameed added :)
$endgroup$
– athin
Apr 22 at 12:57
$begingroup$
Nice! That's exactly right!
$endgroup$
– Gilad M
Apr 22 at 14:08
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/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
);
);
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
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f82044%2freflections-in-a-square%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Suppose we label the corner on the table like this:
Now we want to move from $A$ to $D$.
Now, imagine the table like this:
Here,
We can simulate the path as a single straight line.
As the line passes the border, it will simulate the result of the ball's reflection hence the table will be mirrored as above.
Now, to hits all $4$ edges, that means
The path should pass $overlineAB$, $overlineCD$, $overlineAC$, and $overlineBD$.
In other words, the path must go beyond $2 times 2$ tables.
To get the shortest path,
We should choose the nearest $D$ (beyond $2 times 2$ tables).
One of the options is the $D$ located $3$ above and $3$ right. But we can't choose this because the line will hit only both corners $A$ and $D$.
Thus,
We can choose the next nearest $D$ which is located $3$ above and $5$ right (or $5$ above and $3$ right). This is the shortest path.
The overall length will be $sqrt5^2 + 3^2 = sqrt34$ times the table length.
Which is like this:
$endgroup$
1
$begingroup$
Can you add another picture at the end with the line drawn over the first image? Just to save us from rotating our heads repeatedly :-D
$endgroup$
– Ahmed Abdelhameed
Apr 22 at 12:50
1
$begingroup$
@AhmedAbdelhameed added :)
$endgroup$
– athin
Apr 22 at 12:57
$begingroup$
Nice! That's exactly right!
$endgroup$
– Gilad M
Apr 22 at 14:08
add a comment |
$begingroup$
Suppose we label the corner on the table like this:
Now we want to move from $A$ to $D$.
Now, imagine the table like this:
Here,
We can simulate the path as a single straight line.
As the line passes the border, it will simulate the result of the ball's reflection hence the table will be mirrored as above.
Now, to hits all $4$ edges, that means
The path should pass $overlineAB$, $overlineCD$, $overlineAC$, and $overlineBD$.
In other words, the path must go beyond $2 times 2$ tables.
To get the shortest path,
We should choose the nearest $D$ (beyond $2 times 2$ tables).
One of the options is the $D$ located $3$ above and $3$ right. But we can't choose this because the line will hit only both corners $A$ and $D$.
Thus,
We can choose the next nearest $D$ which is located $3$ above and $5$ right (or $5$ above and $3$ right). This is the shortest path.
The overall length will be $sqrt5^2 + 3^2 = sqrt34$ times the table length.
Which is like this:
$endgroup$
1
$begingroup$
Can you add another picture at the end with the line drawn over the first image? Just to save us from rotating our heads repeatedly :-D
$endgroup$
– Ahmed Abdelhameed
Apr 22 at 12:50
1
$begingroup$
@AhmedAbdelhameed added :)
$endgroup$
– athin
Apr 22 at 12:57
$begingroup$
Nice! That's exactly right!
$endgroup$
– Gilad M
Apr 22 at 14:08
add a comment |
$begingroup$
Suppose we label the corner on the table like this:
Now we want to move from $A$ to $D$.
Now, imagine the table like this:
Here,
We can simulate the path as a single straight line.
As the line passes the border, it will simulate the result of the ball's reflection hence the table will be mirrored as above.
Now, to hits all $4$ edges, that means
The path should pass $overlineAB$, $overlineCD$, $overlineAC$, and $overlineBD$.
In other words, the path must go beyond $2 times 2$ tables.
To get the shortest path,
We should choose the nearest $D$ (beyond $2 times 2$ tables).
One of the options is the $D$ located $3$ above and $3$ right. But we can't choose this because the line will hit only both corners $A$ and $D$.
Thus,
We can choose the next nearest $D$ which is located $3$ above and $5$ right (or $5$ above and $3$ right). This is the shortest path.
The overall length will be $sqrt5^2 + 3^2 = sqrt34$ times the table length.
Which is like this:
$endgroup$
Suppose we label the corner on the table like this:
Now we want to move from $A$ to $D$.
Now, imagine the table like this:
Here,
We can simulate the path as a single straight line.
As the line passes the border, it will simulate the result of the ball's reflection hence the table will be mirrored as above.
Now, to hits all $4$ edges, that means
The path should pass $overlineAB$, $overlineCD$, $overlineAC$, and $overlineBD$.
In other words, the path must go beyond $2 times 2$ tables.
To get the shortest path,
We should choose the nearest $D$ (beyond $2 times 2$ tables).
One of the options is the $D$ located $3$ above and $3$ right. But we can't choose this because the line will hit only both corners $A$ and $D$.
Thus,
We can choose the next nearest $D$ which is located $3$ above and $5$ right (or $5$ above and $3$ right). This is the shortest path.
The overall length will be $sqrt5^2 + 3^2 = sqrt34$ times the table length.
Which is like this:
edited Apr 23 at 5:31
answered Apr 22 at 12:44
athinathin
9,04423181
9,04423181
1
$begingroup$
Can you add another picture at the end with the line drawn over the first image? Just to save us from rotating our heads repeatedly :-D
$endgroup$
– Ahmed Abdelhameed
Apr 22 at 12:50
1
$begingroup$
@AhmedAbdelhameed added :)
$endgroup$
– athin
Apr 22 at 12:57
$begingroup$
Nice! That's exactly right!
$endgroup$
– Gilad M
Apr 22 at 14:08
add a comment |
1
$begingroup$
Can you add another picture at the end with the line drawn over the first image? Just to save us from rotating our heads repeatedly :-D
$endgroup$
– Ahmed Abdelhameed
Apr 22 at 12:50
1
$begingroup$
@AhmedAbdelhameed added :)
$endgroup$
– athin
Apr 22 at 12:57
$begingroup$
Nice! That's exactly right!
$endgroup$
– Gilad M
Apr 22 at 14:08
1
1
$begingroup$
Can you add another picture at the end with the line drawn over the first image? Just to save us from rotating our heads repeatedly :-D
$endgroup$
– Ahmed Abdelhameed
Apr 22 at 12:50
$begingroup$
Can you add another picture at the end with the line drawn over the first image? Just to save us from rotating our heads repeatedly :-D
$endgroup$
– Ahmed Abdelhameed
Apr 22 at 12:50
1
1
$begingroup$
@AhmedAbdelhameed added :)
$endgroup$
– athin
Apr 22 at 12:57
$begingroup$
@AhmedAbdelhameed added :)
$endgroup$
– athin
Apr 22 at 12:57
$begingroup$
Nice! That's exactly right!
$endgroup$
– Gilad M
Apr 22 at 14:08
$begingroup$
Nice! That's exactly right!
$endgroup$
– Gilad M
Apr 22 at 14:08
add a comment |
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.
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
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f82044%2freflections-in-a-square%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
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
Required, but never shown
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
Required, but never shown
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
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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




$begingroup$
Um, sorry, but ideal billiards table is shaped like a rectangle.
$endgroup$
– Zereges
Apr 22 at 20:46
1
$begingroup$
It has no pockets either - it's such an ideal billiards table that you can't play billiards with it. I'm a physicist. Making useful, non-ideal things is the engineer's job. :P
$endgroup$
– Gilad M
Apr 22 at 22:10