A polynomial time enumeration method for the three-choice polygon mode
l in two dimensions is given together with numerical analysis of the e
numerated series and an argument supporting the asymptotic behaviour o
f the number of imperfect staircase polygons.