SHOW:
|
|
- or go back to the newest paste.
| 1 | print("Rows of trees?")
| |
| 2 | local TreeRows = io.read() | |
| 3 | print("Cols of trees?")
| |
| 4 | local TreeCols = io.read() | |
| 5 | ||
| 6 | local DIRT = 1 | |
| 7 | local SAPLING = 2 | |
| 8 | local LOG = 3 | |
| 9 | ||
| 10 | -- plant trees | |
| 11 | turtle.select(SAPLING) | |
| 12 | for y = 1, TreeRows do | |
| 13 | - | for x = 1, TreeCols do |
| 13 | + | for x = 1, TreeCols do |
| 14 | - | turtle.forward() |
| 14 | + | turtle.forward() |
| 15 | - | turtle.turnRight() |
| 15 | + | turtle.turnRight() |
| 16 | - | turtle.place() |
| 16 | + | turtle.place() |
| 17 | - | turtle.turnLeft() |
| 17 | + | turtle.turnLeft() |
| 18 | - | turtle.forward() |
| 18 | + | turtle.forward() |
| 19 | - | turtle.forward() |
| 19 | + | turtle.forward() |
| 20 | - | end |
| 20 | + | end |
| 21 | - | |
| 21 | + | |
| 22 | - | turtle.turnRight() |
| 22 | + | turtle.turnRight() |
| 23 | - | turtle.forward() |
| 23 | + | turtle.forward() |
| 24 | - | turtle.forward() |
| 24 | + | turtle.forward() |
| 25 | - | turtle.forward() |
| 25 | + | turtle.forward() |
| 26 | - | turtle.turnLeft() |
| 26 | + | turtle.turnLeft() |
| 27 | - | |
| 27 | + | |
| 28 | - | for x = 1, TreeCols do |
| 28 | + | for x = 1, TreeCols do |
| 29 | - | turtle.back() |
| 29 | + | turtle.back() |
| 30 | - | turtle.back() |
| 30 | + | turtle.back() |
| 31 | - | turtle.back() |
| 31 | + | turtle.back() |
| 32 | - | end |
| 32 | + | end |
| 33 | end | |
| 34 | ||
| 35 | turtle.turnLeft() | |
| 36 | for y = 1, TreeRows do | |
| 37 | - | turtle.forward() |
| 37 | + | turtle.forward() |
| 38 | - | turtle.forward() |
| 38 | + | turtle.forward() |
| 39 | - | turtle.forward() |
| 39 | + | turtle.forward() |
| 40 | end | |
| 41 | ||
| 42 | turtle.turnRight() | |
| 43 | turtle.select(LOG) | |
| 44 | ||
| 45 | while true do | |
| 46 | - | for y = 1, TreeRows do |
| 46 | + | for y = 1, TreeRows do |
| 47 | - | for x = 1, TreeCols do |
| 47 | + | for x = 1, TreeCols do |
| 48 | - | turtle.forward() |
| 48 | + | turtle.forward() |
| 49 | - | turtle.turnRight() |
| 49 | + | turtle.turnRight() |
| 50 | - | |
| 50 | + | |
| 51 | - | if turtle.compare() then |
| 51 | + | if turtle.compare() then |
| 52 | - | turtle.dig() |
| 52 | + | turtle.dig() |
| 53 | - | turtle.forward() |
| 53 | + | turtle.forward() |
| 54 | - | |
| 54 | + | |
| 55 | - | while turtle.detectUp() do |
| 55 | + | while turtle.detectUp() do |
| 56 | - | turtle.digUp() |
| 56 | + | turtle.digUp() |
| 57 | - | turtle.up() |
| 57 | + | turtle.up() |
| 58 | - | end |
| 58 | + | end |
| 59 | - | |
| 59 | + | |
| 60 | - | while not turtle.detectDown() do |
| 60 | + | while not turtle.detectDown() do |
| 61 | - | turtle.down() |
| 61 | + | turtle.down() |
| 62 | - | end |
| 62 | + | end |
| 63 | - | |
| 63 | + | |
| 64 | - | turtle.back() |
| 64 | + | turtle.back() |
| 65 | - | |
| 65 | + | end |
| 66 | - | turtle.turnLeft() |
| 66 | + | |
| 67 | - | turtle.forward() |
| 67 | + | turtle.turnLeft() |
| 68 | - | turtle.forward() |
| 68 | + | turtle.forward() |
| 69 | - | end |
| 69 | + | turtle.forward() |
| 70 | - | end |
| 70 | + | end |
| 71 | - | |
| 71 | + | |
| 72 | - | turtle.turnRight() |
| 72 | + | turtle.turnRight() |
| 73 | - | turtle.forward() |
| 73 | + | turtle.forward() |
| 74 | - | turtle.forward() |
| 74 | + | turtle.forward() |
| 75 | - | turtle.forward() |
| 75 | + | turtle.forward() |
| 76 | - | turtle.turnLeft() |
| 76 | + | turtle.turnLeft() |
| 77 | - | |
| 77 | + | |
| 78 | - | for x = 0, TreeCols do |
| 78 | + | for x = 0, TreeCols do |
| 79 | - | turtle.back() |
| 79 | + | turtle.back() |
| 80 | - | turtle.back() |
| 80 | + | turtle.back() |
| 81 | - | turtle.back() |
| 81 | + | turtle.back() |
| 82 | - | end |
| 82 | + | end |
| 83 | end | |
| 84 | ||
| 85 | turtle.turnLeft() | |
| 86 | for y = 1, TreeRows do | |
| 87 | turtle.forward() | |
| 88 | turtle.forward() | |
| 89 | turtle.forward() | |
| 90 | end | |
| 91 | ||
| 92 | turtle.turnRight() | |
| 93 | end |
