We consider a percolation process in which k widely separated points simultaneously connect together (k > 1), or a single point at the center of a system connects to the boundary (k = 1), through adjacent connected points of a single cluster. These processes yield new thresholds p ck defined as the average value of p at which the desired connections first occur. These thresholds are not sharp as the distribution of values of p ck remains broad in the limit of L → ∞. We study p ck for bond percolation on the square lattice, and find that p ck are above the normal percolation threshold pc = 1/2 and represent specific supercritical states. The p ck can be related to integrals over powers of the function P∞(p) = the probability a point is connected to the infinite cluster; we find numerically from both direct simulations and from measurements of P∞(p) on L × L systems that for L → ∞, p c1 = 0.51761(3), p c2 = 0.53220(3), p c3 = 0.54458(3), and p c4 = 0.55530(3). The percolation thresholds p ck remain the same, even when the k points are randomly selected within the lattice. We show that the finite-size corrections scale as L −1/ν k where ν k = ν/(kβ + 1), with β = 5/36 and ν = 4/3 being the ordinary percolation critical exponents, so that ν1 = 48/41, ν2 = 24/23, ν3 = 16/17, ν4 = 6/7, etc. We also study three-point correlations in the system, and show how for p > pc, the correlation ratio goes to 1 (no net correlation) as L → ∞, while at pc it reaches the known value of 1.021. . . .