KBMax Blog

KBMax Snap Rule Engine - Creating A Trigonometry Function

Posted by Thomas Plocher on 5/2/17 3:27 PM
Find me on:
Most CPQ vendors will not necessarily show their rule language and admin platform until customers went through several sales calls and demos. Even then customers get a small glimpse into the engine that drives their configurators.
 
Usually it is hard to learn syntax that will limit what you can do and slow down your adoption and implementation. At KBMax we take a different approach. From the start, we display our admin tool and rule language. We are proud of it and our customers love it. And, we think you will too.
 
Trig_Function_720x440.png
 
To build rules in Snap, you simply drag blocks from the toolbox and snap them together to form logic statements. Snap thinks like you do. Need to set an image? Select and see the image right in the rule. Snap blocks contain dropdowns, color-pickers, buttons, etc. to make your job easier.
 
This video shows how to build a function which returns a number value. Snap is not limited like other text-based rule languages. It is *Turing-complete, meaning it can build any advanced algorithm. Our customers have complex products that demand complex rules.
 
 
 
 
The language consists of individual blocks which you can drag out of a toolbox and connect to other blocks to create complex expressions and operations. Each place where Snap is used includes blocks that are contextual to the purpose of the rule. For instance, a configurator workspace will include blocks specific to the configurator you are modifying, while a workflow workspace includes blocks to specify states the quote can be in, as well as permissions and other workflow-related operations and settings.
 
*A computer is Turing complete if it can solve any problem that a Turing machine (a system of rules, states and transitions) can, given an appropriate algorithm the necessary time and memory. When applied to a programming language this phrase means that it can fully exploit the capabilities of a Turing complete computer.

Topics: CPQ