freezed
/
my-psb
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Refactor propagation in a function 

That's better! I want more test cases to check my algorythm !
This commit is contained in:
Freezed 2020-07-16 12:06:45 +02:00
parent 2119783dad
commit 0bd7ff72b0
1 changed files with 41 additions and 23 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

64
technical_tests/sand_grain_drop.py
View File

@ -36,38 +36,56 @@ def main(pile, n):
"""
size = len(pile)
x_max, y_max = size - 1, size - 1
center = int((size - 1) / 2)
while n != 0:
pile[center][center] += 1
# find cells > 3
for x in range(size):
for y in range(size):
if pile[x][y] > 3:
pile[x][y] -= 4
# update west neighbor
if x < x_max:
pile[x + 1][y] += 1
# update east neighbor
if x > 0:
pile[x - 1][y] += 1
# update north neighbor
if y < y_max:
pile[x][y + 1] += 1
# update south neighbor
if y > 0:
pile[x][y - 1] += 1
do_propagation(pile)
n -= 1
# All sand grain are dropped, let's finish propagations
while True in [4 in row for row in pile]:
do_propagation(pile)
return pile
def do_propagation(pile):
"""
Walk through the pile to propagate sand grains
:tests:
>>> test_case = [[0,0,4,0,0],[0,2,0,2,0],[4,0,4,0,4],[0,2,0,2,0],[0,0,4,0,0]]
>>> do_propagation(test_case)
>>> print(test_case)
[[0, 1, 0, 1, 0], [1, 2, 2, 2, 1], [0, 2, 0, 2, 0], [1, 2, 2, 2, 1], [0, 1, 0, 1, 0]]
"""
size = len(pile)
x_max, y_max = size - 1, size - 1
# find cells > 3
for x in range(size):
for y in range(size):
if pile[x][y] > 3:
pile[x][y] -= 4
# update west neighbor
if x < x_max:
pile[x + 1][y] += 1
# update east neighbor
if x > 0:
pile[x - 1][y] += 1
# update north neighbor
if y < y_max:
pile[x][y + 1] += 1
# update south neighbor
if y > 0:
pile[x][y - 1] += 1
if __name__ == "__main__":
import doctest