Editing ALGORITHM I (section)

==='''Step V. Model Fixation at the TL Breakthrough. Search for t.5. Search for t.6.'''===

The bar t.4 (or in repeated applications of the step, the analyzed bar specified in the algorithm) is checked for reaching TL. The following scenarios are possible:

: '''5.1.''' TL is reached (there is a touch of TL). In this case, the program checks whether the level of t.4 has been surpassed in the section from t.4 to the moment of reaching the price of TL (excluding the analyzed - i.e., the bar that broke through TL). This is possible with repeated applications of the step, i.e., when not t.4 will be analyzed, but one of the subsequent bars.
:: '''5.1.1.''' If the level of t.4 is not surpassed, then the model is considered formed [The model is formed without 6];
:: Then the program proceeds to step 6.

:: '''5.1.2.''' If the level of t.4 is surpassed, the program looks for an absolute extreme in the section from t.4 (excluding) to the bar that reached the level of t.4 (inclusive), as point 5 (hereinafter - t.5).
:: When searching for a potential t.5, it is necessary to take into account the requirement: in a particular case, if the bar t.4 belongs to the extreme, co-directed with t.5, t.5 must break through the level of this extreme (i.e., the level of t.5 should be further from the level of t.4).

::: '''5.1.2.1.''' If the extreme is found - this is a potential t.5.
::: There are 2 scenarios:
:::: '''5.1.2.1.1.''' T.5 belongs to the bar, which broke through the level of t.4. The program checks whether the bar, which contains t.5 (and which broke through the level of t.4), is a bar that also contains and an absolute extreme in the section from this bar (inclusive) to the point of breaking through TL, (i.e., the current bar) (excluding). There are 2 scenarios:
::::: '''5.1.2.1.1.1.''' The bar t.5 contains an absolute extreme, co-directed with t.4. In this case, the absolute extreme, co-directed with t.4, is a new potential t.4. The program builds an AL through this t.4 and checks the AL for the absence of price intersections in the section 2-4.
::::: There are 2 scenarios:
::::::: '''5.1.2.1.1.1.A.''' On the section 2-4, the AL intersects with the price. In this case -t.3 becomes the canceled t.3; - the program is looking for a new t.3, for which it processes the bar that reached TL according to step 2 and further according to the algorithm.
::::::: '''5.1.2.1.1.1.B.''' On the section 2-4, the AL does not intersect with the price. The program proceeds to step 6.

::::: '''5.1.2.1.1.2.''' The bar t.5 does not contain an absolute extreme, co-directed with t.4. The program proceeds to step 6.

:::: '''5.1.2.1.2.''' T.5. belongs to the bar between the bar t.4 and the bar that broke through the level of t.4. The program proceeds to step 6.

::: '''5.1.2.2.''' The extreme is not found, the program is looking for the next candidate for t.4. To do this, the program processes the bar that has surpassed the level of the potential t.4 according to step 3.4.

: '''5.2.''' TL is not reached. If the analyzed bar contains a potential t.4, the program checks the next bar according to step 5. If the analyzed bar does not contain a potential t.4, then it is subjected to simultaneous verification:

: for extremity according to rule N1 (as t.5);
: for the presence between the analyzed bar and the bar of the potential t.4 of bars containing price values, more distant from the potential t.4, than the most distant from t.4 value of the analyzed bar, as well as
:-the presence between the analyzed bar and the bar t.4 of price values equal to the most distant value of the price of the analyzed bar (this is a check for the potential absoluteness of the extreme of the potential t.5).
:: '''5.2.1.''' If the bar is an extreme and it is potentially absolute, then this bar is a potential t.5. The program checks this bar for reaching the level of t.4. There are 2 scenarios:
::: '''5.2.1.1.''' If the level of t.4 is reached (confirmed by the bar of the potential t.5)
::: The program checks whether the bar, which contains t.5 (and which broke through the level of t.4), also contains an extreme, co-directed with the bar t.4:
::: There are 2 scenarios:
:::: '''5.2.1.1.1.''' The bar t.5 contains an extreme, co-directed with t.4. In this case, the absolute extreme, co-directed with t.4, is a new potential t.4. The program rebuilds the AL through it and checks this LC for the presence of intersections in the section t.2-t.4. There are 2 scenarios:
::::: '''5.2.1.1.1.A''' On the section 2-4, the AL intersects with the price. the program processes the next bar according to steps 3.4.
::::: '''5.2.1.1.1.B''' On the section 2-4, the AL does not intersect with the price. The program checks the next bar according to step 5.

:::: '''5.2.1.1.2.''' The bar t.5 does not contain an extreme, co-directed with t.4. In this case, the confirmation of the bar t.4 by the bar t.5 occurs. 
:::: The program proceeds to step 6. (there was an idea to redo to step 5.3.)

::: '''5.2.1.2.''' If the level of t.4 is not reached. The program proceeds to step 6 (there was an idea to redo to step 5.3.) At the same time, the program checks the next bar in accordance with this item (i.e., according to step 5), to find another model with the same t.1, t.2, t.3, t.4, but another t.5.

:: '''5.2.2.''' If the bar is not an extreme, or is not potentially absolute, then the program checks it for reaching the level of the potential t.4.
::: '''5.2.2.1.''' If the bar reaches the level of t.4, then the program looks for an absolute extreme between t.4 and the point of confirmation t.4 (i.e., repeated after t.4 reaching the level of t.4) as t.5. There are 2 scenarios:
:::: '''5.2.2.1.1.''' If t.5 is present, the program proceeds to step 6 (there was an idea to redo to step 5.3.)
:::: '''5.2.2.1.2.''' If t.5 is absent, the program proceeds to search for a new t.4, for which it processes the bar that reached the level of t.4 starting from step 3.4.

::: '''5.2.2.2.''' If the bar does not reach the level of the potential t.4, then the program processes the next bar from the beginning of this step (i.e., according to step 5).

'''5.3.''' Algorithm for determining the presumed real p.6:

: '''5.3.1.''' Apply Algorithm I to the models, excluding AM.
: Identify the price value that is farthest from the t.1 level, which is the level the price reached from t.3 to the first time the price touches the TL (referred to as the touch of TL). The touch of ЛТ occurs after t.4, indicating the moment when the model is formed.
:The extremum identified in step 2 is considered the real t.6.

:The technical parameters P6 and P6t are finalized at the moment the model is fully formed, which is when the price touches TL after t.4.

: '''5.3.2.''' If the price has not touched ЛТ after t.4 of the analyzed model at the moment of determining the presumed real p.6, the program will check if the number of bars formed after t.4 is more than 300.
:: '''5.3.2.1.''' If the number of bars formed after t.4 exceeds 300, the presumed real p.6 for this model will not be determined.

::: '''5.3.2.2.''' If the number of bars formed after t.4 does not exceed 300, several scenarios are possible.
:::: '''5.3.2.2.1.''' One scenario is if the price has surpassed the t.4 level (meaning both t.4 and t.5 are confirmed). In this case, the program calculates the distance between the t.1 and t.4 levels.
:::: This distance is then marked off from t.4 towards the t.6 level, either upwards for an ascending model or downwards for a descending model.
:::: The program then checks if the price has surpassed this level in the section after t.4 of the analyzed model.

:::: '''5.3.2.2.2.''' If the price has reached t.4 level, the report does not provide information on the presumed real p.6. 

:::: '''5.3.2.2.3.''' In the given scenario, the program checks if the price has surpassed a the t.4 level. If it hasn't, the program then identifies the price value that is farthest from the level reached after a specific time point (t.4). This extreme value is considered as the presumed real p.6. 

::: '''5.3.2.2.''' If the price has not surpassed the level of t.4 (meaning t.4 and t.5 are not confirmed), the potential t.4 is considered as the presumed real p.6. 

:: '''5.3.3.''' For AM the process is similar, but with one key difference. The TL is not used when determining the real or presumed p.6. Instead, the level of t.3 of the model under consideration is used to determine the real or presumed p.6.

: '''5.4.''' Algorithm for Determining Whether the Model is from the Start of the Trend Model or Along the Trend (Trend-Following) Model

:: '''5.4.1.''' For main models except for EAM 
:: The program sequentially checks bars from right to left (i.e., into the past) from the bar containing the extreme candidate at t.2 until it finds a price intersection of t.2 level .

::* If the program has checked 50 bars up to t.1 of the model and such an intersection is not found, the model is considered a trend-following model.
::* If the intersection lies to the left of the (presumed) starting point of the preceding trend (related to this model), the report displays:  
:: G3: HTModel
:: * If the intersection lies to the right of the (presumed) starting point of the preceding trend, the model is considered a model from the start of the trend, the report displays: 
:: G3: BTModel
:: * If the program has checked less than 50 bars up to t.1 of the model and reached the initial bar of the chart, and the sought-after intersection is not found, the model is considered a trend-following model, the report displays:  
:: G3: NoData

:: '''5.4.2.''' For EAM, the same applies, but the program looks for an intersection at the level of t.4 instead of an intersection at the level of t.2.

:The program proceeds to step 6.