We entered the planners SIW, BFS (f), and PROBE to the agile-track of the 2014 International Planning Competition, and an anytime planner for the satisficing track that runs both SIW and BFS (f). SIW and BFS (f) are classical planners that make use of the notion of width (Lipovetzky and Geffner 2012), while PROBE is a standard bestfirst search planner that augments the expansion of a node by throwing an “intelligent” probe which either reaches the goal or terminates quickly in low polynomial time (Lipovetzky and Geffner 2011). The basic building block of SIW is the Iterative Width Procedure (IW) for achieving one atomic goal at a time. IW runs in time exponential in the problem width by performing a sequence of pruned breadth first searches. The planner BFS (f) integrates a novelty measure from IW with helpful-actions, landmarks and deleterelaxation heuristics in a Greedy Best-Fist search. In the following sections we introduce the basic notions of the algorithms and the implementation.