Orders (elm_playground.Orders)

val problem : 
  walkable:((int * int) -> bool) ->
  (int * int) ->
  (int * int) Pathfind.problem

val path : 
  walkable:((int * int) -> bool) ->
  from:(int * int) ->
  (int * int) ->
  (int * int) list

val nearest : 
  walkable:((int * int) -> bool) ->
  from:(int * int) ->
  ((int * int) -> bool) ->
  (int * int) list

val field : 
  walkable:((int * int) -> bool) ->
  (int * int) ->
  ((int * int) * float) list

val downhill : 
  walkable:((int * int) -> bool) ->
  ((int * int) * float) list ->
  (int * int) ->
  (int * int) option

val toward : 
  speed:Playground.number ->
  (Playground.number * Playground.number) ->
  (int * int) ->
  Playground.number * Playground.number

val advance : 
  speed:Playground.number ->
  (Playground.number * Playground.number) ->
  (int * int) list ->
  (Playground.number * Playground.number) * (int * int) list

val cell_of : (Playground.number * Playground.number) -> int * int