In this research manuscript, the authors have surveyed the detailed notions of theory and algorithms to compute RCB special curve points between any two real points [a, b] of concern, and implemented the computation of the same by way of development of two dedicated Python programs of high accuracy, one for the one step evolution of an askew prime and another for the one step devolution of an askew prime. In addition the authors also present another Python program of lesser accuracy that computes the special curve between any two real number points [a, b]. For implementation the authors use an RCB convergence scheme which involves finding the successive one step evolvants till the thusly found last one step evolvant is greater than b and also similarly find, one step devolvants of b till the thusly found last one step devolvant is less than a and then find the intersection point of the two curves represented by the set of the aforesaid one step evolvant points and the set of the aforesaid one step devolvant points, using the notion of RCB universal representation theory that details the schemes for one step evolution or/and devolution of a prime, any element of any higher order sequence of primes, any element of any sequence of askew primes, any element of any higher order sequence of askew primes.