Docs#145English
New ME Algorithm vs. Original ME Algorithm: Differences and Migration Guide

New ME Algorithm vs. Original ME Algorithm: Differences and Migration Guide

You need

  • Synthesis recipe with fuzzy boilerplate with over 10,000 calculations, turn off fuzzy mode, select a clear input

  • Experience new features of single boilerplate loop proliferation and catalyst input

  • Report BUGs in a timely manner

Fuzzy synthesis template

  • Supports fuzzy input instead of just using the most frequent input

  • Supports auto-increment (if fuzzy input, it will use circular calculation, with a maximum of 10,000 iterations)

  • If auto-increment is non-fuzzy input, it is batch calculation

Handle boilerplate

  • For multiple boilerplate templates for the same output, demand will be averaged among them. No simulation will be performed for now (consistent with pre-update behavior).

  • Templates support catalyst input, e.g., 3A+B->C+B. B will intelligently request based on configurable operator parallelism.

  • Operator parallelism can be configured, but there is no UI for it yet. It defaults to 1 (minimum 1).

  • Proliferation recipes are supported, e.g., 1A->3A. Initial demand will be intelligently calculated based on parallelism, and production templates will be prioritized by the system.


# Differences between the new me algorithm and the original me algorithm, and migration guide

What you need

  • Close fuzzy mode for synthetic recipes with more than 10,000 calculations containing fuzzy samples, and select a clear input

  • Experience new features such as single-sample cycle multiplication and catalyst input

  • Report BUGs promptly

Fuzzy synthesis template

  • Supports fuzzy input instead of just using the most frequent input

  • Supports auto-increment (if it's fuzzy input, it will use iterative calculation, with a maximum of 10,000 iterations)

  • If auto-increment is not fuzzy input, it will perform batch calculation

Template Processing

  • For multiple templates of the same output, the demand will be evenly distributed among them, and simulation will not be performed for the time being (consistent with behavior before the update)

  • The template supports catalyst input, i.e., 3A+B->C+B, where B can be smart requested based on the set operator parallelism

  • Operator parallelism is configurable, but the UI hasn't been implemented yet; the default is 1 (minimum is 1)

  • Supports breeding recipes, such as 1A->3A, which intelligently calculates the initial demand based on parallelism, and production-type templates will be prioritized by the system for supply

Contributors

Comments

0