This sample shows how to measure execution performance using benchmarks.
Time required
5 minutes
Prerequisites
You must have Rule Designer installed to import and run this sample.
Description
GERALD: 197485
+ DONALD: 526485
----------------
= ROBERT: 723970
Decision Server prints the solution next to the letters. In a simple approach to this problem, there are 10 digits and 10 different letters, so there are 100 different letter-digit combinations. The rules choose 10 combinations among those 100 such that the mathematical operation holds.
For a specific player, the 15 other people can be divided into five groups of three, each group of three forming a table with the player for one night. There are many solutions, but the rules are written so that only one solution is found. This program uses rule chaining and builds long-chain conditions.
You can compare execution times between the non-optimized version and the optimized version of a ruleset.
This sample also shows how to tune the performance of the rule engine in RetePlus mode using some of the optimization techniques provided with Decision Server.
The key features of this sample include: