A heuristic algorithm is described for four col-oring planar graphs. The algorithm is based on theprinciple of breaking a problem into components andsolving them one at a time. The algorithm uses gen-eralized alternating chains of the most general kind,for instance they can have branches and self inter-sections. Alternating chains are found which, aftercompleting each major iteration of the algorithm, acertain property is preserved. This property ensuresthat a successive alternating chain will be easy tofind.Specifically the property ensures that the branchesof an alternating chain cannot conflict with each other,and a branch cannot conflict with itself. This algo-rithm solves one set of problems, but the solution hasit’s own set of problems. However I think these canbe easily resolved, leading to a new and simple proofof the Four Color Theorem.