LS056 - Fortune Flowers

«  Hat Trick
Fortune Flowers
Right the Routes »


Fortune Flowers
PL4056B.png
PL4056T.png
Puzzle Number 056
Puzzle Name Fortune Flowers
Picarats Given 30 Picarats
Type Button
Location Florist
Previous Puzzle LS055 - Hat Trick
Next Puzzle LS057 - Right the Routes

This is the fifty-sixth puzzle in Professor Layton and the Last Specter. To access this puzzle, you must talk to Augustus. In order to solve this puzzle, you must determine which bouquet of flowers will give the man the best answers from his three games. After solving this puzzle, you will receive the course Augustus's Business for the Train mini-game.

Contents

[edit] Hints

Hint One
    Consider the number of petals on each single flower in each bouquet. It all starts there.

Hint Two
    The man intends to play three different fortune-telling games with the flowers he buys.

    Which outcome is best in each game? Keep in mind that the man probably has a preferred outcome for the first two, but he does not actually know which gift would be best for is sweetheart.

Hint Three
    Try thinking about it from the florist's point of view. Remember, it's the florist who will be selecting the bouquet for the young man.

Super Hint
    For the young man, the best outcomes are "she loves me" and "happy."

    The florist, the best outcome for the sweetheart's give would be the "bouquet," because that means he could sell the young man another bunch of flowers! Counting out on the pets, which flower would give you those three outcomes?


[edit] Messages

[edit] When Failed

Too bad!

Put the petal to the metal, and try again.

[edit] When Completed

Correct!

The young man took away the flowers with 13 petals each. The results of his games were "she loves me," "happy," and "bouquet".

It seems reasonable that a florist would want the man to buy another bouquet, right?

[edit] Solution

The bouquet with 13 petals will give the best answers.

[edit] Progress

2200 Picarats and 240 Hint Coins.



Last edited by Squiggle today at 22:12
This page has been accessed 393 times.