Move fast … Or you will loseThe tilted labyrinth - Can you find the fastest path in this 3D-puzzle?...
How do you funnel food off a cutting board?
How would an AI self awareness kill switch work?
Should I reinstall Linux when changing the laptop's CPU?
Which communication protocol is used in AdLib sound card?
False written accusations not made public - is there law to cover this?
Why publish a research paper when a blog post or a lecture slide can have more citation count than a journal paper?
Eww, those bytes are gross
Square Root Distance from Integers
Why does magnet wire need to be insulated?
Airplane generations - how does it work?
A man comes home from work
How to not let the Identify spell spoil everything?
It took me a lot of time to make this, pls like. (YouTube Comments #1)
Is this ordinary workplace experiences for a job in Software Engineering?
How to use Mathemaica to do a complex integrate with poles in real axis?
How much mayhem could I cause as a sentient fish?
Why are the books in the Game of Thrones citadel library shelved spine inwards?
local storage : Uncaught TypeError: Cannot set property 'innerHTML' of null
Why is working on the same position for more than 15 years not a red flag?
Why did the villain in the first Men in Black movie care about Earth's Cockroaches?
How do I prevent a homebrew Grappling Hook feature from trivializing Tomb of Annihilation?
Salsa20 Implementation: Sum of 2 Words with Carries Suppressed
Why zero tolerance on nudity in space?
Do "fields" always combine by addition?
Move fast … Or you will lose
The tilted labyrinth - Can you find the fastest path in this 3D-puzzle? (Simulator now included.)How many different non congruent polygons can you make on a 3x3 dot grid?Minimum cells to fill grid without consecutive neighboursThe Temple Of Demdarr, God Of Puzzling (Part 1)Four Triangles Five Shapes puzzleWow, Puzzle. Woah, NumbersCombinations of pentagons on a 3 by 3 dot grid - how to use Burnside's lemma?How many combinations of pentagons can you make on a 4 by 4 dot grid?Finding the equation among shapesFill $N$ by $M$ grid with numbers in such a way that any given cells' neighbors are different
$begingroup$
Suppose you're on a 4 × 6 grid, and want to go from the bottom left to the top right. How many different paths can you take? Avoid backtracking -- you can only move right or up.
pattern geometry
$endgroup$
add a comment |
$begingroup$
Suppose you're on a 4 × 6 grid, and want to go from the bottom left to the top right. How many different paths can you take? Avoid backtracking -- you can only move right or up.
pattern geometry
$endgroup$
2
$begingroup$
I think its from this site betterexplained.com/articles/…
$endgroup$
– Purple
8 hours ago
$begingroup$
(In the future please be aware that for content you did not create yourself, proper attribution is required. You need to include (at minimum) where it came from—and any additional context you can provide is often helpful to solvers. Posts which use someone else's content without attribution are generally deleted.)
$endgroup$
– Rubio♦
5 hours ago
add a comment |
$begingroup$
Suppose you're on a 4 × 6 grid, and want to go from the bottom left to the top right. How many different paths can you take? Avoid backtracking -- you can only move right or up.
pattern geometry
$endgroup$
Suppose you're on a 4 × 6 grid, and want to go from the bottom left to the top right. How many different paths can you take? Avoid backtracking -- you can only move right or up.
pattern geometry
pattern geometry
edited 5 hours ago
Dr Xorile
12.8k22569
12.8k22569
asked 8 hours ago
Alpha-qAlpha-q
223
223
2
$begingroup$
I think its from this site betterexplained.com/articles/…
$endgroup$
– Purple
8 hours ago
$begingroup$
(In the future please be aware that for content you did not create yourself, proper attribution is required. You need to include (at minimum) where it came from—and any additional context you can provide is often helpful to solvers. Posts which use someone else's content without attribution are generally deleted.)
$endgroup$
– Rubio♦
5 hours ago
add a comment |
2
$begingroup$
I think its from this site betterexplained.com/articles/…
$endgroup$
– Purple
8 hours ago
$begingroup$
(In the future please be aware that for content you did not create yourself, proper attribution is required. You need to include (at minimum) where it came from—and any additional context you can provide is often helpful to solvers. Posts which use someone else's content without attribution are generally deleted.)
$endgroup$
– Rubio♦
5 hours ago
2
2
$begingroup$
I think its from this site betterexplained.com/articles/…
$endgroup$
– Purple
8 hours ago
$begingroup$
I think its from this site betterexplained.com/articles/…
$endgroup$
– Purple
8 hours ago
$begingroup$
(In the future please be aware that for content you did not create yourself, proper attribution is required. You need to include (at minimum) where it came from—and any additional context you can provide is often helpful to solvers. Posts which use someone else's content without attribution are generally deleted.)
$endgroup$
– Rubio♦
5 hours ago
$begingroup$
(In the future please be aware that for content you did not create yourself, proper attribution is required. You need to include (at minimum) where it came from—and any additional context you can provide is often helpful to solvers. Posts which use someone else's content without attribution are generally deleted.)
$endgroup$
– Rubio♦
5 hours ago
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
This is, I'm sure, answered somewhere else. It is also related to Pascal's triangle.
Simply fill out the grid as follows:
In this grid, each number represents the number of ways of getting to that particular intersection. And that number is precisely the number of ways to get to the intersection below it added to the number of ways to get to the intersection to the left of it.
$endgroup$
add a comment |
$begingroup$
A more mathematically oriented answer:
You have $10$ moves to make in total and you need to choose which $4$ of them are going to be up.
The number of ways to do that is $${10choose 4}=210$$
$endgroup$
add a comment |
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
});
}
});
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%2f80006%2fmove-fast-or-you-will-lose%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
$begingroup$
This is, I'm sure, answered somewhere else. It is also related to Pascal's triangle.
Simply fill out the grid as follows:
In this grid, each number represents the number of ways of getting to that particular intersection. And that number is precisely the number of ways to get to the intersection below it added to the number of ways to get to the intersection to the left of it.
$endgroup$
add a comment |
$begingroup$
This is, I'm sure, answered somewhere else. It is also related to Pascal's triangle.
Simply fill out the grid as follows:
In this grid, each number represents the number of ways of getting to that particular intersection. And that number is precisely the number of ways to get to the intersection below it added to the number of ways to get to the intersection to the left of it.
$endgroup$
add a comment |
$begingroup$
This is, I'm sure, answered somewhere else. It is also related to Pascal's triangle.
Simply fill out the grid as follows:
In this grid, each number represents the number of ways of getting to that particular intersection. And that number is precisely the number of ways to get to the intersection below it added to the number of ways to get to the intersection to the left of it.
$endgroup$
This is, I'm sure, answered somewhere else. It is also related to Pascal's triangle.
Simply fill out the grid as follows:
In this grid, each number represents the number of ways of getting to that particular intersection. And that number is precisely the number of ways to get to the intersection below it added to the number of ways to get to the intersection to the left of it.
edited 5 hours ago
answered 7 hours ago
Dr XorileDr Xorile
12.8k22569
12.8k22569
add a comment |
add a comment |
$begingroup$
A more mathematically oriented answer:
You have $10$ moves to make in total and you need to choose which $4$ of them are going to be up.
The number of ways to do that is $${10choose 4}=210$$
$endgroup$
add a comment |
$begingroup$
A more mathematically oriented answer:
You have $10$ moves to make in total and you need to choose which $4$ of them are going to be up.
The number of ways to do that is $${10choose 4}=210$$
$endgroup$
add a comment |
$begingroup$
A more mathematically oriented answer:
You have $10$ moves to make in total and you need to choose which $4$ of them are going to be up.
The number of ways to do that is $${10choose 4}=210$$
$endgroup$
A more mathematically oriented answer:
You have $10$ moves to make in total and you need to choose which $4$ of them are going to be up.
The number of ways to do that is $${10choose 4}=210$$
answered 13 mins ago
Arnaud MortierArnaud Mortier
618211
618211
add a comment |
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%2f80006%2fmove-fast-or-you-will-lose%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
2
$begingroup$
I think its from this site betterexplained.com/articles/…
$endgroup$
– Purple
8 hours ago
$begingroup$
(In the future please be aware that for content you did not create yourself, proper attribution is required. You need to include (at minimum) where it came from—and any additional context you can provide is often helpful to solvers. Posts which use someone else's content without attribution are generally deleted.)
$endgroup$
– Rubio♦
5 hours ago