Here is the truth table for an implication:
$$ \begin{array}{ccccc}
P & & Q & & P \to Q \\
T & & T & & T \\
T & & F & & F \\
F & & T & & T \\
F & & F & & T \end{array} $$
You can think of an implication as a conditional promise. If you keep the promise, it's true. If you break the promise, it's false.
If I tell my kids, "I'll give you a cookie if you clean up." Then they clean up. I better give them a cookie. If I don't, I've lied. However, if they don't clean up, I can either give them a cookie or not. I didn't promise either if they didn't keep up their end of the bargain.
So in other words, an implication is false only if the hypothesis is true and conclusion is false.
Logically $P \to Q$ is equivalent to $\neg P \vee Q$
I had a computer science professor who was fond of promising his kids things given a false premise. This way he wasn't compelled to follow through. Example: "If the moon is made of green cheese, I'll give you an x-box."
Your distinction between "true" and "logical value 1" is not one that formal logic generally observes. Here "1" and "true" are synonyms for the same concept.
The meaning of the $\Rightarrow$ connective is what its truth table says it is, neither more nor less -- the truth table defines the connective (in classical logic). Fancy words such as "implication" or "if ... then" are just mnemonics to help you remember what the truth table is, and what the connective is good for -- but when there's a conflict between your intuitive understanding of those words and the truth table, the truth table wins over the words.
The important thing to realize is that $\Rightarrow$ is designed to be used together with a $\forall$. If you try to understand its naked truth table it doesn't seem very motivated -- certainly it can't express any notions of cause and effect, because the truth values of $p$ and $q$ just are what they are in any given world. As long as we're only looking at one possible state of the world, there's not much intuitive meaning in asking "what if $p$ held?" because that implies a wish to consider a world where the truth value of $p$ were different.
The device of standard formal logic that allows us to speak about different worlds is quantifiers. What we want to say is something like
In every possible world where I put in a coin, the machine will spit out a soda.
(though that is a little simplified -- we want to consider a "possible world" to be one where I made a different decision about my coins, not to be one where the machine had inexplicably stopped working even though it does work now. But let's sweep that problem aside for now).
This is the same as saying
In every possible world period, it is true that either I don't put in a coin, or I get a soda.
which logically becomes, using the truth table
For all worlds $x$, the proposition (In world $x$ I put in a coin) $\Rightarrow$ (In world $x$ I get a soda) is true.
Since there's a quantification going on, the truth value of the whole thing is not spoiled by the fact that there are some possible worlds with a broken machine where the $\Rightarrow$ evaluates to true. What interests us is just whether the $\Rightarrow$ evaluates to true every time or not every time. As long as we're in the "not every time" context, the machine is broken, and that conclusion is not affected by the "spurious" local instances of $\Rightarrow$ evaluating to true in particular worlds.
The construction that models (more or less) our intuition about cause and effect (or "if ... then") is not really $\Rightarrow$, but the combination of $\forall\cdots\Rightarrow$.
Unfortunately in the usual style of mathematical prose it is often considered acceptable to leave the quantification implicit, but logically it is there nevertheless. (And to add insult to injury, many systems of formal logic will implicitly treat formulas with free variables as universally quantified too, so even there you get to be sloppy and not call attention to the fact that there's quantification going on.)
Note also that this is the case even in propositional logic where there are no explicit quantifiers at all. To claim that $P\to Q$ is logically valid is to say that in all valuations where $P$ is true, $Q$ will also be true -- there's a quantification built into the meta-logical concept of "logically valid".
Best Answer
As a logical proposition, the material conditional $A \implies B$ is a very weak one: as you've noticed, it's very easy to satisfy it just by accident. In fact, this happens whenever $A$ is false, or whenever $B$ is true. Thus, merely observing that $A \implies B$, for some specific $A$ and $B$, says very little.
Instead, the usefulness of implication lies in the fact that, precisely because of its weakness, it is often possible to assert $A \implies B$ as a universal statement (either an axiom or a provable theorem) that holds for any valuation of any free variables mentioned in the propositions $A$ and $B$.
For example, consider the statement: $$x > 2 \;\land\; x \text{ is prime} \implies x \text{ is odd}.$$ Merely observing that this statement holds for some $x$ says very little — there are plenty of numbers for which it is trivially true, either because they are odd, or because they are not primes greater than 2. What makes this statement useful is that we can prove that it holds for all $x$ — there isn't a single number which would be greater than 2 and prime, but not odd.