Short ruby solution to N Queens analogous to my Elixir solution

n_queens.rb

def props(f, r)
  [f, f + r, f - r]
end

def safe?(queens, f, r)
  p_props = props(f, r)
  queens.all? { |q| p_props.zip(props(*q)).all?{ |p| p[0] != p[1] } }
end

def solve(n, queens, rank, &block)
  if rank == n
    yield queens
  else
    n.times do |file|
      if safe?(queens, file, rank)
        queens << [file, rank]
        solve(n, queens, rank + 1, &block)
        queens.pop
      end
    end
  end
end

solve(ARGV[0].to_i, [], 0) { |solution| puts solution.inspect }