MARCO POLO


 MARCO POLO.   Written by John Lucarotti.   7 Episodes.
               22nd February - 4th April 1964.
             
 The Roof of the World, The Singing Sands, Five Hundred Eyes, Wall of Lies,
 Rider from Shang-Tu, Mighty Kublai Khan, Assassin at Peking.

 COMPANIONS:- Ian, Barbara and Susan.

   The TARDIS lands in 1289 where the time-travellers meet Marco Polo who is
 on his way to Kublai Khan's court in Peking. He is accompanied by a warlord
 named Tegana, a peace emissary from a rival Mongol leader and a Chinese
 girl called Ping-Cho. Marco Polo forces the Doctor to join the caravan,
 hoping to present the TARDIS to Kublai Khan. Tegana also wants the TARDIS
 and attempts to steal the ship, thinking it can fly. Tegana tries to poison
 the party's water supply and drills holes in their water barrels, then
 escapes on the last horse. Because of the intense night cold, condensation
 forms on the TARDIS and the party survives.
   Upon arriving in Peking, the Doctor meets Kublai Khan and plays him at
 backgammon. At first, the Doctor plays well and wins 35 elephants, 4000
 horses and 25 tigers but soon the tide turns and he gambles away the TARDIS.
 When he exposes Tegana and saves Khan's life, the TARDIS keys are returned
 to him.

Comments

Post a Comment

Popular posts from this blog

BOTTOM LIVE script

                                  BOTTOM                                   ======                     by Adrian Edmondson and Rik Mayall                                 Bottom Live                                 ===========                               Richie  Rik Mayall                                Eddie  Adrian Edmondson Introduction ------------ [Opening shot of theatre, with huge pictures of Richie and Eddie. Caption: "Live fro...
Read more

Evidence supporting quantum information processing in animals

              Evidence supporting quantum            information processing in animals                    James A. Donald                    1068 Fulton Av                    Sunnyvale, CA 94089-1505                    USA I show that quantum systems can rapidly solve some problems for which finite state machines require a non- polynomially large time. This class of problems is closely related to the class of problems that animals can solve rapidly and effortlessly, but are intractable for computers by all known algorithms. 1. Introduction      Animals, including very simple animals, can rapidly and effortlessly perceive objects, whereas computers take nonpolynomial time to do this by all...
Read more

ARMIES OF CHAOS

                          ARMIES OF CHAOS -      Before anyone proposes more gun control, he or she should know  about a simple, deadly weapon 4 times as powerful as Dirty Harry's  legendary .44 Magnum -- and at least twice as concealable -- that  _can't_ controlled.        This simple, deadly weapon can be made by anyone -- even a  child -- with unpowered hand tools in an hour's time using $5 worth  of materials, most of which are available around the house anyway.   In traditional form it's reusable an unlimited number of times, and  modern plastics have rendered its disposable version electronically  undetectable.  You can clear a room with such a weapon (more of a  hand-held directional grenade than a gun -- sort of a recycleable  Claymore mine) and it's just one of hundreds of similar time-proven  designs. ...
Read more