Minage Opti

--entrer une direction et le nombre de fois qu'il le fera
--Enter a direction and how many times repeat it...
function move(String, nbr1)
  for d = 1, nbr1 do
    if String == 'f' then
      turtle.forward()
    elseif String == 'b' then
      turtle.back()
    elseif String == 'u' then
      turtle.up()
    elseif String == 'd' then
      turtle.down()
    end
  end
end

function turn(Dir)
  if Dir == 'l' then
    turtle.turnLeft()
  elseif Dir == 'r' then
    turtle.turnRight()
  end
end

print("Combien de bloc la turtle doit elle avancer ?")
p = read()
r = p * 8

turtle.select(1)

for i = 1, r do
  move('f', r)
  turtle.dig()
  move('f', 1)
  turtle.digDown()
  turtle.digUp()
  turn('r')
  for j = 1, 2 do
    turtle.dig()
    move('f', 1)
    turtle.digDown()
    turtle.digUp()
    turn('r')
    turn('r')
    move('f', 1)
  end
  turn('l')

  move('f', 1)
  turtle.dig()
  move('f', 1)
  turtle.digDown()
  turtle.digUp()
  turn('r')
  for j = 1, 2 do
    turtle.dig()
    move('f', 1)
    turtle.digDown()
    turtle.digUp()
    turn('r')
    turn('r')
    move('f', 1)
  end
  turn('l')

move('f', 1)
  turtle.dig()
  move('f', 1)
  turtle.digDown()
  turtle.digUp()
  turn('r')
  for j = 1, 2 do
    turtle.dig()
    move('f', 1)
    turtle.digDown()
    turtle.digUp()
    turn('r')
    turn('r')
    move('f', 1)
  end
  turn('l')

move('f', 1)
  turtle.dig()
  move('f', 1)
  turtle.digDown()
  turtle.digUp()
  turn('r')
  for j = 1, 2 do
    turtle.dig()
    move('f', 1)
    turtle.digDown()
    turtle.digUp()
    turn('r')
    turn('r')
    move('f', 1)
  end
  turn('l')

move('f', 1)
  turtle.dig()
  move('f', 1)
  turtle.digDown()
  turtle.digUp()
  turn('r')
  for j = 1, 2 do
    turtle.dig()
    move('f', 1)
    turtle.digDown()
    turtle.digUp()
    turn('r')
    turn('r')
    move('f', 1)
  end
  turn('l')

move('f', 1)
  turtle.dig()
  move('f', 1)
  turtle.digDown()
  turtle.digUp()
  turn('r')
  for j = 1, 2 do
    turtle.dig()
    move('f', 1)
    turtle.digDown()
    turtle.digUp()
    turn('r')
    turn('r')
    move('f', 1)
  end
  turn('l')

move('f', 1)
  turtle.dig()
  move('f', 1)
  turtle.digDown()
  turtle.digUp()
  turn('r')
  for j = 1, 2 do
    turtle.dig()
    move('f', 1)
    turtle.digDown()
    turtle.digUp()
    turn('r')
    turn('r')
    move('f', 1)
  end
  turn('l')

  move('b', r + 3)

  for n = 1, 16 do
    turtle.select(n)
    turtle.dropDown()
  end
end