Thank you for your considered responses. I'm wondering if my system will be able to capitalise on the advantages of the Rete algorithm. Quoting from 'Jess In Action':
" in the worst case, where every fact changes on every cycle and there is no network sharing between rules, then the performance for later cycles is the same as well. This means Jess won't be very efficient if you populate the working memory, run the pattern matcher for just one cycle, and then reset working memory and repopulate it again from scratch" The basic mechanics of the rule engine will: 1. Receive hole cards. Make a decision. 2. Receive flop. Make a decision. 3. Receive turn. Make a decision. 4. Receive river. Make a decision. 5. Repeat. My understanding of the situation is that the performance will always be the same as the "first cycle" performance. If this is true is this an inherent limitation given the problems domain in which I am working. Or is there a way to build the rules which capitalise upon Rete? If I always get "first cycle" performance than what is a "back of the envelope" estimate on how this would compare to plain if/else statements in java? -------------------------------------------------------------------- To unsubscribe, send the words 'unsubscribe jess-users [EMAIL PROTECTED]' in the BODY of a message to [EMAIL PROTECTED], NOT to the list (use your own address!) List problems? Notify [EMAIL PROTECTED] --------------------------------------------------------------------
