Stripview

17 ThumbsUp

The Amazing Spider-Lamb Challenge #1

ryoko on 8. Jun, 2011 — Lang: English

The Amazing Spider-Lamb Challenge #1
  • Description

    Here is a challenge for you to try. Answers will be posted on Friday. You can find this strip and the answers on my Math blog also! http://mistressofmath.blogspot.com/

    There are five answers total:

    1. Number of different direct routes from Point A to Point B

    2. Number of different direct routes from Point A to Point C

    3. Number of different direct routes from Point A to Point D

    4. Number of different direct routes from Point A to Point E

    5. Number of different direct routes from Point A to Point F


    GOOD LUCK!

    This strip is a reply to Spider-Lamb, Ryoko's Math Blog

    Transcript

    Expand

    pi

    fountain

    Pythagoras Park

    Archimedes Avenue

    Euclid Avenue

    F
    i
    b
    o
    n
    a
    c
    c
    i

    H
    i
    g
    h
    w
    a
    y

    E
    u
    l
    e
    r

    S
    t
    r
    e
    e
    t

    H
    i
    l
    b
    e
    r
    t

    S
    t
    r
    e
    e
    t

    N
    e
    w
    t
    o
    n

    S
    t
    r
    e
    e
    t

    P
    a
    c
    a
    l

    S
    t
    r
    e
    e
    t

    Riemann Road

    H
    y
    p
    a
    t
    i
    a

    B
    o
    u
    l
    e
    v
    a
    r
    d

    Gauss Drive

    Descartes Drive

    A

    B

    C

    D

    E

    F

    I must capture those clones!

    Points B - F represent the clones I made of myself which are currently wreaking havoc on the city. Bwahahaha... Good luck Spider-Lamb!

    Once again, I need to save the city from the Greasy Goblin. Here is a map of my city, Calcutopia. Point A represents the Police Station.

    I am currently at the Police Station (Point A). I need to travel from Point A to Points B - F so I can capture The Greasy Goblin's clones. After I capture a clone, I need to take him to the Police Station for booking before I can attempt to capture each of the other clones. In the interest of time, I should only take direct routes. This means no back tracking! Help me determine how many different ways I can get from Point A to each of the other points. In other words, how many different direct routes could I take to get from Point A to Point B, Point A to Point C, Point A to Point D, etc.

    Tags:
    math, mathematics, spider-lamb, logic
Sign in or register to comment.

Comments

  • terwallace 9.6.2011
    AAAH! Logic! My mortal enemy!!!! :)
  • Drachir 9.6.2011
    Looking good. nice
  • ryoko 9.6.2011
    @35sheep: correct!
  • 35sheep 9.6.2011
    "if you go east you can never go west because this is backtracking and if you go south you can never go north because this is backtracking."

    AHA! That I didn't get the first time!

    So A-B is 6 different ways ...
  • bluesockmonkey 9.6.2011
    i would pound the puzzle with a hammer until it submits...
  • ryoko 9.6.2011
    You do have all the variables!

    Direct = no backtracking

    Think about it, from point A you can go north, south, east, or west.

    North and west take you off the map. So you can only start out going east or south if you go east you can never go west because this is backtracking and if you go south you can never go north because this is backtracking.

    Hope this helps. And yes I do like shoes! How did you know?
  • Maoriman 8.6.2011
    I've just spent an hour on this and I still have no idea:/ Damn you Ryoko, damn you to hell;-D

    But since an answer is demanded, here it is... Definition of direct - straight line between two points... and since you can't go in a straight line between any of the points I'd have to say zero. Now if your definition of direct means that one can follow the streets and turn corners without that being deemed as indirect, then I would need to know more about you and what time of the day it is; if it's near a meal time, then I would have to factor in that you would probably stop for udon and soba at a noodle restaurant along the way. And if you stopped for something to eat, then that would mean it was indirect and thus disqualifying that route. Or if it was payday, and one of the streets you need to take has a shoe store that is currently in the throes of performing a clearance sale - and you being the lady I think you to be - you would probably be tempted to stop in and purchase a pair of those shoes you have so long desired, thus disqualifying that route from your puzzle too.

    Ahhhhhhhhhhhhhhhh maths I hate it when one doesn't have all the variables...

    edited by owner

  • calm 8.6.2011
    Hmmm...let's see... :-)
  • NooniePuuBunny 8.6.2011
    I'll try again when I don't have a migraine. x_x
  • ourWorld_Online 8.6.2011
    If my def. of direct is right, then I'd say that there are exactly 2 direct routes to get to each clone.
  • cirkuz 8.6.2011
    i'd go A_B - A_C - A_D - A_E - A_F

    edited by owner

  • ryoko 8.6.2011
    As long as you only use direct routes you may go anywhere you want to go...
  • 35sheep 8.6.2011
    Oy - that's a tough one! Are we allowed to go into the park?
  • Azzie13 8.6.2011
    I have only tried from point A to point B I came out of 5
    I hope this is correct.
  • SnakeYukin 8.6.2011
    No! I don't want to think about it. I shall not think about it or my head might hurt.
  • Fizzle 8.6.2011
    Wut?
  • supergogeta 8.6.2011
    umm wha?

Displaying 17 out of 17 comments.