Main
  About Cybernetics
  Olympiad Regulations
  Olympiad History
 
  • Photo
  • Video



  •   Examples of Tasks
      Organizing Committee
      Current Olympiad
     
  • Teams Registration
  • Participants
  • Olympiad Results

  • Login:

    Password:

     
     RUS / ENG
        News
     
    Task 2010-2. “Gambling chess”


    Two gamblers after the closure of casinos in the city have decided to bring the gambling excitement to chess, and slightly changed their rules: at first the player throws a hexagonal dice, which determines what piece he will go. And then he throws icosahedra to determine a number of moves in a row that the player must do with this piece before enemies turn.

    Task. Determine minimum number of moves needed by the knight standing on cell N to send check to the king standing on cell M if cells T1, T2, …, Tn are set by friendly pieces therefore knight cannot stand there.

    Streams. Input stream contains one positive integer n and names of the cells T1, T2, …, Tn, N and M in chess notation. Output stream should contain one positive integer or -1 if there is no chance to send check to the king.

    Example
    Input stream:
    3 A2 D3 F3 E1 D7
    Output stream:
    4

     
       
    19.02.2013 17:19
     
    Cyber XIV. Results of Distance Session of Olympiad . . . -->

    21.01.2013 15:59
     
    Key for a training session . . . -->

    29.02.2012 12:41
     
    Video of the Olympiad . . . -->

    29.02.2012 12:12
     
    The results of Main Session of Olympiad on Cybernetics . . . -->

    News archive
     
    Back to news archive -->


    Today visitings: 386
    All visitings: 830022
    Web ststistics: