As easy as Three, Two, One… How fast can you go from Five to Four?Word Ladder puzzleFrom Puzzling to StackExchangeWord ladder island (formerly dead-end)Change a letter, add a letterGet from AXLE to TIZZYes, your fat ma is hersThaw Sue's cold dogTurn Lead into GOLDFrom bottom to topWant to go from DALLAS to LONDON via BERLIN
That's not my X, its Y is too Z
What plausible reason could I give for my FTL drive only working in space
How can one's career as a reviewer be ended?
What would be the way to say "just saying" in German? (Not the literal translation)
As easy as Three, Two, One... How fast can you go from Five to Four?
Accessing /systemTopic/ streaming channel
Does the new finding on "reversing a quantum jump mid-flight" rule out any interpretations of QM?
I've been given a project I can't complete, what should I do?
Is there a DSLR/mirorless camera with minimal options like a classic, simple SLR?
Are the guests in Westworld forbidden to tell the hosts that they are robots?
If there's something that implicates the president why is there then a national security issue? (John Dowd)
Can you make an identity from this product?
Are polynomials with the same roots identical?
Does a (nice) centerless group always have a centerless profinite completion?
Is it possible to have 2 different but equal size real number sets that have the same mean and standard deviation?
Is it safe to remove python 2.7.15rc1 from Ubuntu 18.04?
noalign caused by multirow and colors
Why isn't Bash trap working if output is redirected to stdout?
Is it okay to have a sequel start immediately after the end of the first book?
Analogy between an unknown in an argument, and a contradiction in the principle of explosion
Transfer custom ringtones to iPhone using a computer running Linux
The significance of kelvin as a unit of absolute temperature
Does putting salt first make it easier for attacker to bruteforce the hash?
Flat with smooth fibers implies formally smooth?
As easy as Three, Two, One… How fast can you go from Five to Four?
Word Ladder puzzleFrom Puzzling to StackExchangeWord ladder island (formerly dead-end)Change a letter, add a letterGet from AXLE to TIZZYes, your fat ma is hersThaw Sue's cold dogTurn Lead into GOLDFrom bottom to topWant to go from DALLAS to LONDON via BERLIN
$begingroup$
You have to reach Four from Five in minimum number of tries with the following rules.
You are only allowed to change one letter at a time.
You have to keep the word length the same.
For example: How do you go from $LAND$ to $SANE$?
$LAND$ $rightarrow$ $SAND$ (1) $rightarrow$ $SANE$ (2). Done in 2 steps.
word wordplay letters word-ladder
edited 6 hours ago
João Bravo
6511
asked 9 hours ago
UvcUvc
1,450221
$endgroup$
add a comment |
$begingroup$
You have to reach Four from Five in minimum number of tries with the following rules.
You are only allowed to change one letter at a time.
You have to keep the word length the same.
For example: How do you go from $LAND$ to $SANE$?
$LAND$ $rightarrow$ $SAND$ (1) $rightarrow$ $SANE$ (2). Done in 2 steps.
word wordplay letters word-ladder
edited 6 hours ago
João Bravo
6511
asked 9 hours ago
UvcUvc
1,450221
$endgroup$
$begingroup$
Would it be worth investigating what the longest path would be (without using any word multiple times)?
$endgroup$
– Cloudy7
6 hours ago
$begingroup$
Definitely...working on a puzzle along those lines..hopefully, I will have it out in next 3 days or so.
$endgroup$
– Uvc
6 hours ago
$begingroup$
@Cloudy7 Finding the longest path sounds like an open-ended puzzle, which are now off-topic :-(
$endgroup$
– Rand al'Thor
3 hours ago
add a comment |
$begingroup$
You have to reach Four from Five in minimum number of tries with the following rules.
You are only allowed to change one letter at a time.
You have to keep the word length the same.
For example: How do you go from $LAND$ to $SANE$?
$LAND$ $rightarrow$ $SAND$ (1) $rightarrow$ $SANE$ (2). Done in 2 steps.
word wordplay letters word-ladder
edited 6 hours ago
João Bravo
6511
asked 9 hours ago
UvcUvc
1,450221
$endgroup$
You have to reach Four from Five in minimum number of tries with the following rules.
You are only allowed to change one letter at a time.
You have to keep the word length the same.
For example: How do you go from $LAND$ to $SANE$?
$LAND$ $rightarrow$ $SAND$ (1) $rightarrow$ $SANE$ (2). Done in 2 steps.
word wordplay letters word-ladder
word wordplay letters word-ladder
edited 6 hours ago
João Bravo
6511
asked 9 hours ago
UvcUvc
1,450221
edited 6 hours ago
João Bravo
6511
asked 9 hours ago
UvcUvc
1,450221
edited 6 hours ago
João Bravo
6511
edited 6 hours ago
João Bravo
6511
edited 6 hours ago
João Bravo
6511
6511
asked 9 hours ago
UvcUvc
1,450221
asked 9 hours ago
UvcUvc
1,450221
asked 9 hours ago
UvcUvc
1,450221
1,450221
$begingroup$
Would it be worth investigating what the longest path would be (without using any word multiple times)?
$endgroup$
– Cloudy7
6 hours ago
$begingroup$
Definitely...working on a puzzle along those lines..hopefully, I will have it out in next 3 days or so.
$endgroup$
– Uvc
6 hours ago
$begingroup$
@Cloudy7 Finding the longest path sounds like an open-ended puzzle, which are now off-topic :-(
$endgroup$
– Rand al'Thor
3 hours ago
add a comment |
$begingroup$
Would it be worth investigating what the longest path would be (without using any word multiple times)?
$endgroup$
– Cloudy7
6 hours ago
$begingroup$
Definitely...working on a puzzle along those lines..hopefully, I will have it out in next 3 days or so.
$endgroup$
– Uvc
6 hours ago
$begingroup$
@Cloudy7 Finding the longest path sounds like an open-ended puzzle, which are now off-topic :-(
$endgroup$
– Rand al'Thor
3 hours ago
$begingroup$
Would it be worth investigating what the longest path would be (without using any word multiple times)?
$endgroup$
– Cloudy7
6 hours ago
$begingroup$
Would it be worth investigating what the longest path would be (without using any word multiple times)?
$endgroup$
– Cloudy7
6 hours ago
$begingroup$
Definitely...working on a puzzle along those lines..hopefully, I will have it out in next 3 days or so.
$endgroup$
– Uvc
6 hours ago
$begingroup$
Definitely...working on a puzzle along those lines..hopefully, I will have it out in next 3 days or so.
$endgroup$
– Uvc
6 hours ago
$begingroup$
@Cloudy7 Finding the longest path sounds like an open-ended puzzle, which are now off-topic :-(
$endgroup$
– Rand al'Thor
3 hours ago
$begingroup$
@Cloudy7 Finding the longest path sounds like an open-ended puzzle, which are now off-topic :-(
$endgroup$
– Rand al'Thor
3 hours ago
add a comment |
5 Answers
5
active
oldest
votes
$begingroup$
Just signed up to share some of the solutions (3 of them) I was able to come up with in 6 steps:
1) FIVE $rightarrow$ FAVE $rightarrow$ FARE $rightarrow$ FART $rightarrow$ FAUT $rightarrow$ FAUR $rightarrow$ FOUR
2) FIVE $rightarrow$ FAVE $rightarrow$ FACE $rightarrow$ FACT $rightarrow$ FAUT $rightarrow$ FAUR $rightarrow$ FOUR
3) FIVE $rightarrow$ DIVE $rightarrow$ DOVE $rightarrow$ DORE $rightarrow$ DORR $rightarrow$ DOUR $rightarrow$ FOUR
OH MAN! After a lot of searching I was able to do it in 5 steps (3 solutions):
1) FIVE $rightarrow$ FIRE $rightarrow$ ... FORE .... $rightarrow$ FORD $rightarrow$ FOUD $rightarrow$ FOUR
2) FIVE $rightarrow$ FINE $rightarrow$ FIND/FONE $rightarrow$ FOND $rightarrow$ FOUD $rightarrow$ FOUR
3) FIVE $rightarrow$ FINE $rightarrow$ FINS/FONE $rightarrow$ FONS $rightarrow$ FOUS $rightarrow$ FOUR
I confirmed the words on Anagrammer.
edited 3 hours ago
Rand al'Thor
73.2k14240484
answered 6 hours ago
João BravoJoão Bravo
6511
New contributor
João Bravo is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
1
$begingroup$
Nice! Welcome to the site, and +1.
$endgroup$
– Rand al'Thor
6 hours ago
$begingroup$
That’s awesome..unless someday comes with four which is very unlikely, you will get the greencheck soon.
$endgroup$
– Uvc
6 hours ago
$begingroup$
I spent quite a bit trying to come up with a 4-step solution without success. I would be extremely impressed if someone came up with one.
$endgroup$
– João Bravo
5 hours ago
add a comment |
$begingroup$
I can do it in
7 steps: five fire fore fort port pout pour four.
With one more obscure word, I can do it in
6 steps: five fire tire tore torr tour four.
answered 9 hours ago
Gareth McCaughan♦Gareth McCaughan
73.9k3184284
$endgroup$
$begingroup$
Absolute minimum is obviously three..I wrote down in 7 without optimization..it will be fascinating to see if somebody can come up with a 5 step solution to better yours.
$endgroup$
– Uvc
9 hours ago
$begingroup$
Three is definitely not possible because none of FOVE, FIUE, FIVR is a word.
$endgroup$
– Gareth McCaughan♦
9 hours ago
$begingroup$
True..I just made a general statement regarding the minimum steps needed..in the example I cited, was able to do in 2 because middle letters were same. In general, absolute minimum would be..total letters - number of common letters in starting and ending words
$endgroup$
– Uvc
9 hours ago
add a comment |
$begingroup$
I found a solution in seven steps.
FIVE - FILE
FILE - FILL
FILL - FALL
FALL - FAIL
FAIL - FOIL
FOIL - FOUL
FOUL - FOUR
answered 9 hours ago
Herb WolfeHerb Wolfe
2,28911021
$endgroup$
$begingroup$
Ha! Ninjaed you by nine seconds (though, oops, I wrote mine down in reverse order, which I'll fix).
$endgroup$
– Gareth McCaughan♦
9 hours ago
1
$begingroup$
It is fascinating to see how each mind works through intermediate steps...I went through “Fire” to “Four”.
$endgroup$
– Uvc
9 hours ago
add a comment |
$begingroup$
Seven steps (with some obscurer words):
FOUR
LOUR
LOUK
LOCK
LICK
LICE
FICE
FIVE
Something that might lead to five, if it can be completed:
FIVE
FIRE
FIRM
FORM
That's three steps from FIVE to something that shares two letters with FOUR.
answered 9 hours ago
Rand al'ThorRand al'Thor
73.2k14240484
$endgroup$
$begingroup$
And I see others have beaten me to seven even without obscure words ...
$endgroup$
– Rand al'Thor
9 hours ago
$begingroup$
Interesting..in mine..F was never changed..still Ineeded seven..it would be really great if we can find 5 step solution at least.
$endgroup$
– Uvc
9 hours ago
$begingroup$
To make your partial thing into a five you'd need either FOUM or FORR to be a word, and I think neither is one.
$endgroup$
– Gareth McCaughan♦
9 hours ago
add a comment |
$begingroup$
In this answer I will show that five steps is the minimum number required (from the answer by @JoãoBravo).
Suppose by contradiction that there are four. Then the sequence will be of the form
F i v e, _ _ _ _, _ _ _ _, _ _ _ _, F o u r.
If the first letter remains unchanged the whole way through, the sequence is
F i v e, F _ _ _, F _ _ _, F _ _ _, F o u r.
Therefore, at each step, one of i v e must be changed to match o u r, without any deviations. This is clearly impossible.
Now suppose that the first letter is changed to a letter ¬ the whole way through. Then the sequence is
F i v e, ¬ _ _ _, ¬ _ _ _, ¬ _ _ _, F o u r.
However, changing from i v e to o u r requires three steps, which are not allowed in this arrangement as the first and fourth steps are wasted.
Thus the only combinations left are
F i v e, F _ _ _, ¬ _ _ _, ¬ _ _ _, F o u r.
This is also impossible as there are not enough steps (one) to change from i v e to o u r.
F i v e, ¬ _ _ _, F _ _ _, F _ _ _, F o u r.
Steps two and three are pointless/a waste of steps so this case can be easily discarded.
F i v e, F _ _ _, F _ _ _, ¬ _ _ _, F o u r.
Yet again, steps three and four are useless for the same reason above.
F i v e, ¬ _ _ _, ¬ _ _ _, F _ _ _, F o u r.
There are not enough steps to make the transition i v e to o u r as the third step is wasted in converting ¬ to F.
F i v e, F _ _ _, ¬ _ _ _, F _ _ _, F o u r.
Again, not sufficient due to the same reasoning above.
F i v e, ¬ _ _ _, F _ _ _, ¬ _ _ _, F o u r.
This is also useless.
answered 5 hours ago
TheSimpliFireTheSimpliFire
2,351534
$endgroup$
$begingroup$
Yes..for this case, it is true...my upcoming puzzle will lend to lot of interesting analysis like this.
$endgroup$
– Uvc
5 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/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%2f84854%2fas-easy-as-three-two-one-how-fast-can-you-go-from-five-to-four%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
5 Answers
5
active
oldest
votes
5 Answers
5
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Just signed up to share some of the solutions (3 of them) I was able to come up with in 6 steps:
1) FIVE $rightarrow$ FAVE $rightarrow$ FARE $rightarrow$ FART $rightarrow$ FAUT $rightarrow$ FAUR $rightarrow$ FOUR
2) FIVE $rightarrow$ FAVE $rightarrow$ FACE $rightarrow$ FACT $rightarrow$ FAUT $rightarrow$ FAUR $rightarrow$ FOUR
3) FIVE $rightarrow$ DIVE $rightarrow$ DOVE $rightarrow$ DORE $rightarrow$ DORR $rightarrow$ DOUR $rightarrow$ FOUR
OH MAN! After a lot of searching I was able to do it in 5 steps (3 solutions):
1) FIVE $rightarrow$ FIRE $rightarrow$ ... FORE .... $rightarrow$ FORD $rightarrow$ FOUD $rightarrow$ FOUR
2) FIVE $rightarrow$ FINE $rightarrow$ FIND/FONE $rightarrow$ FOND $rightarrow$ FOUD $rightarrow$ FOUR
3) FIVE $rightarrow$ FINE $rightarrow$ FINS/FONE $rightarrow$ FONS $rightarrow$ FOUS $rightarrow$ FOUR
I confirmed the words on Anagrammer.
edited 3 hours ago
Rand al'Thor
73.2k14240484
answered 6 hours ago
João BravoJoão Bravo
6511
New contributor
João Bravo is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
1
$begingroup$
Nice! Welcome to the site, and +1.
$endgroup$
– Rand al'Thor
6 hours ago
$begingroup$
That’s awesome..unless someday comes with four which is very unlikely, you will get the greencheck soon.
$endgroup$
– Uvc
6 hours ago
$begingroup$
I spent quite a bit trying to come up with a 4-step solution without success. I would be extremely impressed if someone came up with one.
$endgroup$
– João Bravo
5 hours ago
add a comment |
$begingroup$
Just signed up to share some of the solutions (3 of them) I was able to come up with in 6 steps:
1) FIVE $rightarrow$ FAVE $rightarrow$ FARE $rightarrow$ FART $rightarrow$ FAUT $rightarrow$ FAUR $rightarrow$ FOUR
2) FIVE $rightarrow$ FAVE $rightarrow$ FACE $rightarrow$ FACT $rightarrow$ FAUT $rightarrow$ FAUR $rightarrow$ FOUR
3) FIVE $rightarrow$ DIVE $rightarrow$ DOVE $rightarrow$ DORE $rightarrow$ DORR $rightarrow$ DOUR $rightarrow$ FOUR
OH MAN! After a lot of searching I was able to do it in 5 steps (3 solutions):
1) FIVE $rightarrow$ FIRE $rightarrow$ ... FORE .... $rightarrow$ FORD $rightarrow$ FOUD $rightarrow$ FOUR
2) FIVE $rightarrow$ FINE $rightarrow$ FIND/FONE $rightarrow$ FOND $rightarrow$ FOUD $rightarrow$ FOUR
3) FIVE $rightarrow$ FINE $rightarrow$ FINS/FONE $rightarrow$ FONS $rightarrow$ FOUS $rightarrow$ FOUR
I confirmed the words on Anagrammer.
edited 3 hours ago
Rand al'Thor
73.2k14240484
answered 6 hours ago
João BravoJoão Bravo
6511
New contributor
João Bravo is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
1
$begingroup$
Nice! Welcome to the site, and +1.
$endgroup$
– Rand al'Thor
6 hours ago
$begingroup$
That’s awesome..unless someday comes with four which is very unlikely, you will get the greencheck soon.
$endgroup$
– Uvc
6 hours ago
$begingroup$
I spent quite a bit trying to come up with a 4-step solution without success. I would be extremely impressed if someone came up with one.
$endgroup$
– João Bravo
5 hours ago
add a comment |
$begingroup$
Just signed up to share some of the solutions (3 of them) I was able to come up with in 6 steps:
1) FIVE $rightarrow$ FAVE $rightarrow$ FARE $rightarrow$ FART $rightarrow$ FAUT $rightarrow$ FAUR $rightarrow$ FOUR
2) FIVE $rightarrow$ FAVE $rightarrow$ FACE $rightarrow$ FACT $rightarrow$ FAUT $rightarrow$ FAUR $rightarrow$ FOUR
3) FIVE $rightarrow$ DIVE $rightarrow$ DOVE $rightarrow$ DORE $rightarrow$ DORR $rightarrow$ DOUR $rightarrow$ FOUR
OH MAN! After a lot of searching I was able to do it in 5 steps (3 solutions):
1) FIVE $rightarrow$ FIRE $rightarrow$ ... FORE .... $rightarrow$ FORD $rightarrow$ FOUD $rightarrow$ FOUR
2) FIVE $rightarrow$ FINE $rightarrow$ FIND/FONE $rightarrow$ FOND $rightarrow$ FOUD $rightarrow$ FOUR
3) FIVE $rightarrow$ FINE $rightarrow$ FINS/FONE $rightarrow$ FONS $rightarrow$ FOUS $rightarrow$ FOUR
I confirmed the words on Anagrammer.
edited 3 hours ago
Rand al'Thor
73.2k14240484
answered 6 hours ago
João BravoJoão Bravo
6511
New contributor
João Bravo is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
Just signed up to share some of the solutions (3 of them) I was able to come up with in 6 steps:
1) FIVE $rightarrow$ FAVE $rightarrow$ FARE $rightarrow$ FART $rightarrow$ FAUT $rightarrow$ FAUR $rightarrow$ FOUR
2) FIVE $rightarrow$ FAVE $rightarrow$ FACE $rightarrow$ FACT $rightarrow$ FAUT $rightarrow$ FAUR $rightarrow$ FOUR
3) FIVE $rightarrow$ DIVE $rightarrow$ DOVE $rightarrow$ DORE $rightarrow$ DORR $rightarrow$ DOUR $rightarrow$ FOUR
OH MAN! After a lot of searching I was able to do it in 5 steps (3 solutions):
1) FIVE $rightarrow$ FIRE $rightarrow$ ... FORE .... $rightarrow$ FORD $rightarrow$ FOUD $rightarrow$ FOUR
2) FIVE $rightarrow$ FINE $rightarrow$ FIND/FONE $rightarrow$ FOND $rightarrow$ FOUD $rightarrow$ FOUR
3) FIVE $rightarrow$ FINE $rightarrow$ FINS/FONE $rightarrow$ FONS $rightarrow$ FOUS $rightarrow$ FOUR
I confirmed the words on Anagrammer.
edited 3 hours ago
Rand al'Thor
73.2k14240484
answered 6 hours ago
João BravoJoão Bravo
6511
New contributor
João Bravo is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited 3 hours ago
Rand al'Thor
73.2k14240484
edited 3 hours ago
Rand al'Thor
73.2k14240484
edited 3 hours ago
Rand al'Thor
73.2k14240484
73.2k14240484
answered 6 hours ago
João BravoJoão Bravo
6511
New contributor
João Bravo is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
answered 6 hours ago
João BravoJoão Bravo
6511
answered 6 hours ago
João BravoJoão Bravo
6511
6511
New contributor
João Bravo is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
João Bravo is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
1
$begingroup$
Nice! Welcome to the site, and +1.
$endgroup$
– Rand al'Thor
6 hours ago
$begingroup$
That’s awesome..unless someday comes with four which is very unlikely, you will get the greencheck soon.
$endgroup$
– Uvc
6 hours ago
$begingroup$
I spent quite a bit trying to come up with a 4-step solution without success. I would be extremely impressed if someone came up with one.
$endgroup$
– João Bravo
5 hours ago
add a comment |
1
$begingroup$
Nice! Welcome to the site, and +1.
$endgroup$
– Rand al'Thor
6 hours ago
$begingroup$
That’s awesome..unless someday comes with four which is very unlikely, you will get the greencheck soon.
$endgroup$
– Uvc
6 hours ago
$begingroup$
I spent quite a bit trying to come up with a 4-step solution without success. I would be extremely impressed if someone came up with one.
$endgroup$
– João Bravo
5 hours ago
1
1
$begingroup$
Nice! Welcome to the site, and +1.
$endgroup$
– Rand al'Thor
6 hours ago
$begingroup$
Nice! Welcome to the site, and +1.
$endgroup$
– Rand al'Thor
6 hours ago
$begingroup$
That’s awesome..unless someday comes with four which is very unlikely, you will get the greencheck soon.
$endgroup$
– Uvc
6 hours ago
$begingroup$
That’s awesome..unless someday comes with four which is very unlikely, you will get the greencheck soon.
$endgroup$
– Uvc
6 hours ago
$begingroup$
I spent quite a bit trying to come up with a 4-step solution without success. I would be extremely impressed if someone came up with one.
$endgroup$
– João Bravo
5 hours ago
$begingroup$
I spent quite a bit trying to come up with a 4-step solution without success. I would be extremely impressed if someone came up with one.
$endgroup$
– João Bravo
5 hours ago
add a comment |
$begingroup$
I can do it in
7 steps: five fire fore fort port pout pour four.
With one more obscure word, I can do it in
6 steps: five fire tire tore torr tour four.
answered 9 hours ago
Gareth McCaughan♦Gareth McCaughan
73.9k3184284
$endgroup$
$begingroup$
Absolute minimum is obviously three..I wrote down in 7 without optimization..it will be fascinating to see if somebody can come up with a 5 step solution to better yours.
$endgroup$
– Uvc
9 hours ago
$begingroup$
Three is definitely not possible because none of FOVE, FIUE, FIVR is a word.
$endgroup$
– Gareth McCaughan♦
9 hours ago
$begingroup$
True..I just made a general statement regarding the minimum steps needed..in the example I cited, was able to do in 2 because middle letters were same. In general, absolute minimum would be..total letters - number of common letters in starting and ending words
$endgroup$
– Uvc
9 hours ago
add a comment |
$begingroup$
I can do it in
7 steps: five fire fore fort port pout pour four.
With one more obscure word, I can do it in
6 steps: five fire tire tore torr tour four.
answered 9 hours ago
Gareth McCaughan♦Gareth McCaughan
73.9k3184284
$endgroup$
$begingroup$
Absolute minimum is obviously three..I wrote down in 7 without optimization..it will be fascinating to see if somebody can come up with a 5 step solution to better yours.
$endgroup$
– Uvc
9 hours ago
$begingroup$
Three is definitely not possible because none of FOVE, FIUE, FIVR is a word.
$endgroup$
– Gareth McCaughan♦
9 hours ago
$begingroup$
True..I just made a general statement regarding the minimum steps needed..in the example I cited, was able to do in 2 because middle letters were same. In general, absolute minimum would be..total letters - number of common letters in starting and ending words
$endgroup$
– Uvc
9 hours ago
add a comment |
$begingroup$
I can do it in
7 steps: five fire fore fort port pout pour four.
With one more obscure word, I can do it in
6 steps: five fire tire tore torr tour four.
answered 9 hours ago
Gareth McCaughan♦Gareth McCaughan
73.9k3184284
$endgroup$
I can do it in
7 steps: five fire fore fort port pout pour four.
With one more obscure word, I can do it in
6 steps: five fire tire tore torr tour four.
answered 9 hours ago
Gareth McCaughan♦Gareth McCaughan
73.9k3184284
edited 9 hours ago
answered 9 hours ago
Gareth McCaughan♦Gareth McCaughan
73.9k3184284
answered 9 hours ago
Gareth McCaughan♦Gareth McCaughan
73.9k3184284
answered 9 hours ago
Gareth McCaughan♦Gareth McCaughan
73.9k3184284
73.9k3184284
$begingroup$
Absolute minimum is obviously three..I wrote down in 7 without optimization..it will be fascinating to see if somebody can come up with a 5 step solution to better yours.
$endgroup$
– Uvc
9 hours ago
$begingroup$
Three is definitely not possible because none of FOVE, FIUE, FIVR is a word.
$endgroup$
– Gareth McCaughan♦
9 hours ago
$begingroup$
True..I just made a general statement regarding the minimum steps needed..in the example I cited, was able to do in 2 because middle letters were same. In general, absolute minimum would be..total letters - number of common letters in starting and ending words
$endgroup$
– Uvc
9 hours ago
add a comment |
$begingroup$
Absolute minimum is obviously three..I wrote down in 7 without optimization..it will be fascinating to see if somebody can come up with a 5 step solution to better yours.
$endgroup$
– Uvc
9 hours ago
$begingroup$
Three is definitely not possible because none of FOVE, FIUE, FIVR is a word.
$endgroup$
– Gareth McCaughan♦
9 hours ago
$begingroup$
True..I just made a general statement regarding the minimum steps needed..in the example I cited, was able to do in 2 because middle letters were same. In general, absolute minimum would be..total letters - number of common letters in starting and ending words
$endgroup$
– Uvc
9 hours ago
$begingroup$
Absolute minimum is obviously three..I wrote down in 7 without optimization..it will be fascinating to see if somebody can come up with a 5 step solution to better yours.
$endgroup$
– Uvc
9 hours ago
$begingroup$
Absolute minimum is obviously three..I wrote down in 7 without optimization..it will be fascinating to see if somebody can come up with a 5 step solution to better yours.
$endgroup$
– Uvc
9 hours ago
$begingroup$
Three is definitely not possible because none of FOVE, FIUE, FIVR is a word.
$endgroup$
– Gareth McCaughan♦
9 hours ago
$begingroup$
Three is definitely not possible because none of FOVE, FIUE, FIVR is a word.
$endgroup$
– Gareth McCaughan♦
9 hours ago
$begingroup$
True..I just made a general statement regarding the minimum steps needed..in the example I cited, was able to do in 2 because middle letters were same. In general, absolute minimum would be..total letters - number of common letters in starting and ending words
$endgroup$
– Uvc
9 hours ago
$begingroup$
True..I just made a general statement regarding the minimum steps needed..in the example I cited, was able to do in 2 because middle letters were same. In general, absolute minimum would be..total letters - number of common letters in starting and ending words
$endgroup$
– Uvc
9 hours ago
add a comment |
$begingroup$
I found a solution in seven steps.
FIVE - FILE
FILE - FILL
FILL - FALL
FALL - FAIL
FAIL - FOIL
FOIL - FOUL
FOUL - FOUR
answered 9 hours ago
Herb WolfeHerb Wolfe
2,28911021
$endgroup$
$begingroup$
Ha! Ninjaed you by nine seconds (though, oops, I wrote mine down in reverse order, which I'll fix).
$endgroup$
– Gareth McCaughan♦
9 hours ago
1
$begingroup$
It is fascinating to see how each mind works through intermediate steps...I went through “Fire” to “Four”.
$endgroup$
– Uvc
9 hours ago
add a comment |
$begingroup$
I found a solution in seven steps.
FIVE - FILE
FILE - FILL
FILL - FALL
FALL - FAIL
FAIL - FOIL
FOIL - FOUL
FOUL - FOUR
answered 9 hours ago
Herb WolfeHerb Wolfe
2,28911021
$endgroup$
$begingroup$
Ha! Ninjaed you by nine seconds (though, oops, I wrote mine down in reverse order, which I'll fix).
$endgroup$
– Gareth McCaughan♦
9 hours ago
1
$begingroup$
It is fascinating to see how each mind works through intermediate steps...I went through “Fire” to “Four”.
$endgroup$
– Uvc
9 hours ago
add a comment |
$begingroup$
I found a solution in seven steps.
FIVE - FILE
FILE - FILL
FILL - FALL
FALL - FAIL
FAIL - FOIL
FOIL - FOUL
FOUL - FOUR
answered 9 hours ago
Herb WolfeHerb Wolfe
2,28911021
$endgroup$
I found a solution in seven steps.
FIVE - FILE
FILE - FILL
FILL - FALL
FALL - FAIL
FAIL - FOIL
FOIL - FOUL
FOUL - FOUR
answered 9 hours ago
Herb WolfeHerb Wolfe
2,28911021
answered 9 hours ago
Herb WolfeHerb Wolfe
2,28911021
answered 9 hours ago
Herb WolfeHerb Wolfe
2,28911021
answered 9 hours ago
Herb WolfeHerb Wolfe
2,28911021
2,28911021
$begingroup$
Ha! Ninjaed you by nine seconds (though, oops, I wrote mine down in reverse order, which I'll fix).
$endgroup$
– Gareth McCaughan♦
9 hours ago
1
$begingroup$
It is fascinating to see how each mind works through intermediate steps...I went through “Fire” to “Four”.
$endgroup$
– Uvc
9 hours ago
add a comment |
$begingroup$
Ha! Ninjaed you by nine seconds (though, oops, I wrote mine down in reverse order, which I'll fix).
$endgroup$
– Gareth McCaughan♦
9 hours ago
1
$begingroup$
It is fascinating to see how each mind works through intermediate steps...I went through “Fire” to “Four”.
$endgroup$
– Uvc
9 hours ago
$begingroup$
Ha! Ninjaed you by nine seconds (though, oops, I wrote mine down in reverse order, which I'll fix).
$endgroup$
– Gareth McCaughan♦
9 hours ago
$begingroup$
Ha! Ninjaed you by nine seconds (though, oops, I wrote mine down in reverse order, which I'll fix).
$endgroup$
– Gareth McCaughan♦
9 hours ago
1
1
$begingroup$
It is fascinating to see how each mind works through intermediate steps...I went through “Fire” to “Four”.
$endgroup$
– Uvc
9 hours ago
$begingroup$
It is fascinating to see how each mind works through intermediate steps...I went through “Fire” to “Four”.
$endgroup$
– Uvc
9 hours ago
add a comment |
$begingroup$
Seven steps (with some obscurer words):
FOUR
LOUR
LOUK
LOCK
LICK
LICE
FICE
FIVE
Something that might lead to five, if it can be completed:
FIVE
FIRE
FIRM
FORM
That's three steps from FIVE to something that shares two letters with FOUR.
answered 9 hours ago
Rand al'ThorRand al'Thor
73.2k14240484
$endgroup$
$begingroup$
And I see others have beaten me to seven even without obscure words ...
$endgroup$
– Rand al'Thor
9 hours ago
$begingroup$
Interesting..in mine..F was never changed..still Ineeded seven..it would be really great if we can find 5 step solution at least.
$endgroup$
– Uvc
9 hours ago
$begingroup$
To make your partial thing into a five you'd need either FOUM or FORR to be a word, and I think neither is one.
$endgroup$
– Gareth McCaughan♦
9 hours ago
add a comment |
$begingroup$
Seven steps (with some obscurer words):
FOUR
LOUR
LOUK
LOCK
LICK
LICE
FICE
FIVE
Something that might lead to five, if it can be completed:
FIVE
FIRE
FIRM
FORM
That's three steps from FIVE to something that shares two letters with FOUR.
answered 9 hours ago
Rand al'ThorRand al'Thor
73.2k14240484
$endgroup$
$begingroup$
And I see others have beaten me to seven even without obscure words ...
$endgroup$
– Rand al'Thor
9 hours ago
$begingroup$
Interesting..in mine..F was never changed..still Ineeded seven..it would be really great if we can find 5 step solution at least.
$endgroup$
– Uvc
9 hours ago
$begingroup$
To make your partial thing into a five you'd need either FOUM or FORR to be a word, and I think neither is one.
$endgroup$
– Gareth McCaughan♦
9 hours ago
add a comment |
$begingroup$
Seven steps (with some obscurer words):
FOUR
LOUR
LOUK
LOCK
LICK
LICE
FICE
FIVE
Something that might lead to five, if it can be completed:
FIVE
FIRE
FIRM
FORM
That's three steps from FIVE to something that shares two letters with FOUR.
answered 9 hours ago
Rand al'ThorRand al'Thor
73.2k14240484
$endgroup$
Seven steps (with some obscurer words):
FOUR
LOUR
LOUK
LOCK
LICK
LICE
FICE
FIVE
Something that might lead to five, if it can be completed:
FIVE
FIRE
FIRM
FORM
That's three steps from FIVE to something that shares two letters with FOUR.
answered 9 hours ago
Rand al'ThorRand al'Thor
73.2k14240484
edited 9 hours ago
answered 9 hours ago
Rand al'ThorRand al'Thor
73.2k14240484
answered 9 hours ago
Rand al'ThorRand al'Thor
73.2k14240484
answered 9 hours ago
Rand al'ThorRand al'Thor
73.2k14240484
73.2k14240484
$begingroup$
And I see others have beaten me to seven even without obscure words ...
$endgroup$
– Rand al'Thor
9 hours ago
$begingroup$
Interesting..in mine..F was never changed..still Ineeded seven..it would be really great if we can find 5 step solution at least.
$endgroup$
– Uvc
9 hours ago
$begingroup$
To make your partial thing into a five you'd need either FOUM or FORR to be a word, and I think neither is one.
$endgroup$
– Gareth McCaughan♦
9 hours ago
add a comment |
$begingroup$
And I see others have beaten me to seven even without obscure words ...
$endgroup$
– Rand al'Thor
9 hours ago
$begingroup$
Interesting..in mine..F was never changed..still Ineeded seven..it would be really great if we can find 5 step solution at least.
$endgroup$
– Uvc
9 hours ago
$begingroup$
To make your partial thing into a five you'd need either FOUM or FORR to be a word, and I think neither is one.
$endgroup$
– Gareth McCaughan♦
9 hours ago
$begingroup$
And I see others have beaten me to seven even without obscure words ...
$endgroup$
– Rand al'Thor
9 hours ago
$begingroup$
And I see others have beaten me to seven even without obscure words ...
$endgroup$
– Rand al'Thor
9 hours ago
$begingroup$
Interesting..in mine..F was never changed..still Ineeded seven..it would be really great if we can find 5 step solution at least.
$endgroup$
– Uvc
9 hours ago
$begingroup$
Interesting..in mine..F was never changed..still Ineeded seven..it would be really great if we can find 5 step solution at least.
$endgroup$
– Uvc
9 hours ago
$begingroup$
To make your partial thing into a five you'd need either FOUM or FORR to be a word, and I think neither is one.
$endgroup$
– Gareth McCaughan♦
9 hours ago
$begingroup$
To make your partial thing into a five you'd need either FOUM or FORR to be a word, and I think neither is one.
$endgroup$
– Gareth McCaughan♦
9 hours ago
add a comment |
$begingroup$
In this answer I will show that five steps is the minimum number required (from the answer by @JoãoBravo).
Suppose by contradiction that there are four. Then the sequence will be of the form
F i v e, _ _ _ _, _ _ _ _, _ _ _ _, F o u r.
If the first letter remains unchanged the whole way through, the sequence is
F i v e, F _ _ _, F _ _ _, F _ _ _, F o u r.
Therefore, at each step, one of i v e must be changed to match o u r, without any deviations. This is clearly impossible.
Now suppose that the first letter is changed to a letter ¬ the whole way through. Then the sequence is
F i v e, ¬ _ _ _, ¬ _ _ _, ¬ _ _ _, F o u r.
However, changing from i v e to o u r requires three steps, which are not allowed in this arrangement as the first and fourth steps are wasted.
Thus the only combinations left are
F i v e, F _ _ _, ¬ _ _ _, ¬ _ _ _, F o u r.
This is also impossible as there are not enough steps (one) to change from i v e to o u r.
F i v e, ¬ _ _ _, F _ _ _, F _ _ _, F o u r.
Steps two and three are pointless/a waste of steps so this case can be easily discarded.
F i v e, F _ _ _, F _ _ _, ¬ _ _ _, F o u r.
Yet again, steps three and four are useless for the same reason above.
F i v e, ¬ _ _ _, ¬ _ _ _, F _ _ _, F o u r.
There are not enough steps to make the transition i v e to o u r as the third step is wasted in converting ¬ to F.
F i v e, F _ _ _, ¬ _ _ _, F _ _ _, F o u r.
Again, not sufficient due to the same reasoning above.
F i v e, ¬ _ _ _, F _ _ _, ¬ _ _ _, F o u r.
This is also useless.
answered 5 hours ago
TheSimpliFireTheSimpliFire
2,351534
$endgroup$
$begingroup$
Yes..for this case, it is true...my upcoming puzzle will lend to lot of interesting analysis like this.
$endgroup$
– Uvc
5 hours ago
add a comment |
$begingroup$
In this answer I will show that five steps is the minimum number required (from the answer by @JoãoBravo).
Suppose by contradiction that there are four. Then the sequence will be of the form
F i v e, _ _ _ _, _ _ _ _, _ _ _ _, F o u r.
If the first letter remains unchanged the whole way through, the sequence is
F i v e, F _ _ _, F _ _ _, F _ _ _, F o u r.
Therefore, at each step, one of i v e must be changed to match o u r, without any deviations. This is clearly impossible.
Now suppose that the first letter is changed to a letter ¬ the whole way through. Then the sequence is
F i v e, ¬ _ _ _, ¬ _ _ _, ¬ _ _ _, F o u r.
However, changing from i v e to o u r requires three steps, which are not allowed in this arrangement as the first and fourth steps are wasted.
Thus the only combinations left are
F i v e, F _ _ _, ¬ _ _ _, ¬ _ _ _, F o u r.
This is also impossible as there are not enough steps (one) to change from i v e to o u r.
F i v e, ¬ _ _ _, F _ _ _, F _ _ _, F o u r.
Steps two and three are pointless/a waste of steps so this case can be easily discarded.
F i v e, F _ _ _, F _ _ _, ¬ _ _ _, F o u r.
Yet again, steps three and four are useless for the same reason above.
F i v e, ¬ _ _ _, ¬ _ _ _, F _ _ _, F o u r.
There are not enough steps to make the transition i v e to o u r as the third step is wasted in converting ¬ to F.
F i v e, F _ _ _, ¬ _ _ _, F _ _ _, F o u r.
Again, not sufficient due to the same reasoning above.
F i v e, ¬ _ _ _, F _ _ _, ¬ _ _ _, F o u r.
This is also useless.
answered 5 hours ago
TheSimpliFireTheSimpliFire
2,351534
$endgroup$
$begingroup$
Yes..for this case, it is true...my upcoming puzzle will lend to lot of interesting analysis like this.
$endgroup$
– Uvc
5 hours ago
add a comment |
$begingroup$
In this answer I will show that five steps is the minimum number required (from the answer by @JoãoBravo).
Suppose by contradiction that there are four. Then the sequence will be of the form
F i v e, _ _ _ _, _ _ _ _, _ _ _ _, F o u r.
If the first letter remains unchanged the whole way through, the sequence is
F i v e, F _ _ _, F _ _ _, F _ _ _, F o u r.
Therefore, at each step, one of i v e must be changed to match o u r, without any deviations. This is clearly impossible.
Now suppose that the first letter is changed to a letter ¬ the whole way through. Then the sequence is
F i v e, ¬ _ _ _, ¬ _ _ _, ¬ _ _ _, F o u r.
However, changing from i v e to o u r requires three steps, which are not allowed in this arrangement as the first and fourth steps are wasted.
Thus the only combinations left are
F i v e, F _ _ _, ¬ _ _ _, ¬ _ _ _, F o u r.
This is also impossible as there are not enough steps (one) to change from i v e to o u r.
F i v e, ¬ _ _ _, F _ _ _, F _ _ _, F o u r.
Steps two and three are pointless/a waste of steps so this case can be easily discarded.
F i v e, F _ _ _, F _ _ _, ¬ _ _ _, F o u r.
Yet again, steps three and four are useless for the same reason above.
F i v e, ¬ _ _ _, ¬ _ _ _, F _ _ _, F o u r.
There are not enough steps to make the transition i v e to o u r as the third step is wasted in converting ¬ to F.
F i v e, F _ _ _, ¬ _ _ _, F _ _ _, F o u r.
Again, not sufficient due to the same reasoning above.
F i v e, ¬ _ _ _, F _ _ _, ¬ _ _ _, F o u r.
This is also useless.
answered 5 hours ago
TheSimpliFireTheSimpliFire
2,351534
$endgroup$
In this answer I will show that five steps is the minimum number required (from the answer by @JoãoBravo).
Suppose by contradiction that there are four. Then the sequence will be of the form
F i v e, _ _ _ _, _ _ _ _, _ _ _ _, F o u r.
If the first letter remains unchanged the whole way through, the sequence is
F i v e, F _ _ _, F _ _ _, F _ _ _, F o u r.
Therefore, at each step, one of i v e must be changed to match o u r, without any deviations. This is clearly impossible.
Now suppose that the first letter is changed to a letter ¬ the whole way through. Then the sequence is
F i v e, ¬ _ _ _, ¬ _ _ _, ¬ _ _ _, F o u r.
However, changing from i v e to o u r requires three steps, which are not allowed in this arrangement as the first and fourth steps are wasted.
Thus the only combinations left are
F i v e, F _ _ _, ¬ _ _ _, ¬ _ _ _, F o u r.
This is also impossible as there are not enough steps (one) to change from i v e to o u r.
F i v e, ¬ _ _ _, F _ _ _, F _ _ _, F o u r.
Steps two and three are pointless/a waste of steps so this case can be easily discarded.
F i v e, F _ _ _, F _ _ _, ¬ _ _ _, F o u r.
Yet again, steps three and four are useless for the same reason above.
F i v e, ¬ _ _ _, ¬ _ _ _, F _ _ _, F o u r.
There are not enough steps to make the transition i v e to o u r as the third step is wasted in converting ¬ to F.
F i v e, F _ _ _, ¬ _ _ _, F _ _ _, F o u r.
Again, not sufficient due to the same reasoning above.
F i v e, ¬ _ _ _, F _ _ _, ¬ _ _ _, F o u r.
This is also useless.
answered 5 hours ago
TheSimpliFireTheSimpliFire
2,351534
answered 5 hours ago
TheSimpliFireTheSimpliFire
2,351534
answered 5 hours ago
TheSimpliFireTheSimpliFire
2,351534
answered 5 hours ago
TheSimpliFireTheSimpliFire
2,351534
2,351534
$begingroup$
Yes..for this case, it is true...my upcoming puzzle will lend to lot of interesting analysis like this.
$endgroup$
– Uvc
5 hours ago
add a comment |
$begingroup$
Yes..for this case, it is true...my upcoming puzzle will lend to lot of interesting analysis like this.
$endgroup$
– Uvc
5 hours ago
$begingroup$
Yes..for this case, it is true...my upcoming puzzle will lend to lot of interesting analysis like this.
$endgroup$
– Uvc
5 hours ago
$begingroup$
Yes..for this case, it is true...my upcoming puzzle will lend to lot of interesting analysis like this.
$endgroup$
– Uvc
5 hours ago
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%2f84854%2fas-easy-as-three-two-one-how-fast-can-you-go-from-five-to-four%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$
Would it be worth investigating what the longest path would be (without using any word multiple times)?
$endgroup$
– Cloudy7
6 hours ago
$begingroup$
Definitely...working on a puzzle along those lines..hopefully, I will have it out in next 3 days or so.
$endgroup$
– Uvc
6 hours ago
$begingroup$
@Cloudy7 Finding the longest path sounds like an open-ended puzzle, which are now off-topic :-(
$endgroup$
– Rand al'Thor
3 hours ago