Cody

# Problem 2700. Simulate one complete step in the Biham–Middleton–Levine traffic model

Solution 2065134

Submitted on 20 Dec 2019 by Sumit Gavasane
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

### Test Suite

Test Status Code Input and Output
1   Pass
a_in = ... [0 0 0 2 1 1 0 0 0 0 2 0 0 0 0 1]; a_out_correct = ... [0 0 0 0 0 1 1 2 0 0 0 0 1 0 2 0]; assert(isequal(traffic_step(a_in),a_out_correct))

a_out = 0 0 0 2 1 1 0 0 0 0 2 0 0 0 0 1 sa = 4 4 sar = 4 sac = 4 a_out = 0 0 0 2 1 0 1 0 0 0 2 0 0 0 0 1 a_out = 0 0 0 2 0 1 1 0 0 0 2 0 0 0 0 1 a_out = 0 0 0 2 0 1 1 0 0 0 2 0 1 0 0 0 a_out = 0 0 0 2 0 1 1 0 0 0 0 0 1 0 2 0 a_out = 0 0 0 0 0 1 1 2 0 0 0 0 1 0 2 0 a_out = 0 0 0 0 0 1 1 2 0 0 0 0 1 0 2 0

2   Pass
a_in = ... [0 0 2 2 0 0]; a_out_correct = ... [2 0 0 0 0 2]; assert(isequal(traffic_step(a_in),a_out_correct))

a_out = 0 0 2 2 0 0 sa = 2 3 sar = 2 sac = 3 a_out = 2 0 2 0 0 0 a_out = 2 0 0 0 0 2 a_out = 2 0 0 0 0 2

3   Pass
a_in = ... [1 0 2 2 0 0]; a_out_correct = ... [2 1 0 0 0 2]; assert(isequal(traffic_step(a_in),a_out_correct))

a_out = 1 0 2 2 0 0 sa = 2 3 sar = 2 sac = 3 a_out = 0 1 2 2 0 0 a_out = 2 1 2 0 0 0 a_out = 2 1 0 0 0 2 a_out = 2 1 0 0 0 2

4   Pass
a_in = ... [0 0 2 1 1 1 2 0 0]; a_out_correct = ... [2 0 2 1 1 1 0 0 0]; assert(isequal(traffic_step(a_in),a_out_correct))

a_out = 0 0 2 1 1 1 2 0 0 sa = 3 3 sar = 3 sac = 3 a_out = 2 0 2 1 1 1 0 0 0 a_out = 2 0 2 1 1 1 0 0 0

5   Pass
a_in = ... [0 2 2 2 0 0 1 1 0 2 0 0 0 0 0 0 2 0 1 1 0 1 1 2 0 0 1 2 0 0 0 0 0 2 0 1]; a_out_correct = ... [0 2 2 2 0 0 0 1 1 2 0 0 0 0 0 2 2 0 0 1 1 1 1 0 0 0 1 0 0 2 1 0 0 2 0 0]; assert(isequal(traffic_step(a_in),a_out_correct))

a_out = 0 2 2 2 0 0 1 1 0 2 0 0 0 0 0 0 2 0 1 1 0 1 1 2 0 0 1 2 0 0 0 0 0 2 0 1 sa = 6 6 sar = 6 sac = 6 a_out = 0 2 2 2 0 0 1 0 1 2 0 0 0 0 0 0 2 0 1 1 0 1 1 2 0 0 1 2 0 0 0 0 0 2 0 1 a_out = 0 2 2 2 0 0 0 1 1 2 0 0 0 0 0 0 2 0 1 1 0 1 1 2 0 0 1 2 0 0 0 0 0 2 0 1 a_out = 0 2 2 2 0 0 0 1 1 2 0 0 0 0 0 0 2 0 1 0 1 1 1 2 0 0 1 2 0 0 0 0 0 2 0 1 a_out = 0 2 2 2 0 0 0 1 1 2 0 0 0 0 0 0 2 0 0 1 1 1 1 2 0 0 1 2 0 0 0 0 0 2 0 1 a_out = 0 2 2 2 0 0 0 1 1 2 0 0 0 0 0 0 2 0 0 1 1 1 1 2 0 0 1 2 0 0 1 0 0 2 0 0 a_out = 0 2 2 2 0 0 0 1 1 2 0 0 0 0 0 0 2 0 0 1 1 1 1 0 0 0 1 2 0 2 1 0 0 2 0 0 a_out = 0 2 2 2 0 0 0 1 1 0 0 0 0 0 0 2 2 0 0 1 1 1 1 0 0 0 1 2 0 2 1 0 0 2 0 0 a_out = 0 2 2 0 0 0 0 1 1 2 0 0 0 0 0 2 2 0 0 1 1 1 1 0 0 0 1 2 0 2 1 0 0 2 0 0 a_out = 0 2 2 2 0 0 0 1 1 2 0 0 0 0 0 2 2 0 0 1 1 1 1 0 0 0 1 2 0 2 1 0 0 0 0 0 a_out = 0 2 2 2 0 0 0 1 1 2 0 0 0 0 0 2 2 0 0 1 1 1 1 0 0 0 1 0 0 2 1 0 0 2 0 0 a_out = 0 2 2 2 0 0 0 1 1 2 0 0 0 0 0 2 2 0 0 1 1 1 1 0 0 0 1 0 0 2 1 0 0 2 0 0

6   Pass
a_in = ... [0 1 1 1 0 0 0 0]; a_out_correct = ... [1 0 1 1 0 0 0 0]; assert(isequal(traffic_step(a_in),a_out_correct))

a_out = 0 1 1 1 0 0 0 0 sa = 2 4 sar = 2 sac = 4 a_out = 1 1 1 0 0 0 0 0 a_out = 1 1 0 1 0 0 0 0 a_out = 1 0 1 1 0 0 0 0 a_out = 1 0 1 1 0 0 0 0

7   Pass
a_in = ... [0 2 2]; a_out_correct = ... [2 0 2]; assert(isequal(traffic_step(a_in),a_out_correct))

a_out = 0 2 2 sa = 3 1 sar = 3 sac = 1 a_out = 2 2 0 a_out = 2 0 2 a_out = 2 0 2

### Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!