Percolation is the study of long-range connectivity in randomly connected systems, and has been studied extensively for the last 60+ years, in fact quite intensely at King’s College (Cyril Domb, Michael Fisher, John Essam, M. F. Sykes) in the early days. In this talk I survey some of important results, such as crossing (John Cardy, Gerard Watts), scaling, universality, and exact results. Determination of exact thresholds over a wide range of lattices, using a generalization of the Sykes-Essam result based upon the star-triangle transformation, will be discussed (work with Chris Scullard). Numerical methods (work with Chris Lorenz, Stephen Mertens, Youjin Deng, Mark Newman) will also be discussed. Some recent work on Simply-Connected Compoennts (work with Peter Grassberger) will also be presented.