  Enumeration of planar lattice walks is a classical topic in combinatorics, at
the cross-roads of several domains (e.g., probability, statistical physics,
computer science). The aim of this paper is to propose a new approach to obtain
some exact asymptotics for walks confined to the quarter plane.
