moparisthebest/minetest
1
0
Fork 0
mirror of https://github.com/moparisthebest/minetest synced 2024-11-16 06:15:06 -05:00
Code Issues Releases Wiki Activity

falling: walk 4 additional diagonally down directions.

Browse Source 
This seems very little cost and matches the old behavior more
closely. This will cause some more falling nodes to get added
to falling clusters. With the efficiency of the algorithm, this
really doesn't do much damage.
This commit is contained in:
Auke Kok 2016-04-13 23:10:37 -07:00 committed by paramat
parent bc4dc80c01
commit 855a305057
1 changed files with 6 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
builtin/game/falling.lua
View File

@ -182,6 +182,10 @@ end
-- Down first as likely case, but always before self. The same with sides. -- Down first as likely case, but always before self. The same with sides.
-- Up must come last, so that things above self will also fall all at once. -- Up must come last, so that things above self will also fall all at once.
local nodeupdate_neighbors = { local nodeupdate_neighbors = {
{x = -1, y = -1, z = 0},
{x = 1, y = -1, z = 0},
{x = 0, y = -1, z = -1},
{x = 0, y = -1, z = 1},
{x = 0, y = -1, z = 0}, {x = 0, y = -1, z = 0},
{x = -1, y = 0, z = 0}, {x = -1, y = 0, z = 0},
{x = 1, y = 0, z = 0}, {x = 1, y = 0, z = 0},
@ -226,10 +230,10 @@ function nodeupdate(p)
n = n - 1 n = n - 1
-- If there's nothing left on the stack, and no -- If there's nothing left on the stack, and no
-- more sides to walk to, we're done and can exit -- more sides to walk to, we're done and can exit
if n == 0 and v == 7 then if n == 0 and v == 11 then
return return
end end
until v < 7 until v < 11
-- The next round walk the next neighbor in list. -- The next round walk the next neighbor in list.
v = v + 1 v = v + 1
else else