History of leaf decay

This page documents Java Edition​'s several historical leaf decay algorithms.
== Indev 20100218 - Indev 20100223 ==
Leaves will NOT decay if:
* They are within a 5x5x2 box around a log with the log in the bottom center. (Note that the leaf does not have to touch the log)
* They are on top of a solid block.
* They are on top of a leaf that is unable to decay due to the reasons above.
If these conditions are not met, the leaf decays.
== Infdev 20100325 - Infdev 20100330 ==
== Infdev 20100615 - Alpha v1.0.5_01 ==
== Alpha v1.0.6_01 - Alpha v1.1.2_01 ==
In Alpha, leaves would decay using an algorithm that checks whether it has a solid or leaf block underneath it or is adjacent to a solid block. If it doesn't, it must be connected to a leaf block that is also supported as long as it is no further than five blocks away from said support.
Basic leaf support.png|The extent a single "branch" of leaves can survive.
Leaf supports leaves.png
Tree supports leaves beside.png
Leaves connected distance.png
Leaf support compound.png|Leaves can be connected an infinite distance away from a support block.
== Alpha v1.2.3 ==
== Beta 1.0 - Beta 1.0.2 ==
== Beta 1.1 - Beta 1.1_01 ==
== Beta 1.2 - 18w21b ==
== See also ==
Leaf decay