N-queen generalized genetic algorithm. Parameters can be changed and tested. It has very basic but effective functions of selection,crossover and mutation. Queens are randomly positioned in the beginning. I have written it for n-queens. It gives a good amount of solutions for queens > 8. Also you can change parameters and test for yourself. The cross-over logic is given in the attached PDF-cross-over_logic.
I've found no easy way to include a php script into a module position with existing extensions for Joomla! 1.5. Therefore I've written my own module which provides a very easy solution for that problem. Just install the module, enter the path to...
OOFEM is free finite element code with object oriented architecture for solving mechanical, transport and fluid mechanics problems that operates on various platforms.
The aim of this project is to develop efficient and robust tool...
Automatic Rebase ================================================================================
Problem description -------------------------------------------------------------------------------- It is a well known...
Keplerian orbits, elliptical, parabolic, hyperbolic orbits, elements conversion. Temporal problem, mean anomaly, eccentric anomaly, true anomaly. MOID. Orbits plot. Position and velocity vectors. Orbital maneuvers: Lambert problem solution,...
Modern businesses are challenged by a host of problems that must be solved immediately or the business won’t be a success. One of the most critical problems is the impossibility of making a decision without effectively processed and visually...
Modern businesses are challenged by a host of problems that must be solved immediately or the business won't be a success. One of the most critical problems is the impossibility of making a decision without effectively processed and visually...
This submission contains the demo files used in the Global Optimization with MATLAB webinar: http://www.mathworks.com/wbnr43346
MultStart Demos
* Peaks Minimization * Nonlinear Curve Fitting
GlobalSearch...
Solution to birthday probability problem: If there are n people in a classroom, what is the probability that at least two of them have the same birthday? General solution: P = 1-365!/(365-n)!/365^n If you try to solve this with...
An alternative solution to the MAZE problem on matlab central FEX. (A recent submission to the File exchange on MATLAB central File ID: #27175 ).
The present solution uses an Immiscible Lattice Boltzmann framework to simulate the flow...
This code has been wrote to solve nonlinear two point boundary value problem of order n by multiple shooting method. It needs the function "SENS_SYS" which calculate derivatives (sensitivities) of the solution with respect to...
Eight Queens is one of the popular algorithms in backtracking. The solution given below uses simple math to reduce the processing. The logic is keep placing the coins on the board with below rules:
Don't place the coin if there...
It contains the solution to every problem of the 2nd chapter. I'll keep posting more solved problems as soon as I can.
We solve a binary distillation problem using the solution of a Riccati equation. We find that four plates are needed to achieve the desired product purity. We also compute the number of stages with the classical approach by stepping off stages...
I was looking for a fast way to list all primes below n, so far i came up to this with the numpy solution the fastest. It does primes up to 10e6 in 15ms in my old machine, and it is capable of reaching 10e9.
Partition problem From Wikipedia, the free encyclopedia
In computer science, the partition problem is an NP-complete problem. The problem is to decide whether a given multiset of integers can be partitioned into two...
A classic algorithmic problem - place 8 queens on a chess board so that none is attacked by another.
In the present program three methods are used to solve a heat conduction problem. This problem is given in M. N. doOCozisik, Heat Conduction, Wiley, New York, 1980. We use pdepe, short times solution based on analytical inversion of a Laplace...
For an input of n equations, it converges to the solution. For an input of >n equations, there is no exact solution. In this case, the function minimizes sum( (individual equation errors).^2)
The bridge-crossing problem is a mathematical puzzle where a group of N persons have to cross a bridge at night. It is dark and they can only cross the bridge if they carry a lamp. Only one lamp is available and at most two persons can cross... |