We have a running joke wherein I say "Just make a button that does that".You know, a button, to do the thing you want to do. Back in the day we used to call that a DWIM function -- "Do what I mean." Of course that's a joke based on the fact that in programming you have to be insanely specific and literal to get the computer to do what you want. I was lazy in high school and did the bare minimum to pass algebra II and then proceeded to go to an art school for a year (where I took no academics) and then drop that to become a medic in the military. My friend and I were discussing his online dating life.
Girl (pointing to a chart): But you spend twice as much time with me as with anyone else. Warning: this comic occasionally contains strong language (which may be unsuitable for children), unusual humor (which may be unsuitable for adults), and advanced mathematics (which may be unsuitable for liberal-arts majors).
But my searching has only turned up academic papers (which aren't free) and corn. Did anyone know a website with some academic information on an algorithm to calculate the shortest distance to completing a maze? Every path between adjacent intersections is an edge with a weight equal to its length.
Is the only option to calculate the distance required to travel in every possible path and then pick the shortest? There are many efficient algorithms to solve the shortest path problem.
The title text refers to the method by which the program select the desired option, with minimizing being where the program seeks the lowest possible number, and maximizing where the program seeks the highest possible number.
When dealing with cases such as generating profit, maximization would obviously be preferred over minimization; but selecting maximization here would be disastrous as it would always chose the Becoming Skynet option before any other due to its massive cost.