“…Algorithms to locate transition states can generally be divided into single-ended approaches, which simply require a single starting geometry [11,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55], and double-ended methods, which are usually designed to find a transition state between two endpoints [10,56,57,58,59,60,61,62,…”