Cody

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

Solution 1947610

Submitted on 24 Sep 2019 by Augusto Mazzei
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))

0 0 0 2.0000 0 1.1000 1.1000 0 0 0 2.0000 0 1.1000 0 0 0 a_in = 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))

0 0 2 2 0 0 a_in = 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))

0 1.1000 2.0000 2.0000 0 0 a_in = 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))

0 0 2 1 1 1 2 0 0 a_in = 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))

0 2.0000 2.0000 2.0000 0 0 0 1.1000 1.1000 2.0000 0 0 0 0 0 0 2.0000 0 0 1.1000 1.1000 1.0000 1.0000 2.0000 0 0 1.0000 2.0000 0 0 1.1000 0 0 2.0000 0 0 a_in = 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))

1.1000 0 1.1000 1.1000 0 0 0 0 a_in = 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))

0 2 2 a_in = 2 0 2