![Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5928/TOC-Subject-Sample-2021-Computer-Science.jpg"})
Abstract
Multistage Monte Carlo methods are capable of producing approximate solutions to the classical brachistochrone problem. The history and formulation of the classical brachistochrone problem is briefly discussed, and a mathematical programming problem for an approximate brachistochrone problem is derived. Multistage Monte Carlo methods are outlined, and an ANSI-standard C language program which implements a multistage Monte Carlo solution to this mathematical programming problem is presented. Experimental results for ten-segment and twenty-segment brachistochrones are tabulated, and extensions and opportunities for further investigations are suggested