Good human chess players can often look 10 or more ply ahead.
In computer chess the concept of ply becomes important because one ply corresponds to one level of the game tree. It has been found that an increase in search depth of one ply corresponds on the average to an increase in playing strength of approximately 200 Elo points. The Deep Blue chess computer which defeated Kasparov in 1997 could search to a depth of 12 ply.
See also:
A ply can also refer to a strand or layer of material, such as yarn, rope, plastic, wood, or paper. Plywood gets its name from this.