All releases of aiParts
Release Notes: This release includes rrproj, a new sample program which assigns people and/or equipment to projects or events. README.txt was improved.
Release Notes: The files rr_solve.h/cpp were renamed to aipReqRes.h/cpp; classes declared in these files were renamed. README.txt was improved.
Release Notes: The README.txt and project Web site were improved.
Release Notes: A layer was added for solving resource/requirement problems. Decisions can be decided multiple times. Pandemoniums can be ordered and unique by keys. New classes were added for date and time. Decision groups are no longer supported. Many minor changes were made.
Release Notes: In this release, the High-Hope classes have been enhanced and two minor bugs fixed. Decision groups are now supported. Logic using worst decisions and failed decisions was added. A few other minor changes were made. Beta testing and experimenting with hard and very hard problems is now required.
Release Notes: The primary change in this release was to move logic that affects hopes from aipHHProblem to aspects attached to the hope emotion-components. aipHHHope objects, using this logic, can now be added to other classes, such as application-specific decision groups. Support was added for a set of decisions to share a set of options. Several other small changes were made.
Release Notes: The parameters for the sample shortest-path program can now be specified on the commandline, making it easy to experiment with the program. The logging done by this program (results-only, each-try, or each-option) has been improved. An aipPandemonium object is now a queue (rather than a stack). In the aipHighHope code, a bug has been fixed, and the code has been improved in the solve() function.
Release Notes: The way a try affects High-Hope decisions and options has been heavily modified. A hope-calculation bug was fixed. If a decision has multiple best options, one is now chosen randomly. In the shortest-path sample program, option-distance no longer affects which option is chosen. Other small changes were made. This sample program, using the High-Hope technique, now appears to work moderately well. More testing and experimenting are required.
Release Notes: In this release, the sample shortest-path problem was made larger and harder. Two non-critical bugs were fixed. Comments and the ability to debug were improved. The way decision and option hopes change was modified; this area needs more work.
No changes have been submitted for this release.
