CPMagical CP Library

Problem solution · Turing

CCC 2003 S1 - Snakes and Ladders

CCC 2003 S1 - Snakes and Ladders: a Turing solution using direct simulation. Learn the idea, check the complexity, and read the full code, with credit to CCCSolutions.

Technique
Direct simulation
Source
CCCSolutions
Length
40 lines
Start with the idea.

Try the problem first. If you get stuck, read the approach below, then write your own solution. The full code is at the bottom.

Approach

Direct simulation

For CCC 2003 S1 - Snakes and Ladders, the implementation follows the problem’s operations directly while maintaining only the state needed for the next decision.

  1. Translate each rule into one explicit state update.
  2. Maintain the invariant after every processed item.
  3. Return the accumulated state once all relevant input has been handled.

Code notes

  • 40 lines of Turing from the credited upstream file ccc03s1.t.
  • The implementation keeps its working state in language-native values and containers.
  • No explicit loop blocks detected.

Complexity

Count the number and nesting of passes over the input, then include the maintained containers in the memory estimate.

Check the problem constraints before deciding whether this complexity will pass.

Source

Code and credit

This code comes from CCCSolutions by CCCSolutions contributors · Milliken Mills High School and is used under the MIT licence.

Open problem ↗Original source ↗
Full codeCCC 2003 S1 - Snakes and Ladders · TuringTuring
Use this to learn the idea, then write your own version.
% CCC 2003% Problem J3/S1: Snakes and Ladders%% simple dice roll input, move the piece. watch for 3 snakes and 3 ladders% also watch for going over 100. Declare if win or quit.%% keyboard and screen I/O var place, x : intplace := 1loop    put "Enter sum of dice:"    get x    if x not= 0 then        if place + x <= 100 then            place := place + x        end if        if place = 9 then            place := 34        elsif place = 40 then            place := 64        elsif place = 67 then            place := 86        elsif place = 99 then            place := 77        elsif place = 90 then            place := 48        elsif place = 54 then            place := 19        end if        put "You are now on square ", place    end if    exit when x = 0 or place = 100end loopif place = 100 then    put "You Win!"else    put "You Quit!"end if

Keep practising

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗