http://wiki.marketpawns.com/api.php?action=feedcontributions&feedformat=atom&user=Admin 2026-05-01T16:29:41Z User contributions MediaWiki 1.39.3 http://wiki.marketpawns.com/index.php?title=Universal_Market_Geometry_(UMG)&diff=220 2024-06-05T17:23:20Z

<p>Admin: </p> <hr /> <div>'''UMG''' is a versatile system of technical analysis. It's applicable to any market and any timeframe, capable of analyzing any liquid instruments where [[UMG models|UMG (technical analysis) models]] can be found.<br /> <br /> It is based on the basic ideas of [[Tactica Adversa methods|'''Tactica Adversa''']] methods, retaining the approach of sequential selection of extremes on charts. These extremes are used to draw Trend Lines and Aim Lines, which form [[UMG models|UMG models]].<br /> <br /> Another axiom that UMG also inherited from its predecessor is that models related to different timeframes and financial instruments are equivalent in case their characteristics and interrelations with other models are equivalent.<br /> <br /> In contrast to [[Tactica Adversa methods|Tactica Adversa]], which largely relies on its own pretty axiomatic apparatus, the core principle in developing UMG rules is: &quot;Every idea has the right to exist, but must be thoroughly examined multiple times.&quot;<br /> <br /> [[File:UMG Zen circle B.png|thumb|UMG logo consists of deep-blue Zen circle, white round of a spiral inside it, and golden universal Key.]]<br /> <br /> UMG is definitly a heart of the [https://marketpawns.com '''MP'''] project, thats why it has it's own logo. It consists of deep-blue Zen circle, white round of a spiral inside it, and golden universal Key.<br /> <br /> ==Links==<br /> [[UMG General Concepts]]<br /> <br /> [[ALGORITHM I]]<br /> <br /> [[ALGORITHM II]]</div>

Admin http://wiki.marketpawns.com/index.php?title=Universal_Market_Geometry_(UMG)&diff=219 2024-06-05T17:23:05Z

<p>Admin: </p> <hr /> <div>'''UMG''' is a versatile system of technical analysis. It's applicable to any market and any timeframe, capable of analyzing any liquid instruments where [[UMG models|UMG (technical analysis) models]] can be found.<br /> <br /> It is based on the basic ideas of [[Tactica Adversa methods|'''Tactica Adversa''']] methods, retaining the approach of sequential selection of extremes on charts. These extremes are used to draw Trend Lines and Aim Lines, which form [[UMG models|UMG models]].<br /> <br /> Another axiom that UMG also inherited from its predecessor is that models related to different timeframes and financial instruments are equivalent in case their characteristics and interrelations with other models are equivalent.<br /> <br /> In contrast to [[Tactica Adversa methods|Tactica Adversa]], which largely relies on its own pretty axiomatic apparatus, the core principle in developing UMG rules is: &quot;Every idea has the right to exist, but must be thoroughly examined multiple times.&quot;<br /> <br /> [[File:UMG Zen circle B.png|thumb|UMG logo consists of deep-blue Zen circle, white round of a spiral inside it, and golden universal Key.]]<br /> <br /> UMG is definitly a heart of the [https://marketpawns.com '''MP'''] project, thats why it has it's own logo. It consists of deep-blue Zen circle, white round of a spiral inside it, and golden universal Key.<br /> <br /> ==Links==<br /> [[UMG General Concepts]]<br /> <br /> [[ALGORITHM I]]<br /> <br /> [[ALGORITHM II][http://wiki.marketpawns.com/index.php?title=ALGORITHM_II]]</div>

Admin http://wiki.marketpawns.com/index.php?title=Universal_Market_Geometry_(UMG)&diff=218 2024-06-05T17:22:39Z

<p>Admin: </p> <hr /> <div>'''UMG''' is a versatile system of technical analysis. It's applicable to any market and any timeframe, capable of analyzing any liquid instruments where [[UMG models|UMG (technical analysis) models]] can be found.<br /> <br /> It is based on the basic ideas of [[Tactica Adversa methods|'''Tactica Adversa''']] methods, retaining the approach of sequential selection of extremes on charts. These extremes are used to draw Trend Lines and Aim Lines, which form [[UMG models|UMG models]].<br /> <br /> Another axiom that UMG also inherited from its predecessor is that models related to different timeframes and financial instruments are equivalent in case their characteristics and interrelations with other models are equivalent.<br /> <br /> In contrast to [[Tactica Adversa methods|Tactica Adversa]], which largely relies on its own pretty axiomatic apparatus, the core principle in developing UMG rules is: &quot;Every idea has the right to exist, but must be thoroughly examined multiple times.&quot;<br /> <br /> [[File:UMG Zen circle B.png|thumb|UMG logo consists of deep-blue Zen circle, white round of a spiral inside it, and golden universal Key.]]<br /> <br /> UMG is definitly a heart of the [https://marketpawns.com '''MP'''] project, thats why it has it's own logo. It consists of deep-blue Zen circle, white round of a spiral inside it, and golden universal Key.<br /> <br /> ==Links==<br /> [[UMG General Concepts]]<br /> <br /> [[ALGORITHM I]]<br /> <br /> [[http://wiki.marketpawns.com/index.php?title=ALGORITHM_II]]</div>

Admin http://wiki.marketpawns.com/index.php?title=Main_Page&diff=217 2024-01-25T18:20:49Z

<p>Admin: /* Welcome to MarketPawns */</p> <hr /> <div>==Welcome to MarketPawns==<br /> [https://marketpawns.com '''MarketPawns''' (MP)] is a dynamic startup that has evolved from a simple technical analysis study into a comprehensive digital portal. Our platform is designed to facilitate interaction between analysts and traders through a variety of innovative tools. Here are some of them: <br /> <br /> *Automatic Chart Marking. At MarketPawns, we've streamlined the process of identifying and marking potential trading opportunities discoverd with the help of '''[[Universal Market Geometry (UMG)|Universal Market Geometry (UMG)]]'''. Our automatic search and chart marking system uses [[UMG models]] to mark financial instruments, saving you time and effort.<br /> *AI. We employ neural networks to estimate the probability of trading scenarios. Our free trading signals based on this technology provides you with tools for making informed trading decisions.<br /> *Community. The Community Wall, accessible to registered users, cultivates a collaborative environment where users can exchange forecasts, discuss models, and vote on their effectiveness. '''[https://marketpawns.com MarketPawns]''' employ a ranking system, based on the ELO model, to acknowledge the most proficient analysts of the community.<br /> <br /> ==Links==<br /> *[[Key ideas of MarketPawns|MarketPawns Key Ideas]]<br /> *[[MarketPawns User Guide]]<br /> *[[Universal Market Geometry (UMG)]]<br /> *[[ELO rating]]<br /> *[[UMG General Concepts]]<br /> *[[ALGORITHM I]]<br /> *[[ALGORITHM II]]</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_II&diff=216 2024-01-04T21:14:40Z

<p>Admin: Adding Step 12</p> <hr /> <div>This article is not finished<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with UMG General Concepts.<br /> <br /> ==='''Step I. Search For Point 3 of the External Attraction Model (EAM) and the Sarting Point of the Previous Trend.'''===<br /> : '''1.1.''' The program looks for the first possible extreme, satisfying Single Bar Rule. Such an extreme is a candidate for potential point 3 ( potential t.3).<br /> : '''1.2.''' Next, the program checks the bars from right to left (i.e., in the past) from the bar containing the extreme candidate for point 3 to one of the following events:<br /> :: '''1.2.1.''' Found the last intersection (breakthrough) point by the price level of the candidate for point 3.<br /> ::In this case, the report displays: <br /> :: PREVdata: FullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.2.''' The program reached the starting point of the chart (i.e., the price did not intersect the level of point 3 after the starting point of the chart).<br /> ::In this case, the report displays: <br /> :: PREVdata: NoFullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.3.''' The price checked 300 bars preceding point 3 &lt;ref&gt;The depth of the search for the extreme confirming point 3 of EAM model&lt;/ref&gt;, but the level of step 3 did not intersect at this segment. The program looks for an absolute extreme (opposite to step 3) on the segment from the 300th bar before point 3 to point 3. The program proceeds to substep 1.3.<br /> : '''1.3.''' The program looks for an absolute extreme (opposite to point 3 extreme) on the segment:<br /> ::- from the last intersection by the price level of the candidate for point 3 (inclusive) (if came from 1.2.1.), or <br /> :: - from the starting point of the chart (if came from 1.2.2.), or <br /> :: - from 300 bars(if came from 1.2.3.) <br /> :: to point 3 (excluding).<br /> :: '''1.3.1.''' Absolute extreme found. The candidate for point 3 is confirmed; moreover, the found confirming extreme is the assumed (if coming from 1.2.2. or 1.2.3.) starting point of the preceding trend.'''<br /> ::The program checks for the absence of extremes equal to point 3 between the assumed starting point of the previous trend and point 3. <br /> :::'''1.3.1.1.''' If such an extreme is found, this candidate for point 3 is discarded, and this point 3 is discarded. <br /> :::'''1.3.1.2.''' If such an extreme is not found, the program proceeds to step 2.<br /> ::'''1.3.2.''' Absolute extreme not found. This point 3 is discarded.'''<br /> ::Simultaneously with step 1, the program launches the search for the next potential point 3.<br /> <br /> ==='''Step II. Search For Potentioal Points 5 and 4 ''' ===<br /> '''The Orientation rule (N1 requirement) for Algorithm II is as follows:'''<br /> If point 3 is low, then the level of point 5 should be higher than point 3. <br /> If point 3 is high, then the level of point 5 should be lower than point 3.<br /> '''Search for Point 5.''' The bar following the bar of Point 3 (and in repeated applications of this step - the bar specified in this algorithm) is checked for not overcoming the level of point 3 (since N1 requirement for Algorithm II must be observed).<br /> :'''2.1.''' If the price has overcome the level of point 3, the program discards the considered step 3 (due to N1 requirement).<br /> :'''2.2.''' If N1 requirement is met for the analyzed bar, it is checked for compliance with N1 requirement as a potential point 5 (hereafter - point 5 or t.5).<br /> ::'''2.2.1.''' If the analyzed bar is not an extreme according to N1 requirement (as a potential point 5), the program checks the next bar from the beginning of step 2.<br /> ::'''2.2.2.''' If the analyzed bar is determined as an extreme according to N1 requirement (as a potential point 5), then this bar is checked for reaching (but not necessarily overcoming) the level of point 3. There are 2 options:<br /> :::'''2.2.2.1.''' If the level of point 3 is reached, the program analyzes the next bar according to this step (i.e., from the beginning of step 2).<br /> :::'''2.2.2.2.''' If the level of point 3 is not reached, the analyzed bar is a potential point 5, and the program moves to substep 2.3.<br /> :'''2.3. Search for Point 4.''' The program searches for a bar, which was the last to cross the level of the considered potential point 5. Let's denote this bar as lcb5 (line-crossing-bar-5). If lcb5 coincides with the bar of point 3, we denote the bar following lcb5 as look4. Otherwise, look4 = lcb5. The program searches for a bar with the maximum (if point 3 is low) or minimum (if point 3 is high) price in the interval from lcb5 to potential point 5. Then this bar is checked for being an extreme according to N1 requirement as a potential pont 4 (hereafter – point 4 or t.4). There are 2 options:<br /> ::'''2.3.1.''' The bar is an absolute extreme (as a potential point 4). In this case, potential point 4 is found.<br /> :::'''2.3.1.1.''' If step 2 has already been determined (this is possible when this step is triggered during the search for an alternative model), the program checks the line chart for extra points in the section from step 2 to step 4. There are 2 options:<br /> ::::'''2.3.1.1.A.''' If extra points are found, the program processes the next bar after potential point 5 according to step 2.<br /> ::::'''2.3.1.1.B.''' Extra intersections are not found; the program moves to substep 2.4.<br /> :::'''2.3.1.2.''' If substep 2.3.1. is triggered during the search for the basic model, the program moves to substep 2.4.<br /> ::'''2.3.2.''' The bar is not an absolute extreme (as a potential point 4). In this case, the program looks for another candidate for point 5 according to this step (i.e., according to step 2).<br /> If the program has processed 50 bars in a row according to this step (step 2), and the program has not moved to another step of the algorithm, then this potential point 3 is discarded.<br /> If there are 150 or more bars&lt;ref&gt;Continuous search range of t.5 in one iteration for EAM model&lt;/ref&gt; between potential point 3 and the analyzed bar, and potential points 4 and 5 are not found, then this potential point 3 is discarded.<br /> :'''2.4.''' Real-Time Verification of t.5 <br /> :The potential t.5 bar is checked for the presence of bars between the analyzed bar and the potential t.4 bar, which contain price values more distant (or even equally distant) from the potential t.4 than the most distant from t.4 value of the analyzed bar. This is a check of the potential t.5 for beeing the '''potential absolute extreme'''. The following options are possible:<br /> ::'''2.4.1.''' If the extreme is potentially absolute, the program proceeds to step 3.<br /> ::'''2.4.2.''' If the extreme is not potentially absolute, the program checks the next bar starting from this step (i.e., step 2).<br /> <br /> ===''' Step III. Confirmation of Point 4. Searching for Alternative t.5 and t.5&quot; '''===<br /> The program checks whether the bar of potential t.5 has reached the level of t.4. Two scenarios are possible:<br /> :'''3.1.''' The Bar of Potential t.5 Has Reached t.4.<br /> :In this case:<br /> ::The model is built through absolute t.5.<br /> ::The t.5 bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> ::Point 4 is confirmed,<br /> ::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3 (since there is already possible to display the model through t.5 on the chart).<br /> :'''3.2.''' The Bar of Potential t.5 Has Not Reached t.4. <br /> :In this case, the program checks the next bar for reaching the level of t.4. The following options are possible:<br /> ::'''3.2.1. The Considered Bar Reaches the Level of Potential t.4. <br /> ::In this case:<br /> :::The model is built through absolute t.5.<br /> :::The considered bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> :::Point 4 is confirmed,<br /> :::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3.ext, but first goes through sub-step 3.3.<br /> ::'''3.2.2.''' The Considered Bar Does Not Reach the Level of t.4.<br /> ::In this case the program checks the next bar for overcoming the level of potential t.5. Two scenarios are possible:<br /> :::'''3.2.2.1.''' If the t.5 level is overcome, the analyzed bar is considered as a new potential t.5. The program processes this bar according to step 2.<br /> :::'''3.2.2.2.''' If the t.5 level is not overcome, the analyzed bar is checked for reaching the level of t.4 according to sub-step 3.2.<br /> ::In parallel (i.e., an additional branch is created), the program proceeds to sub-step 3.3 (since there is already an option to display the model through t.5 on the chart). The model in this branch receives a &quot;draw_flag&quot; label.<br /> :'''3.3.''' Construction of the Trend Line (TL). <br /> :A Trend Line (TL) is constructed from t.3 to t.5. Each bar between t.3 and t.5 is checked for breaking the TL. Two scenarios are possible:<br /> ::'''3.3.1.'''The Price Crosses the TL. <br /> ::In this case, the TL through t.3 is not constructed. The program searches for a candidate for point 3' (hereafter - t.3'). T.3' is selected in such a way that the TL' (constructed from t.3' to t.5) is not crossed by the price in the 3-5 segment. Rule No.1 for t.3' is not applied. T.3' cannot belong to the same bar as t.4. Two scenarios are possible:<br /> :::'''3.3.1.1.''' T.3' is found, this model is classified as built through t.3'. The program proceeds to step 4, or to sub-step 3.3.extended if coming from 3.2.<br /> :::'''3.3.1.2.''' T.3' is not found. In this case, the program searches for new potential t.5 and t.4 according to step 2.<br /> ::'''3.3.2.''' The Price Does Not Break the TL. <br /> ::In this case, this model is classified as built through t.3 (absolute extreme). The program proceeds to step 4, or to sub-step 3.3.ext. if current algorithm line is coming from 3.2.<br /> <br /> <br /> ::'''3.3.ext. Additional Trend Line Construction Through t.5&quot;.'''<br /> ::If:<br /> ::*The t.5 bar does not exceed the range of t.4;<br /> ::*At the time of model calculation, the level of t.4 is confirmed, then this model is checked for the possibility of constructing an additional Trend Line (TL) through t.5&quot;. Note: If t.4 is not confirmed, this model should be recalculated upon the appearance of a bar that confirms it's t.4.<br /> <br /> ::''' Definition: Point 5&quot; '''<br /> ::Point 5&quot; can lie in the segment between t.5 and the point confirming t.4. On this segment, a point is searched that meets the following requirements:<br /> <br /> ::''' Rule for Selecting Point 5&quot; High '''<br /> ::To the left of the bar containing t.5&quot;, the nearest high should be above the level of t.5.<br /> ::To the right of t.5&quot;, at least one nearest high should be below or equal to t.5. ::If the nearest high is equal to the level of t.5, then the next high should again be below or equal to the level of t.5, until at least one bar is strictly below the level of t.5.<br /> <br /> ::''' Rule for Selecting Point 5&quot; Low '''<br /> ::To the left of the bar containing t.5&quot;, the nearest low should be below the level of the extreme.<br /> ::To the right of t.5&quot;, at least one nearest low should be above or equal to t.5. If the nearest low is equal to the level of t.5, then the next low should again be above or equal to the level of t.5, until at least one bar is strictly above the level of t.5.<br /> <br /> ::''' Special Cases for Point 5&quot; '''<br /> ::Point 5&quot; may belong to a bar that has broken the level of t.4 (but only the first of such bars). If the bar of potential t.5&quot; breaks the level of calculated t.6 from t.5, then it is impossible to construct a TL through t.5&quot; for this model (this model does not contain such a point).<br /> <br /> :::'''3.3.ext.1.''' Additional TL Calculation <br /> :::If a bar is found that fits the rule for selecting 5&quot;, an additional TL is calculated for the potential t.5&quot; (hereafter TL&quot;). This line is checked for the absence of breaks in the segment from t.3/3'' to potential t.5&quot;.<br /> <br /> :::::'''3.3ext.1.a.''' If there is an intersection, the program moves to check the next bar as a potential t.5&quot;.<br /> <br /> :::::'''3.3ext.1.b.''' If there is no intersection, the found bar is compared with the previous candidate for t.5&quot; (if there was one in the previous iteration of the cycle). If the considered bar is closer to the level of t.4 than the candidate for t.5&quot;, then the considered bar becomes the new candidate for t.5&quot;.<br /> :::The check of bars continues in a cycle until a bar confirming t.4 is reached. If a candidate for t.5 is found as a result of the check, the program moves to sub-step 3.3ext.1.1; otherwise, it moves to step 4.<br /> ::::'''3.3ext.1.1.''' If the analyzed model is built through t.3', a candidate for t.3&quot; is sought in the segment t.3-t.3', through which such a line to t.5&quot; can be built that will not have price intersections in the segment t.3-t.3&quot;.<br /> :::::'''3.3ext.1.1.1.''' If a candidate for t.3&quot; is found, where there are no intersections, a check is made for the intersection of TL&quot; by the bar following t.5&quot;.<br /> ::::::'''3.3.ext.1.1.1.A.''' If there are intersections, t.5&quot; is declared canceled, and the next one is sought according to sub-step 3.3.ext.<br /> ::::::'''3.3.ext.1.1.1.B.''' Otherwise, the program moves to step 13.2.<br /> :::::'''3.3.ext.1.1.2.''' If a suitable t.3&quot; is not found, a re-search for a candidate for t.5&quot; is carried out according to sub-steps 3.3.ext., but in this case, if a candidate for t.5&quot; was found, it becomes a canceled candidate for t.5&quot;. The new candidate must already be further from t.4 than the previously discarded ones.<br /> ::::'''3.3ext.1.2.''' If the analyzed model is built through t.3, a check is made for the intersection of TL'' by the bar following t.5&quot;.<br /> :::::'''3.3ext.1.2.A.''' If there are intersections, t.5&quot; is declared as canceled t.5', and the next one is sought according to sub-step 3.3.ext.<br /> :::::'''3.3ext.1.2.B.''' If there are no intersections, the algorithm moves to step 13.2.<br /> :::'''3.3.ext.2.''' TL'' is checked for price intersections in the segment between t.5 (inclusive) and potential t.5&quot; (hereafter segment 5-5&quot;).<br /> ::::'''3.3.ext.2.1.''' If there is an intersection, then this 5&quot; is filtered out. A re-search for a candidate for t.5&quot; is carried out according to sub-steps 3.3.ext., but in this case, the new candidate must already be further from t.4 (in terms of time) than the previously discarded ones.<br /> ::::'''3.3.ext.2.2.''' If there are no intersections of TL&quot; in the segment 5-5&quot;, then t.5&quot; is found.<br /> ::::In this case, the report displays: EAM5&quot; EAM5&quot;<br /> ::::The program moves to step 4.<br /> ::::'''3.3.ext.2.3.''' If t.5&quot; is not found, the program moves to step 4.<br /> <br /> ==='''Step IV: Searching for Potential Foundation Blocks.'''===<br /> <br /> ====Initial Check====<br /> First, it is necessary to check for the presence of a fixed t.2. If it exists, it means we are in a branch for searching for alternative models.<br /> <br /> ::'''4.0.1.''' If t.2 is defined in the model, proceed to step 6.<br /> ::'''4.0.2.''' If t.2 is not defined, the program moves to step 4.1.<br /> ====Examination of Extremes====<br /> On the preceding trend, extremes are checked sequentially from right to left (i.e., into the past) from t.3 (or from another analyzed bar in repeated applications of this step) according to the N1 bar rule (as a candidate for t.2). Each found candidate for t.2 is checked for the presence of a confirming extreme (which also serves as t.1) according to the following algorithm:<br /> <br /> ::'''4.1.0.''' An extreme candidate for t.2 is found.<br /> ::'''4.1.1.''' The point of the last intersection &lt;ref&gt;High or low of a bar, repeating or crossing high or low of t.2 bar – is an intersection&lt;/ref&gt; of the candidate's level with the price is found. In this case, the program looks for the absolute maximum (if t.2 is a minimum, i.e., t.2 is low) or the absolute minimum (if t.2 is a maximum, i.e., t.2 is high) in the segment from the last intersection of the t.2 level with the price to t.2.<br /> :::'''4.1.1.1.''' Maximum/minimum not found. In this case, the program discards this candidate for t.2.<br /> :::'''4.1.1.2.''' Maximum/minimum found. In this case, the potential t.2 is confirmed.<br /> :::'''4.1.2.''' The program reaches the starting point of the chart.<br /> :::'''4.1.3.''' The check reaches the boundary of the Depth of Search for t.1 &lt;ref&gt;&quot;Search depth t.1 for EAM models&quot; is set in the Calculation Parameters. It is calculated in bars from the bar of the considered potential t.2. By default, this value is 50 bars.&lt;/ref&gt; for the model and none of the above events (4.1.1. or 4.1.2.) occurred.<br /> <br /> ::'''4.2.''' The search for Foundation Blocks (i.e., points 1 and 2, a.k.a FB) continues until one of the events in steps 4.2.A, 4.2.B or 4.2.C. occurs.<br /> :::'''4.2.A. The check reaches the bar containing the (presumed) starting point of the preceding trend (from sub-step 1.2.2.1.). This point is not considered as a potential t.2<br /> :::'''4.2.B.''' The check reaches the bar that intersects the level of the presumed point 4 of the considered model.<br /> :::'''4.2.C.''' A bar that is located at a distance (by time) from T.3 greater than or equal to X* (distance from T.3 to t.4), where x is the parameter set in the settings &lt;ref&gt; This is the &quot;Time Ratio of 23 to 24&quot;(by default it is 3)&lt;/ref&gt;.<br /> ::=== Results ===<br /> ::As a result of the search for potential t.2 (i.e., upon the occurrence of4.2.A, 4.2.B or 4.2.C.), two scenarios are possible:<br /> :::'''4.2.1. ''' One or more pairs of potential t.2 and t.1 are found (potential Foundation Blocks). The program moves to step 5.<br /> :::'''4.2.2. ''' No potential Foundation Blocks are found. In this case, the program looks for the next potential t.5 according to step 2.<br /> <br /> === '''Step V. Search for Presupposition''' ===<br /> Presupposition is an optional part of the EAM.<br /> The program attempts to construct Presuppositions from all available candidates for t.2.<br /> <br /> ==== Presupposition Search Algorithm ====<br /> The program takes each potential t.2 of the EAM (as part of a potential FB) as a t.1 of Presupposition (hereinafter t.1p). In other words, the program tries to construct Presuppositions from each of the t.2.<br /> <br /> Initially, the most recent (rightmost) potential t.2 (or the one specified in the algorithm if we have returned to the beginning of the Step V in the cycle) in the EAM is taken as a potential t.1p. If there are no more unconfirmed t.1p, the algorithm proceeds to Step 6.<br /> <br /> : '''5.1.''' The program sequentially checks bars from left to right (into the future) from the potential t.1p to t.3 of EAM model (excluding t.3) for being an extreme according to the N1 rule as point 3 of the Presupposition (hereinafter t.3p).<br /> <br /> : '''N1 rule for the Presupposition points'''<br /> : If t.1p is low, t.3p must be below t.1p.<br /> : If t.1p is high, t.3p must be above t.1p.<br /> <br /> :: '''5.1.1.''' If the potential t.3p is not found, the program considers the next (to the left of the previous) potential t.2 of the EAM (within the FB) as t.1p.<br /> :: If the potential t.3p is not found, and there are no more potential FBs, the algorithm proceeds to Step 6.<br /> :: '''5.1.2.''' Once the potential t.3p is found, the program searches for point 2 of the Presupposition (hereinafter t.2p) as an extreme with the maximum/minimum price on the segment from t.1p to t.3p (hereinafter segment 1p-3p).<br /> :: If a suitable extreme is not found, the algorithm looks for the next potential t.3p for the previously found t.1p.<br /> :: If a maximum/minimum is found, it is checked for for being an extreme (as t.2p).<br /> :: There are two possibilities:<br /> ::: '''5.1.2.1.''' The bar is an absolute extreme. In this case, a potential t.2p is found, and the program proceeds to step 5.2.<br /> ::: '''5.1.2.2.''' The bar is not an extreme. In this case, the program looks for another candidate for t.3p for the previously found t.1p following the instructions in 5.1.<br /> : '''5.2.''' The program constructs a line from t.1p to t.3p and checks it for price crossings on the segment from t.1p to t.3 of the EAM (including t.3 of EAM).<br /> :: '''5.2.1.''' If this lines price crossings are found, the program looks for a new candidate for t.3p for the previously found t.1p following the instructions in sub-step 5.1.<br /> :: '''5.2.2.''' If there are no price crossings, the program proceeds to sub-step 5.3.<br /> <br /> : '''5.3.''' The program searches for a potential point 4 of the Presupposition (t.4p) according to the N1 rule on the segment from t.3p to t.3 in the VMP (including t.3).<br /> <br /> : If t.1p is low, t.4p must be below t.2p. Each subsequent candidate for t.4p must be below the previous candidate for t.4p.<br /> : If t.1p is high, t.4p must be above t.2p. Each subsequent candidate for t.4p must be above the previous candidate for t.4p.<br /> : Possible scenarios:<br /> :: '''5.3.A.''' If the potential t.4p coincides with t.3 in the EAM, t.4p is confirmed (found), and the program proceeds to sub-step 5.3.1.<br /> :: '''5.3.B.''' If the potential t.4p does not coincide with t.3 in the EAM (i.e., it is located before it), the program looks for an opposite-direction potential t.4p extreme on the segment from the potential t.4p (excluding it) to the bar where the price again reached the value of the potential t.4p (excluding it).<br /> <br /> :: There are two possibilities:<br /> ::: '''5.3.B.1.''' If the opposite-direction extreme is found, t.4p is confirmed (found), and the program proceeds to sub-step 5.3.1.<br /> ::: '''5.3.B.2.''' If the opposite-direction extreme is not found, the program looks for a new potential t.4p following the instructions in sub-step 5.3.1.<br /> :: '''5.3.1.''' If t.4p is found, the program constructs a line from t.2p to t.4p and checks it for price crossings on the segment from t.1p (excluding it) to t.3 in the VMP (including t.3).<br /> ::: If unnecessary intersections are found, the program looks for the next potential t.4p on the segment following the instructions in 5.3.<br /> ::: If no unnecessary intersections are found, the algorithm proceeds to sub-step 5.4.<br /> :: '''5.3.2.''' Check for Absolute Level<br /> :: The program checks the bar of the potential t.3p for absoluteness. The level of t.3p should not be exceeded by the price on the segment between t.3p and potential t.4p (excluding it).<br /> ::: '''5.3.2.1.''' If the level of t.3p is exceeded, the potential t.3p is discarded, and the program looks for a new t.3p following the instructions in sub-step 5.1. and further according to the algorithm.<br /> <br /> :::: '''5.3.2.2.''' If the level of t.3p is not exceeded, t.3p is confirmed, t.4p is confirmed, and the algorithm proceeds to sub- step 5.4.<br /> <br /> ==== Presupposition Verification ====<br /> : ''' 5.4.''' Presuppositions undergo the following checks:<br /> :: '''A.''' - Bars t.1p, t.2p, t.3p must follow each other.<br /> :: '''B.''' - The distance in levels between t.1 and t.2 (hereinafter rank 12) must be at least the value of the Minimum Distance between t.1 and t.2 Levels of the Presupposition, which is set in the Calculation Parameters, from the distance between t.4 and t.5 levels of the EAM model(this is rank 45).<br /> <br /> :: If all checks are successful, the Presupposition is found. If there are no unchecked t.1p left, the algorithm proceeds to Step 6.<br /> <br /> :: If there are no unchecked t.1p left, the algorithm proceeds to Step 6.<br /> <br /> === '''Step VI. Check for AL price crossings''' ===<br /> <br /> ==== '''6 alfa.''' ==== <br /> First it is necessary to check for the presence of a fixed t.2. If it exists, it means we are in a branch of searching for alternative models. <br /> <br /> The potential Aims Line (from t.2 to t.4), hereinafter referred to as AL, is calculated, and then:<br /> : '''6 alfa.1.''' AL Crossing Check<br /> <br /> :: '''6 alfa.1. A.''' - If there are no AL price crossings, the algorithm proceeds to step 6 alfa.2.<br /> :: '''6 alfa.1. B.''' - If AL is crossed, the next potential t.5 is determined according to Step 2, starting from bar t.5+2.<br /> : '''6.2. alfa.''' Distance Check for AL and TL Intersection<br /> : If:<br /> :: - TL and AL of the model do not intersect on the right (in the future) or<br /> :: - the ratio of the distance in bars between t.2 and t.4 to the distance between t.4 and the calculated point 6 is less than the default value of the parameter &quot;Minimum ratio of t.2-t.4 to t.4-t.6 EAM,&quot; then the search for alternative models is terminated. Otherwise, the program proceeds to Step 9. <br /> <br /> ====''' In the general case (no precviously fixed t.2)''' ====<br /> The program performs the following checks for each of the potential FBs:<br /> : '''6.1.''' AL Price Crossing Check (not just touching)<br /> : If AL intersects with the price on the segment between t.2 and t.4, this pair of candidates for t.1 and t.2 (this FB) is rejected.<br /> :: '''6.1.A.''' If FBs are found that give AL without intersections, the algorithm proceeds to step 6.2.<br /> :: '''6.1.B.''' If there are no suitable FBs, the algorithm looks for a new t.5 according to Step 2.<br /> <br /> : '''6.2.''' Checking for intersection of AL and TL (hereinafter referred to as calculated point 6) with each other on the right (in the future) along the time axis.<br /> : If the ratio of the distance in bars between t.2 and t.4 to the distance between t.4 and the calculated t.6 is less than the default value of the parameter &quot;Minimum ratio of t.2-t.4 to t.4-t.6 VMP,&quot; then these candidates for t.1 and t.2 are rejected.<br /> : The following scenarios are possible:<br /> :: '''6.2.A.''' One or several potential FBs remain - in this case, the program proceeds to Step 7.<br /> :: '''6.2.B.''' There are no potential FBs left - in this case, the program looks for a new potential t.5, starting from Step 2 and onwards.<br /> <br /> === '''Step VII. Dtermintaion of FB's with and without 2X5''' ===<br /> <br /> The program checks for the intersection of the bodies of candles at t.2 and t.5 (hereinafter referred to as 2x5). If there is only one potential FB, determining FB with 2x5 is not required, and the program proceeds to Step 8.<br /> <br /> :'''7.1.''' If there are multiple potential BOs, some of which have 2x5 and some do not, those potential BOs that have 2x5 are filtered out, and the program proceeds to Step 8.<br /> <br /> :'''7.2.''' If all potential FBs have 2x5, then all are filtered out except the one whose t.2 level is closer to the t.3 level. The program proceeds to <br /> <br /> === '''Step VIII: Filtering Based on Presupposition''' ===<br /> <br /> The algorithm checks whether Presuppositions have been found for the analyzed model.<br /> <br /> :'''8.0.''' If no Presuppositions are found, the program proceeds to Step 9.<br /> <br /> :'''8.1.''' The model has one or more Presuppositions. For each Presupposition program checks if the available candidates for t.2 belong to the interval between the last price level intersection of t.1p and t.1p itself (t.1p can also be used as t.2 EAM).<br /> <br /> ::'''8.1.1.''' There are candidates for t.2 that belong to the interval between the last price level intersection of t.1p and t.1p itself. Such a Presupposition is retained.<br /> ::'''8.1.2.''' There are no candidates for t.2 within the specified interval. In this case, such a Presupposition is discarded and not further considered (meaning the model has no Presupposition).<br /> :'''8.2.''' If after checking all Presuppositions according to sub-step 8.1., there are one or more Presuppositions with candidates in t.2 within the interval between the last price level intersection of t.1p and t.1p itself (inclusive), then:<br /> <br /> : - Among such Presuppositions, only the one with t.1p occurring later on the time axis is considered further;<br /> : - Only those candidates that belong to the interval between the last price level intersection of t.1p and t.1p itself are retained as t.2 candidates for the remaining Presupposition.<br /> ::'''8.2.1.''' If only one potential FB remains, the model is confirmed.<br /> ::'''8.2.2.''' If more than one potential FB remains, the program proceeds to Step 9.<br /> <br /> === '''Step IX. Search for Embedded Models in EAM''' ===<br /> <br /> :'''9.1.''' If EAM is constructed through t.3', then the interval from EAM's t.3 is checked for the presence of models according to Algorithm I, for which the following conditions are simultaneously satisfied. In the paragraph below, the numbers I and II in parentheses next to the model points denote the algorithm to which the model with this point belongs:<br /> <br /> : - If the model according to Algorithm I contains t.5, then its t.5 should precede or coincide with the t.5 of the analyzed EAM.<br /> : - t.4 does not lie beyond t.4 of the analyzed EAM; (bar of t.4(I) cannot coincide with bar of t.3(II), but can coincide with bar of t.4(II);<br /> : -t.1 lies before t.3' of the analyzed model (if it coincides with bar of t.3', then it is not suitable anymore) (t.1(I) can coincide with t.3(II), but cannot coincide with t.3'(II)<br /> <br /> If there are more than 5 models, those with the time distance from t.1 to t.4 greater than others are considered embedded models.<br /> <br /> ::'''9.1.1.''' If models are not found, then EAM does not have an embedded primary model.<br /> <br /> ::'''9.1.2.''' If the model/s is/are found, EAM is given the status of &quot;Models described near the Primary model.&quot;<br /> <br /> ::'''9.1.3.''' If EAM has one or more embedded models, models among them built from EAM's t.3 are searched for meeting one of the following criteria:<br /> <br /> ::: A. Having a trendline breakthrough in the interval before t.3' of the analyzed model;<br /> ::: B. Having an intersection of candle bodies at points 2 and 5 (hereinafter 2x5).<br /> ::: C. If the embedded model has a rank 45 greater than the ranks of 12 and 25 of the same model.<br /> ::: '''9.1.3.1.''' In the presence of one of these criteria, the model is Specific based on the 1st criterion.<br /> ::: '''9.1.3.2.''' In the absence of the specified criteria, the model is Normal based on the 1st criterion.<br /> <br /> :: '''9.1.4.''' If there is a model according to Algorithm I on the interval from t.3 to t.3' of the EAM, aligned with the preceding EAM trend, and with points t.1-t.4 lying on the interval 3-3' EAM (inclusive), then this EAM is Specific based on the 2nd criterion. <br /> :: In the absence of the specified criteria, the model is Normal based on the 2nd criterion.<br /> <br /> : Upon completion of all checks in step 9.1., the program proceeds to step 10.<br /> <br /> :'''9.2.''' If EAM is constructed through t.3, the program proceeds to step 10.<br /> <br /> === '''Step X. Search for Preceding Models''' ===<br /> <br /> The program identifies all possible models in accordance with Algorithm I, starting from the initial point of the preceding trend or starting from the presumed initial point of the preceding trend, see step 1.3.).<br /> In these models, the actual t.6 is determined, and if there was no intersection of TL, the Presumed t.6 (P6supp) is used. The algorithm for finding the actual/presumed t.6 is described in the branch of Algorithm I, see substep 5.3.<br /> <br /> Models on the preceding trend, with TL coinciding with t.3 of the EAM, are (directly) preceding for the given TL.<br /> <br /> Models on the preceding trend, for which the following conditions are simultaneously satisfied:<br /> : - actual/presumed t.6 precedes or equals t.3 of the EAM;<br /> : - t.6 is aligned with t.4 of the EAM;<br /> : - the level of t.6 lies between the levels of t.3 and t.4 of the EAM;<br /> are considered preceding corrective for the given EAM.<br /> <br /> From models with the same t.4 and the same t.1, the model with the later t.1 is selected as the priority for choosing t.2.<br /> <br /> From the remaining models with the same t.4, only the very last model is considered as both preceding and preceding corrective (i.e., with a later t.5 or without t.5) – one of each type.<br /> <br /> If there are more than 10 preceding and preceding corrective models (rarely encountered), only the last ones are selected (the last ones are determined as those with t.4 lying later than others).<br /> <br /> === '''Step XI. Final Selection of t.2 - Checking the Convergence of LT and LC''' ===<br /> <br /> :'''11.0.''' If t.2 is known (for example, in the case algorythm is searching for an alternative model), proceed directly to sub-step 11.3.<br /> <br /> ::'''11.0.1.''' The program finds the closest (in terms of time from t.1 of these models to t.3 of EAM) linked model on the preceding trend (preceding or preceding corrective).<br /> :::'''11.0.1.1.''' If<br /> :::: - the closest preceding model is a model from the beginning of the trend, and<br /> :::: - t.2 of the analyzed model is before or coincides with t.1 of the preceding model, then the considered t.2 is rejected, and this branch of the algorithm is terminated.<br /> :::'''11.0.1.2.''' If<br /> :::: - the closest preceding model is a trend model, and<br /> :::: - t.2 of the analyzed model is before t.1 of the preceding model,<br /> ::: the considered t.2 is rejected, and this branch of the algorithm is terminated.<br /> <br /> If EAM contains a presupposition, the program proceeds to sub-item 11.2. If the model does not contain a presupposition, the program proceeds to sub-item 11.1.<br /> <br /> :'''11.1.''' The program finds the closest (in terms of time from t.1 of these models to t.3 of EAM) linked model on the preceding trend (preceding or preceding corrective).<br /> ::'''11.1.0.''' If there are no preceding models, the program proceeds to sub-step 11.2.<br /> ::'''11.1.1.''' If the nearest found linked model (preceding or preceding corrective) is a model from the beginning of the trend (not a trend model), then all potential t.2 that coincide with the bar of t.1 of the found linked model or are located before t.1 of the found linked model are rejected. The program proceeds to sub-step 11.2.<br /> ::'''11.1.2.''' If the nearest found linked model (preceding or preceding corrective) is a trend model, then<br /> :::'''11.1.2.1.''' In the presence of a preceding trend model, all t.2 that are located before t.1 of the preceding model are rejected. In other words, t.1 of the preceding can be t.2 of EAM, and the points located before t.1 of the preceding - cannot be t.2 of EAM. The program proceeds to sub-step 11.2.<br /> :::'''11.1.2.2.''' In the presence of a preceding corrective trend model, the program looks for another linked model on the preceding trend of EAM (the next in terms of distance) and analyzes it as a reference for this item (11.1.). In other words, the program returns to the beginning of sub-step 11.1.<br /> <br /> ::'''11.2.1.''' For specific models, the program selects the most distant t.2 in terms of time from t.3.<br /> ::'''11.2.2.''' For simple models, the program selects t.2 that is as close as possible in time to t.3.<br /> <br /> :'''11.3.''' The algorithm calculates the level of intersection of TL and AL of EAM (hereinafter – the calculated t.6). The position of t.5 in relation to the level of the calculated t.6 is checked. There are two possible scenarios:<br /> ::'''11.3.1.''' If the bar of t.5 does not penetrate the level of the calculated t.6, the program checks if t.5'' has been found (in sub-step 13). Two scenarios are possible:<br /> :::'''11.3.1.1.''' If t.5'' has been found, then the program checks for the convergence of TL'' and AL. <br /> ::::'''11.3.1.1.А.''' If the lines converge, then the program checks for the extent of convergence of TL'' and AL. If the ratio of the distance in bars between t.2 and t.4 to the distance between t.4 and the calculated t.6'' is less than the default value of the parameter &quot;Minimum ratio of t.2-t.4 to t.4-t.6 EAM&quot;, then t.5'' is rejected.<br /> ::::'''11.3.1.1.Б.''' If TL'' and AL diverge, then t.5'' is rejected.<br /> :::: In the end of sub-step 11.3.1.1. - the program records the model.<br /> <br /> :::'''11.3.1.2.''' If t.5'' is absent, the program records the model.<br /> <br /> ::'''11.3.2.''' If the bar of t.5 penetrates the level of the calculated t.6, then this EAM cannot be built, and the program looks for a new t.5 by processing the bar following the bar of t.5 according to sub-step 2 and further according to the algorithm.<br /> <br /> <br /> === '''Step XII. Search for Alternative Models''' ===<br /> <br /> A new model is sought, but the points t.3, t.2, and Presupposition (if any) are retained. This is the final step of Algorithm II.<br /> <br /> ==References==<br /> &lt;references /&gt;</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_I&diff=215 2024-01-04T20:59:18Z

<p>Admin: /* Step V. Model Fixation at the TL Breakthrough. Search for t.5. Search for t.6. */</p> <hr /> <div> '''The Orientaion rule (N1 requirement) for Algorithm I is as follows:'''<br /> If point 1 is low, then the level of point 3 should be equal to or higher than point 1. <br /> If point 1 is high, then the level of point 3 should be equal to or lower than point 1.<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with [[UMG General Concepts]].<br /> <br /> <br /> ==='''Step I. Find Point 1. Search for a Confirming Extreme.'''===<br /> : '''1.1.''' The program searches for the first possible extreme that satisfies Single Bar Rule. This extreme is a candidate for point 1.<br /> : '''1.2.''' When a candidate for point 1 (hereinafter referred to as t.1 candifate) is found, all bars to the left (i.e., in the past) of the bar containing the t.1 candidate extreme are checked until one of the following events occurs:<br /> :: '''1.2.1.''' The place of the last intersection of the price level of the t.1 candidate is found &lt;ref&gt;High or low equal to high or low of t.1 is an intersection&lt;/ref&gt;. In this case, the program searches for an absolute extreme that confirms point 1 from the intersection of the price with the t.1 candidate level (inclusive) to the bar of t.1 candidate (exclusive). There are two possibilities:<br /> ::: '''1.2.1.1.''' If the extreme is not found, the program searches for a new candidate for point 1.<br /> ::: '''1.2.1.2.''' If the absolute extreme is found, it is the beginning of the preceding trend. The point 1 is confirmed. <br /> ::: The program checks for the absence of extremes equal to point 1 from the Beginning of the preceding trend. <br /> :::: '''1.2.1.2.1.''' If such an extreme is found, this candidate for point 1 is discarded (the program continues to process other t.1 candidates).<br /> :::: '''1.2.1.2.2.''' If such an extreme is not found, the program proceeds to process the next bar after point 1 according to point 2 of the Algorithm.<br /> :: '''1.2.2.''' The program has reached the starting point of the chart (i.e., after the starting point of the chart, the levels of points 1 and 2 have never intersected). The program searches for a confirming extreme from right to left to the starting point of the chart. The options are similar to the sub-steps 1.2.1.1. and 1.2.1.2.<br /> :: '''1.2.3.''' The program has checked 50 bars &lt;ref&gt;The depth of the search for the extreme confirming point 1&lt;/ref&gt; preceding the bar of the potential point 1, and none of the above events have occurred. The program searches for a confirming extreme from right to left in the area of 50 bars before the potential point 1. The options are similar to the sub-steps 1.2.1.1. and 1.2.1.2.<br /> <br /> ==='''Step II. Searching for Points 3 and 2.'''===<br /> If the program returns to this step during the construction of an alternative model, this branch of the algorithm stops.<br /> <br /> The bar being analyzed after point 1 (or in cases of repeated application of the step specified in the algorithm) is checked for non-exceedance of the level of point 1.<br /> : '''2.1.''' If the level of point 1 is exceeded, the program discards this point 1.<br /> : '''2.2. Searching for Point 3.''' If the level of point 1 is not exceeded, the bar being analyzed is checked by rule N1 as an extreme.<br /> :: '''2.2.1.''' If this bar is not an extreme according to rule N1 (as a potential point 3)&lt;ref&gt; Here and further under the formulation (as a potential T.3) a reminder is implied that this extremum should be aligned with the potential T.1. (see the Rule of alternating extremes).&lt;/ref&gt;, the program checks the next bar in accordance with step 2.<br /> :: '''2.2.2.''' If this bar is an extreme according to rule N1 (as a potential point 3), then<br /> ::: '''2.2.2.1.''' If this step (step 2) is applied again after confirmed candidates for point 3 have been found (i.e., such point 3, for which there is a point 2 between point 3 and point 1), but for one reason or another they were rejected, and the algorithm returned to the search for point 3, then the exceedance of the level of the previous candidate for point 3 by this extreme is checked.<br /> :::: '''2.2.2.1.A.''' If the check is not passed (i.e., if the level of the previous candidate for point 3 is not exceeded), then the program processes the next bar in accordance with this step (step 2) and further according to the algorithm.<br /> :::: '''2.2.2.1.B.''' If the check is passed, then the program proceeds to sub-step 2.2.2.2.<br /> ::: '''2.2.2.2. Searching for Point 2.''' The program searches for an absolute minimum (if point 1 and point 3 are high) or maximum (if point 1 and point 3 are low) in the range from point 1 to point 3 (hereinafter segment 1-3) as point 2 (hereinafter point 2). Then this bar is checked for &quot;extremity&quot; according to N1 rule. Two variants are possible &lt;ref&gt;As part of this particular check, it should be noted that bars T.1 and T.3 should not reach the level of T.2&lt;/ref&gt;:<br /> :::: '''2.2.2.2.A.''' If the bar is an extreme, then this is a potential point 2, and the potential point 3 becomes a confirmed point 3. In this case, the program proceeds to step 3.<br /> :::: '''2.2.2.2.B.''' The bar is not an extreme. In this case, the program begins to search for another candidate for point 3, for which it returns to the beginning of step 2.<br /> <br /> If the program has processed 50 bars &lt;ref&gt;The range of continuous search is t.3 in one iteration for all models except EAM&lt;/ref&gt; in a row in accordance with this step (step 2), and potential points 2 and 3 have not been found (i.e., the program has not yet moved to another step of the algorithm), then this potential point 1 is discarded.<br /> <br /> If there are 150 or more bars &lt;ref&gt;Maximum search range t3 for all models except EAM&lt;/ref&gt; between the potential point 1 and the bar being analyzed, and the program has not yet moved to another step of the algorithm, this potential point 1 is discarded.<br /> <br /> ==='''Step III. Building TL. Search for t.4'''===<br /> : '''3.1. Checking for Fragmentation of the Base:''' After finding candidates for points 1, 2, and 3, a check is performed for the fragmentation of the Base. This means that there should be no extremes, co-directed with t.1, between the levels of t.1 and t.3 (Extremes that Fragment the Base, hereinafter referred to as EFB).<br /> <br /> :: '''3.1.1:''' If such extremes are present, the program checks each EFB for the presence of a confirming counter-directed extreme on the section from the last intersection of the price level of the EFB to the EFB (analogous to the search for a confirming extreme of a potential t.1 in sub-step 1.2.1). If the EFB does not have a confirming extreme, then such an EFB is no longer considered (i.e., if there are no EFBs with confirming extremes, then the check is passed). If there is at least 1 EFB with a confirming extreme, then:<br /> :: - The Base is fragmented;<br /> :: - The confirmed t.3 becomes a cancelled t.3;<br /> :: The program searches for a new t.3, for which it processes the next bar after the bar of the last cancelled t.3 according to step 2 of the algorithm.<br /> :: '''3.1.2:''' If the check is successful and no EFBs are found (including if there are no confirmed EFBs), then the program proceeds to sub-step 3.2.<br /> <br /> <br /> :'''3.2. Building and Checking TL on the 1-3 Section'''<br /> : '''Determining the Section on Which t.3' Can Be Found'''<br /> : '''Searching for t.3'.'''<br /> :The parameters of the Trend Line passing through t.1 and t.3 (hereinafter TL) are calculated. TL is checked for breakthroughs on the 1-3 section.<br /> :: '''3.2.1.''' TL is Broken<br /> :: The bar of the confirmed t.3 is checked for breaking the level of t.2.<br /> ::: '''3.2.1.1.''' If the level of t.2 is broken by the bar of the confirmed t.3, the confirmed t.3 becomes a cancelled t.3. The program searches for a new t.3. To do this, the bar that broke the level of t.2 is processed according to sub-step 3.4.<br /> ::: '''3.2.1.2.''' If the level of t.2 is not broken by the bar of the confirmed t.3, then the next bar is processed according to sub-step 3.2.3.<br /> :: '''3.2.2.''' TL is Not Broken - the bar following the bar of the confirmed t.3 is processed according to sub-step 3.3.<br /> <br /> ::'''3.2.3. Determining the Section on Which t.3' Can Be Found'''<br /> ::The analyzed bar is checked for breaking the level of the confirmed t.3.<br /> ::: '''3.2.3.1.''' If the level of the confirmed t.3 is broken, the confirmed t.3 becomes a cancelled t.3. The program searches for a new t.3. For this, the bar that broke the level of the confirmed t.3 is processed according to step 2 and further according to the algorithm.<br /> ::: '''3.2.3.2.''' If the level of t.3 is not broken, the program checks the analyzed bar for breaking the level of t.2.<br /> :::: '''3.2.3.2.1.''' If the level of t.2 is not broken, the program analyzes the next bar according to sub-step 3.2.3.<br /> :::: '''3.2.3.2.2. Searching for t.3'.'''<br /> :::: If it breaks the level of t.2, then the program looks for such a point 3' (hereinafter t.3') through which a line can be drawn from t.1 to t.3', which will not contain extra touches by the price on the section from the bar of t.1 to the bar following the bar of t.3' (inclusive), and this line should not contain extra breakthroughs (not touches) by the price on the section to the bar that broke the level of t.2 (not inclusive).<br /> ::::: '''3.2.3.2.2.A.''' If t.3' is found, then the TL is rebuilt through t.3' (i.e., TL is now the line from t.1 to t.3'), and the algorithm searches for a potential t.4, for which it processes the bar that broke the level of t.2 (but if the bar that broke the level of t.2 coincides with the bar of t.3', then the program immediately proceeds to process the next bar) according to sub-step 3.4.<br /> ::::: '''3.2.3.2.2.B.''' If the point t.3' is not found, then the confirmed t.3 becomes a cancelled t.3. The program searches for a new t.3, for which it processes each previously unprocessed bar for the cancelled t.3 according to step 2 and further according to the algorithm. <br /> <br /> : If between t.1 and the analyzed bar there are 150 or more bars, and the program has not yet moved to another step of the algorithm, this potential t.1 is discarded.<br /> <br /> :'''3.3. Checking TL on the Section After t.3.'''<br /> : The analyzed bar is checked for overcoming TL.<br /> :: '''3.3.1. TL is not overcome''' - the analyzed bar is processed according to sub-step 3.4.<br /> :: '''3.3.2. TL is overcome.''' In this case, there are 2 options:<br /> ::: '''3.3.2.1.''' If between the analyzed bar (not inclusive) and the bar of t.3 (inclusive) the level of t.2 was not reached, the program performs a search for t.3', for which it moves to sub-step 3.2.3.<br /> ::: '''3.3.2.2.''' If between the analyzed bar (not inclusive) and the bar of t.3 (inclusive) the level of t.2 was reached, the program performs a search for a new candidate for t.3. For this, the analyzed bar is processed according to step 2 and further according to the algorithm.<br /> <br /> :'''3.4: Searching for Potential or Alternative t.4'''<br /> : If the program is searching for t.4 and the analyzed bar is further from t.1 than 5 times the distance between t.1 and t.3, then this potential t.1 is discarded.<br /> : If the program is searching for an alternative t.4 and the analyzed bar is further from t.1 than 10 times the number of bars between t.1 and t.3, then the search for an alternative t.4 is terminated.<br /> : The analyzed bar is checked for being an extreme according to rule N1 (as a potential t.4).<br /> <br /> ::'''Step 3.4.1: If the Bar is not an Extreme'''<br /> :: The program checks the analyzed bar for breaking through (in this case, not touching) the TL.<br /> ::: '''Step 3.4.1.1:''' If the TL is not reached (not broken), then the program processes the next bar according to step 3.4.<br /> ::: '''Step 3.4.1.2:''' If the TL is broken, then the analyzed bar is processed similarly to step 3.3.2.<br /> <br /> ::'''Step 3.4.2: If the Bar is an Extreme'''<br /> :: This is potentially t.4, proceed to step 3.5.<br /> <br /> :'''3.5. Checking the Position of t.4'''<br /> : The program checks the position of the potential t.4 relative to the extreme of t.2. There are 3 possible scenarios:<br /> :: '''3.5.1.''' The level of the potential t.4 is closer to the level of t.1 than the level of t.2. A candidate for t.4 for the Wedge model is found. In this case:<br /> ::: '''3.5.1.0.''' The bar of the potential t.4 is checked for the presence between it and the bar of t.3 of bars containing price values<br /> :::: more distant from t.3 than the value of the potential t.4, or<br /> :::: equal to t.4.<br /> :::: This is a check for the potential absoluteness of the extreme of the potential t.4. Possible options are:<br /> ::::: '''3.5.1.0.1.''' The potential t.4 is not a potentially absolute extreme (there are bars more distant from t.3). In this case, the next bar is processed according to sub-step 3.4.<br /> ::::: '''3.5.1.0.2.''' The potential t.4 is a potentially absolute extreme. In this case checking if t.2-t.4 line (this is the Aims Line, hereinafter - AL) is crossed by the price in the section between t.2 and t.4 (hereinafter - section 2-4). There are 2 options – 3.5.1.1. and 3.5.1.2.<br /> :::::: '''3.5.1.1.''' If AL is crossed, the program checks the analyzed bar for reaching the TL.<br /> :::::::: '''3.5.1.1.1.''' If the TL is not reached - the next bar is processed according to sub-step 3.4.<br /> :::::::: '''3.5.1.1.2.''' If the TL is reached, the program searches for a new candidate in t.3/t.3'. To do this, the analyzed bar is processed according to sub-step 3.2.3 and further according to the algorithm.<br /> :::::: '''3.5.1.2.''' If there is no linecrossing, the bar t.4 is checked for reaching the TL. The following options are possible:<br /> :::::::: '''3.5.1.2.1.''' If the bar t.4 reached the TL, then the [Wedge Found] Wedge model is fixed, for which the level of intersection of the TL and the AL is calculated, after which the program searches for t.3’ with the same points 1,2,3, or searches for a new t.3. To do this, the program processes the analyzed bar (in this case, the bar t.4, while reaching the TL) starting from sub-step 3.2.3. Model's Type (parameter G1) = WEDGE . <br /> :::::::: '''3.5.1.2.2.''' If the t.4 bar did not reach the TL, then the next bar after it (and when reapplying this step - the next bar after the previously analyzed bar) is analyzed for reaching the TL. At the same time, a check is made for not overcoming the distance equal to (t.1-t.3)*10. If the distance is overcome, then we return (go in a cycle) to the search for t.3. The following options are possible:<br /> :::::::::: '''3.5.1.2.2.1.''' If the analyzed bar reached the TL, then the program acts in analogy with sub-step 3.5.1.2.1. (i.e., the [Wedge Found] Wedge model is fixed and in a new branch of the algorithm the program processes the analyzed bar (in this case, the bar that reached the TL) starting from sub-step 3.2.3.<br /> :::::::::: '''3.5.1.2.2.2.''' If the TL is not reached, then the analyzed bar is checked for reaching the level of t.4. The following options are possible:<br /> :::::::::::: '''3.5.1.2.2.2.A.''' If the level of t.4 is not reached, the program analyzes the next bar for reaching the TL, options are similar to sub-steps 3.5.1.2.2.1. and 3.5.1.2.2.2.<br /> :::::::::::: '''3.5.1.2.2.2.B.''' If the level of t.4 is reached, then the program checks the analyzed bar according to sub-step 3.4.<br /> :: '''3.5.2.''' The level of the potential t.4 is further from the level of t.1 than the level of the potential t.2 - transition to step 4.<br /> :: '''3.5.3.''' The level of the potential t.4 is equal to the level of the potential t.2 - the program checks whether the bar of the considered candidate in t.4 has broken through (touched) the Trend Line (TL).<br /> ::: '''3.5.3.1. If not''' - the program searches for the next candidate for t.4. For this, the program processes the next bar according to sub-step 3.4.<br /> ::: '''3.5.3.2. If yes''' – the program searches for a new t.3, for which it analyzes the next bar according to step 2 and further according to the algorithm.<br /> <br /> <br /> ==='''Step IV. Checking for Intersection of the Aim Line (AL) by Price on Section 2-4'''===<br /> The program checks for intersections of the Aim Line by price on the section from t.2 to t.4 (hereafter - section 2-4).<br /> : '''4.1.''' If the AL is intersected by price on section 2-4 the program checks the analyzed bar (which is also the bar of the potential t.4) for a breakout (in this case, not a touch) of the Trend Line (TL).<br /> :: '''4.1.1.''' If the TL is not reached, the program processes the next bar according to step 3.4.<br /> :: '''4.1.2.''' If the TL is broken,<br /> ::: - t.3 becomes the cancelled t.3;<br /> ::: - the program searches for a new candidate for t.3. To do this, the analyzed bar is processed according to step 2.<br /> : '''4.2.''' If the AL is not intersected by price on section 2-4 the program proceeds to step 5.<br /> <br /> <br /> ==='''Step V. Model Fixation at the TL Breakthrough. Search for t.5. Search for t.6.'''===<br /> <br /> 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:<br /> <br /> : '''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.<br /> :: '''5.1.1.''' If the level of t.4 is not surpassed, then the model is considered formed [The model is formed without 6];<br /> :: Then the program proceeds to step 6.<br /> <br /> :: '''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).<br /> :: 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).<br /> <br /> ::: '''5.1.2.1.''' If the extreme is found - this is a potential t.5.<br /> ::: There are 2 scenarios:<br /> :::: '''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:<br /> ::::: '''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.<br /> ::::: There are 2 scenarios:<br /> ::::::: '''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.<br /> ::::::: '''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.<br /> <br /> ::::: '''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.<br /> <br /> :::: '''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.<br /> <br /> ::: '''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.<br /> <br /> : '''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:<br /> <br /> : for extremity according to rule N1 (as t.5);<br /> : 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<br /> :-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).<br /> :: '''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:<br /> ::: '''5.2.1.1.''' If the level of t.4 is reached (confirmed by the bar of the potential t.5)<br /> ::: 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:<br /> ::: There are 2 scenarios:<br /> :::: '''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:<br /> ::::: '''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.<br /> ::::: '''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.<br /> <br /> :::: '''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. <br /> :::: The program proceeds to step 6. (there was an idea to redo to step 5.3.)<br /> <br /> ::: '''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.<br /> <br /> :: '''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.<br /> ::: '''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:<br /> :::: '''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.)<br /> :::: '''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.<br /> <br /> ::: '''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).<br /> <br /> '''5.3.''' Algorithm for determining the presumed real p.6:<br /> <br /> : '''5.3.1.''' Apply Algorithm I to the models, excluding AM.<br /> : 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.<br /> :The extremum identified in step 2 is considered the real t.6.<br /> <br /> :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.<br /> <br /> : '''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.<br /> :: '''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.<br /> <br /> ::: '''5.3.2.2.''' If the number of bars formed after t.4 does not exceed 300, several scenarios are possible.<br /> :::: '''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.<br /> :::: 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.<br /> :::: The program then checks if the price has surpassed this level in the section after t.4 of the analyzed model.<br /> <br /> :::: '''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. <br /> <br /> :::: '''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. <br /> <br /> ::: '''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. <br /> <br /> :: '''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.<br /> <br /> : '''5.4.''' Algorithm for Determining Whether the Model is from the Start of the Trend Model or Along the Trend (Trend-Following) Model<br /> <br /> :: '''5.4.1.''' For main models except for EAM <br /> :: 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 .<br /> <br /> ::* 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.<br /> ::* If the intersection lies to the left of the (presumed) starting point of the preceding trend (related to this model), the report displays: <br /> :: G3: HTModel<br /> :: * 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: <br /> :: G3: BTModel<br /> :: * 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: <br /> :: G3: NoData<br /> <br /> :: '''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.<br /> <br /> :The program proceeds to step 6.<br /> <br /> ==='''Step VI. Search for Tangents and Construction of the Auxiliary Attraction Model'''===<br /> <br /> : '''6.1.''' Search for t.2’<br /> <br /> : The program conducts a search for t.2’ (tangent, i.e., the rule N1 is removed for it), which will yield the LC, without any intersections with the price in the section between T.1 and T.2. Bars are checked from right to left starting from the bar t.2 to the bar t.1 inclusive (further – section 1-2). Point 2’ (further – t.2’) can coincide with t.2, if the LC through t.2 does not have extra price intersections on 1-2, however t.2’ cannot belong to the bar t.1.<br /> <br /> :: '''6.1.1.''' If t.2’ is found <br /> <br /> :: If t.2’ is found (including if t.2’ coincides with t.2), then the program calculates the Line of goals by the tangent from t.2’ to t.4 (further -AL’). It is then checked whether the considered model has the status [The model is formed without point 6].<br /> <br /> ::: '''6.1.1.1.''' The model has the status [The model is formed without point 6] <br /> <br /> ::: If the model has the status [The model is formed without point 6], the program proceeds to step 7.<br /> <br /> ::: '''6.1.1.2.''' The model does not have the status [The model is formed without point 6] <br /> <br /> ::: If the model does not have the status [The model is formed without point 6], the program proceeds to sub-step 6.2.<br /> <br /> ::: '''6.1.2.''' If T.2’ is not found <br /> <br /> ::: If t.2’ is not found (i.e., it is impossible to build such a line through points t.2’ and t.4, which will not contain extra points on section 1-2), then this is a model without an Auxiliary AM. Theprogram proceeds to step 7.<br /> <br /> :: '''6.2.''' Search for t.3’ of the Auxiliary AM <br /> <br /> :: The program constructs a line from t.3 (or t.3’ if it exists) to t.5 (Trend Line of the Auxiliary Attraction Model, further - TLam) and checks it for the presence of price intersections in the section between t.3 and t.5.<br /> <br /> ::: '''6.2.1.''' Intersections are found <br /> <br /> ::: If intersections are found, the line t.3/t.3’-t.5 in this case is not displayed on the chart. The program searches for such point 3’ of the Auxiliary Attraction Model (further t.3’am), through which it is possible to construct a line, which will not have price intersections on the section from t.3/t.3’ to t.5.<br /> <br /> :::: '''6.2.1.1.''' If t.3’am is found<br /> <br /> :::: If t.3’am is found, then the program constructs the Line of trend of the auxiliary model of attraction by the tangent from t.3’am to t.5 (further – TLam’) and calculates the level of intersection of AL’ and TLmp’ (further – calculated t.6). There are 2 options:<br /> <br /> :::: '''6.2.1.1.1.''' If the calculated t.6 is found<br /> <br /> :::: If the calculated t.6 is found, then a check is carried out for the minimum ratio of the time segment t.2-t.4 to the segment t.4-t.6 for the Auxiliary AM (should be within 0.5). If the check is not passed, then the model does not have an auxiliary MP (in this case LTmp is not displayed on the chart), the algorithm proceeds to sub-step 6.3. If the check is passed, the program checks whether the bar t.5 breaks through the level of the calculated p.6.<br /> <br /> ::::: '''6.2.1.1.1.A.''' If the bar t.5 does not break through the level of the calculated p.6 <br /> <br /> ::::: If the t.5 bar does not break through the level of the calculated p.6, then the program proceeds to sub-step 6.3. In the report is displayed: AUX AM<br /> <br /> ::::: '''6.2.1.1.1.B.''' If the t.5 bar breaks through the level of the calculated p.6<br /> <br /> ::::: If the t.5 bar breaks through the level of the calculated p.6, then this AM cannot be built and the program is looking for a new t.4. for this the next bar is checked according to sub-step 3.4., or in case if the model has a mark draw_flag this branch of the algorithm stops.<br /> <br /> :::: '''6.2.1.1.2.''' The calculated point 6-th is not found<br /> <br /> :::: The calculated 6-th is not found (i.e., the lines do not intersect). In this case TLam is not displayed on the chart. In the report is displayed: AUX NoAM The program proceeds to sub-step 6.3.<br /> <br /> ::: '''6.2.1.2.''' If t.3’am is not found<br /> <br /> ::: If t.3’am is not found, then in the report is displayed: AUX NoAM The program proceeds to step 7.<br /> <br /> :: '''6.2.2.''' Intersections are not found <br /> <br /> :: Intersections are not found. In this case, the program calculates the level of intersection of TLam and AL’ (this is the level of the calculated p.6). There are 2 options according to sub-steps 6.2.1.1.1. and 6.2.1.1.2.<br /> <br /> : '''6.3.''' Construction of the Auxiliary AM through t.5<br /> <br /> : The program checks for the presence of t.5’ (the first possible local extremum in time on the section T.4-T.5). If T.5’ is found, in the report is displayed: AimsBlock5’ 5' If t.5’ is not, then in the report is displayed: AimsBlock5’ No5'<br /> <br /> : If t.5' is present, the program will follow a similar process as sub-step 6.2 to construct the Trend Line for the Auxiliary Attraction Model. However, this time it will start from t.5' and, if necessary, use another suitable t.3' (referred to as t.3'am5'). If the program successfully constructs a Auxiliary AM through t.5' (indicating convergence of the lines), the model will be labeled as [The AM is built through t.5'] in the report. <br /> : The report will display: <br /> : AUX5’: AUX5’<br /> : Alternatively, if the MP is not built through t.5', the program will display: <br /> : AUX5’: NoAUX5’ <br /> : After this, the program will proceed to step.7.<br /> <br /> <br /> ===''' Step VII. Determination of SP and Model Type.'''===<br /> The program recalls whether the model was built through t.2 or through t.2’<br /> : '''7.1.''' In case if AL is built through t.2 does not have intersection with the price on the section t.1-t.2, or if there is ALam, built through t.2’. Here and further it is assumed that if the line, built through t.2 to t.4 does not have intersections with the price on the section t.1-t.2, then it is considered that t.2’=t.2 and AL’=AL.<br /> <br /> : The type of the model is determined by the position of the intersection point of TL and AL’ (this is the line built from t.2’ to t.4) in relation to t.4:<br /> <br /> :: '''7.1.1.''' The intersection point of TL and AL’ lies to the right of t.4. In this case the intersection point of the lines is the calculated point 6 (further - calculated t.6).), then the program calculates the ratio of time segments from t.1 to t.4 and from t.4 to calculated point 6 for AM.<br /> <br /> ::: '''7.1.1.1.''' If the section from t.1 to t.4, multiplied by 3 is greater than the section from t.4 to the calculated point 6 for CMP, this model's type is AM.<br /> ::: G1: AM<br /> <br /> ::: If the model under consideration is AM and at the same time it is formed (i.e. after t.4 the TL is broken through), the program checks each bar after the t.4 bar, until one of the following events:<br /> <br /> :::: '''7.1.1.1.1.''' A bar is found that has reached the level of t.3 (but has not reached the level of t.4). In this case, this branch of the algorithm is completed.<br /> <br /> :::: '''7.1.1.1.2.''' A bar is found that has reached the level of t.4 (while either not reaching or reaching the level of t.3).<br /> <br /> :::: -in case of the presence of the draw_flag label – this branch stops;<br /> :::: -in another case, the program checks for the presence on the section from t.4 (not including) to the bar, which reached the level of t.4 (inclusive) of the extremum, opposite to the extremum t.4 (i.e. co-directed with the extremum t.1 of the analyzed model. There are 2 options:<br /> <br /> ::::: '''7.1.1.1.2.A.''' The extremum is found. In this case, the algorithm proceeds to step 8.<br /> <br /> ::::: '''7.1.1.1.2.B.''' The extremum is not found. In this case the status of the formed model is canceled (the model is discarded);<br /> ::::: -t.3 becomes the canceled t.3;<br /> ::::: -the program searches for the next candidate for t.3. For this, the program processes the bar that broke through the TL according to step 2.<br /> ::: '''7.1.1.2.''' If<br /> ::: -the section from t.1 to t.4, multiplied by 3 is less than or equal to the section from t.4 to the calculated t.6 (for converging lines) and at the same time<br /> ::: -the section from t.1 to t.4 multiplied by 12 is greater than the section t.4-t.6, this model is AM/DBM<br /> ::: G1: AM/DBM<br /> <br /> ::: '''7.1.1.3.''' The section from t.1 to t.4 multiplied by 12 is less than or equal to the section from SP to t.1 (for TL and AL converging to the left), then this model is DBM. <br /> ::: G1: DBM<br /> <br /> :: '''7.1.2.''' The intersection point of TL and AL’ (AL’ – this is the line from t.2’ – t.4) lies to the left of t.4 —this point is qualified as the Sacral Point (further – SP).<br /> <br /> ::: '''7.1.2.1.''' If<br /> ::: -the section from t.1 to t.4 multiplied by 3 is less than or equal to the section from SP to t.1, and at the same time;<br /> ::: -the section from t.1 to t.4 multiplied by 12 is greater than the section from SP to t.1 then this is EM/DBM <br /> ::: G1: EM/DBM<br /> <br /> ::: '''7.1.2.2.''' If the section from t.1 to t.4 multiplied by 3 is greater than the section from SP to t.1, this is eng. - EM.<br /> ::: G1: EM<br /> <br /> ::: '''7.1.2.3.''' If<br /> ::: -TL and AL of the model are parallel, or<br /> ::: -the section from t.1 to t.4 multiplied by 12 is less than or equal to the section t.4-t.6 (for TL and AL converging to the right);<br /> ::: -the section from t.1 to t.4 multiplied by 12 is less than or equal to the section from SP to t.1 (for TL and AL converging to the left), then this model is eng. - DBM <br /> ::: G1: DBM<br /> <br /> ::: The program proceeds to step 8.<br /> <br /> : '''7.2.''' If for this model it was impossible to construct AL (AL’) in such a way that there were no extra intersections on the section t.1 (inclusive) - t.2, then the program checks where TL and AL from t.2 intersect.<br /> <br /> :: '''7.2.1.''' If the lines intersect to the right (i.e. after t.4), then<br /> ::: '''7.2.1.1.''' if the section from t.1 to t.4, multiplied by 3 is greater than the section from t.4 to the calculated t.6 (for converging lines), then this model is incorrect.<br /> ::: There are one of 2 options:<br /> <br /> :::: '''7.2.1.1.1''' If the TL of the incorrect AM is broken through by the t.4 bar or the bar immediately following t.4, then<br /> <br /> :::: -in case of the presence of the draw_flag label – this branch stops;<br /> :::: -in another case t.3 becomes the canceled t.3 and the program searches for a new t.3, for this it processes the bar that broke through the TL AM according to step 2.<br /> :::: '''7.2.1.1.2.''' If the TL of the incorrect CMP is not broken through by the t.4 bar or the bar immediately following it, then the program searches for a new t.4, for this the next bar is checked according to sub-step 3.4.<br /> <br /> ::: '''7.2.1.2.''' -the section from t.1 to t.4, multiplied by 12 is greater than the section from t.4 to the calculated t.6, then this model is AM/DBM .<br /> ::: G1: AM/DBM<br /> <br /> ::: '''7.2.1.3.''' the section from t.1 to t.4 multiplied by 12 is less than or equal to the section from t.4 to t.6 then this model is DBM .<br /> ::: G1: DBM<br /> <br /> :: '''7.2.2.''' If TL and AL intersect to the left (i.e. in the past) relative to t.4, the program performs an indirect check for the Strength of the trend. For this, a pseudo SP is used – this is the intersection point of AL (built through t.2) and TL in case it is impossible to build AL through t.2 so that there are no extra points on it. The following options are possible:<br /> <br /> ::: '''7.2.2.1.''' If the pseudo SP lies to the right (i.e. later) of t.1 to t.3 (or t.3’, if the model is built on it), then the type of this model is determined as EM, moreover, the model is strong by pseudo SP.<br /> <br /> ::: G1: EM<br /> <br /> ::: SP: strongpseudoSP<br /> <br /> ::: '''7.2.2.2.''' Otherwise<br /> ::: If the lines intersect to the left of t.1 (i.e. earlier), the following options are possible:<br /> <br /> :::: '''7.2.2.2.1.''' If the section from t.1 to t.3 (3’) is greater than the section from the intersection of TL and AL to t.1, the model is assigned the type EM, while the Strength of the model is not determined.<br /> :::: G1: EM<br /> <br /> :::: SP: undef<br /> <br /> :::: '''7.2.2.2.2.''' If<br /> :::: -the section from T.1 to t.3(3’) is less than or equal to the section from the intersection of TL and AL to t.1 and up to<br /> :::: -the section from T.1 to t.3(3’) multiplied by 3 is greater than the section from the intersection of TL and AL to t.1, the model is assigned the type is EM. At the same time, the model is weak.<br /> <br /> :::: G1: EM<br /> <br /> :::: SP: weakpseudoST<br /> <br /> :::: '''7.2.2.2.3.''' If the section from t.1 to t.3(3’) multiplied by 3 is less than the section from the intersection of TL and AL to t.1, then the model type is EM/DBM.<br /> :::: G1: EM/DBM<br /> <br /> : '''7.3.''' Also, occasionally there are cases when the model for some reason does not fall under any of the above options. Then the model type is not determined.<br /> <br /> === '''Step VIII: Search for Alternative Models. Launching a New Branch from the Previous t.1 but with a Different t.3 '''===<br /> <br /> The program initiates a search for the subsequent model with the same t.1, but a new t.3. The bar following t.3/t.3’, according to step 2, is analyzed for this purpose. Concurrently, the program initiates a search for an alternative model in relation to the one already found. For this, it analyzes the bar that has broken through the level of t.4 as a potential t.4, according to step 3.4, and continues further according to the algorithm.<br /> <br /> <br /> ==References==<br /> &lt;references /&gt;</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_I&diff=214 2024-01-04T20:57:27Z

<p>Admin: /* Step V. Model Fixation at the TL Breakthrough. Search for t.5. Search for t.6. */</p> <hr /> <div> '''The Orientaion rule (N1 requirement) for Algorithm I is as follows:'''<br /> If point 1 is low, then the level of point 3 should be equal to or higher than point 1. <br /> If point 1 is high, then the level of point 3 should be equal to or lower than point 1.<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with [[UMG General Concepts]].<br /> <br /> <br /> ==='''Step I. Find Point 1. Search for a Confirming Extreme.'''===<br /> : '''1.1.''' The program searches for the first possible extreme that satisfies Single Bar Rule. This extreme is a candidate for point 1.<br /> : '''1.2.''' When a candidate for point 1 (hereinafter referred to as t.1 candifate) is found, all bars to the left (i.e., in the past) of the bar containing the t.1 candidate extreme are checked until one of the following events occurs:<br /> :: '''1.2.1.''' The place of the last intersection of the price level of the t.1 candidate is found &lt;ref&gt;High or low equal to high or low of t.1 is an intersection&lt;/ref&gt;. In this case, the program searches for an absolute extreme that confirms point 1 from the intersection of the price with the t.1 candidate level (inclusive) to the bar of t.1 candidate (exclusive). There are two possibilities:<br /> ::: '''1.2.1.1.''' If the extreme is not found, the program searches for a new candidate for point 1.<br /> ::: '''1.2.1.2.''' If the absolute extreme is found, it is the beginning of the preceding trend. The point 1 is confirmed. <br /> ::: The program checks for the absence of extremes equal to point 1 from the Beginning of the preceding trend. <br /> :::: '''1.2.1.2.1.''' If such an extreme is found, this candidate for point 1 is discarded (the program continues to process other t.1 candidates).<br /> :::: '''1.2.1.2.2.''' If such an extreme is not found, the program proceeds to process the next bar after point 1 according to point 2 of the Algorithm.<br /> :: '''1.2.2.''' The program has reached the starting point of the chart (i.e., after the starting point of the chart, the levels of points 1 and 2 have never intersected). The program searches for a confirming extreme from right to left to the starting point of the chart. The options are similar to the sub-steps 1.2.1.1. and 1.2.1.2.<br /> :: '''1.2.3.''' The program has checked 50 bars &lt;ref&gt;The depth of the search for the extreme confirming point 1&lt;/ref&gt; preceding the bar of the potential point 1, and none of the above events have occurred. The program searches for a confirming extreme from right to left in the area of 50 bars before the potential point 1. The options are similar to the sub-steps 1.2.1.1. and 1.2.1.2.<br /> <br /> ==='''Step II. Searching for Points 3 and 2.'''===<br /> If the program returns to this step during the construction of an alternative model, this branch of the algorithm stops.<br /> <br /> The bar being analyzed after point 1 (or in cases of repeated application of the step specified in the algorithm) is checked for non-exceedance of the level of point 1.<br /> : '''2.1.''' If the level of point 1 is exceeded, the program discards this point 1.<br /> : '''2.2. Searching for Point 3.''' If the level of point 1 is not exceeded, the bar being analyzed is checked by rule N1 as an extreme.<br /> :: '''2.2.1.''' If this bar is not an extreme according to rule N1 (as a potential point 3)&lt;ref&gt; Here and further under the formulation (as a potential T.3) a reminder is implied that this extremum should be aligned with the potential T.1. (see the Rule of alternating extremes).&lt;/ref&gt;, the program checks the next bar in accordance with step 2.<br /> :: '''2.2.2.''' If this bar is an extreme according to rule N1 (as a potential point 3), then<br /> ::: '''2.2.2.1.''' If this step (step 2) is applied again after confirmed candidates for point 3 have been found (i.e., such point 3, for which there is a point 2 between point 3 and point 1), but for one reason or another they were rejected, and the algorithm returned to the search for point 3, then the exceedance of the level of the previous candidate for point 3 by this extreme is checked.<br /> :::: '''2.2.2.1.A.''' If the check is not passed (i.e., if the level of the previous candidate for point 3 is not exceeded), then the program processes the next bar in accordance with this step (step 2) and further according to the algorithm.<br /> :::: '''2.2.2.1.B.''' If the check is passed, then the program proceeds to sub-step 2.2.2.2.<br /> ::: '''2.2.2.2. Searching for Point 2.''' The program searches for an absolute minimum (if point 1 and point 3 are high) or maximum (if point 1 and point 3 are low) in the range from point 1 to point 3 (hereinafter segment 1-3) as point 2 (hereinafter point 2). Then this bar is checked for &quot;extremity&quot; according to N1 rule. Two variants are possible &lt;ref&gt;As part of this particular check, it should be noted that bars T.1 and T.3 should not reach the level of T.2&lt;/ref&gt;:<br /> :::: '''2.2.2.2.A.''' If the bar is an extreme, then this is a potential point 2, and the potential point 3 becomes a confirmed point 3. In this case, the program proceeds to step 3.<br /> :::: '''2.2.2.2.B.''' The bar is not an extreme. In this case, the program begins to search for another candidate for point 3, for which it returns to the beginning of step 2.<br /> <br /> If the program has processed 50 bars &lt;ref&gt;The range of continuous search is t.3 in one iteration for all models except EAM&lt;/ref&gt; in a row in accordance with this step (step 2), and potential points 2 and 3 have not been found (i.e., the program has not yet moved to another step of the algorithm), then this potential point 1 is discarded.<br /> <br /> If there are 150 or more bars &lt;ref&gt;Maximum search range t3 for all models except EAM&lt;/ref&gt; between the potential point 1 and the bar being analyzed, and the program has not yet moved to another step of the algorithm, this potential point 1 is discarded.<br /> <br /> ==='''Step III. Building TL. Search for t.4'''===<br /> : '''3.1. Checking for Fragmentation of the Base:''' After finding candidates for points 1, 2, and 3, a check is performed for the fragmentation of the Base. This means that there should be no extremes, co-directed with t.1, between the levels of t.1 and t.3 (Extremes that Fragment the Base, hereinafter referred to as EFB).<br /> <br /> :: '''3.1.1:''' If such extremes are present, the program checks each EFB for the presence of a confirming counter-directed extreme on the section from the last intersection of the price level of the EFB to the EFB (analogous to the search for a confirming extreme of a potential t.1 in sub-step 1.2.1). If the EFB does not have a confirming extreme, then such an EFB is no longer considered (i.e., if there are no EFBs with confirming extremes, then the check is passed). If there is at least 1 EFB with a confirming extreme, then:<br /> :: - The Base is fragmented;<br /> :: - The confirmed t.3 becomes a cancelled t.3;<br /> :: The program searches for a new t.3, for which it processes the next bar after the bar of the last cancelled t.3 according to step 2 of the algorithm.<br /> :: '''3.1.2:''' If the check is successful and no EFBs are found (including if there are no confirmed EFBs), then the program proceeds to sub-step 3.2.<br /> <br /> <br /> :'''3.2. Building and Checking TL on the 1-3 Section'''<br /> : '''Determining the Section on Which t.3' Can Be Found'''<br /> : '''Searching for t.3'.'''<br /> :The parameters of the Trend Line passing through t.1 and t.3 (hereinafter TL) are calculated. TL is checked for breakthroughs on the 1-3 section.<br /> :: '''3.2.1.''' TL is Broken<br /> :: The bar of the confirmed t.3 is checked for breaking the level of t.2.<br /> ::: '''3.2.1.1.''' If the level of t.2 is broken by the bar of the confirmed t.3, the confirmed t.3 becomes a cancelled t.3. The program searches for a new t.3. To do this, the bar that broke the level of t.2 is processed according to sub-step 3.4.<br /> ::: '''3.2.1.2.''' If the level of t.2 is not broken by the bar of the confirmed t.3, then the next bar is processed according to sub-step 3.2.3.<br /> :: '''3.2.2.''' TL is Not Broken - the bar following the bar of the confirmed t.3 is processed according to sub-step 3.3.<br /> <br /> ::'''3.2.3. Determining the Section on Which t.3' Can Be Found'''<br /> ::The analyzed bar is checked for breaking the level of the confirmed t.3.<br /> ::: '''3.2.3.1.''' If the level of the confirmed t.3 is broken, the confirmed t.3 becomes a cancelled t.3. The program searches for a new t.3. For this, the bar that broke the level of the confirmed t.3 is processed according to step 2 and further according to the algorithm.<br /> ::: '''3.2.3.2.''' If the level of t.3 is not broken, the program checks the analyzed bar for breaking the level of t.2.<br /> :::: '''3.2.3.2.1.''' If the level of t.2 is not broken, the program analyzes the next bar according to sub-step 3.2.3.<br /> :::: '''3.2.3.2.2. Searching for t.3'.'''<br /> :::: If it breaks the level of t.2, then the program looks for such a point 3' (hereinafter t.3') through which a line can be drawn from t.1 to t.3', which will not contain extra touches by the price on the section from the bar of t.1 to the bar following the bar of t.3' (inclusive), and this line should not contain extra breakthroughs (not touches) by the price on the section to the bar that broke the level of t.2 (not inclusive).<br /> ::::: '''3.2.3.2.2.A.''' If t.3' is found, then the TL is rebuilt through t.3' (i.e., TL is now the line from t.1 to t.3'), and the algorithm searches for a potential t.4, for which it processes the bar that broke the level of t.2 (but if the bar that broke the level of t.2 coincides with the bar of t.3', then the program immediately proceeds to process the next bar) according to sub-step 3.4.<br /> ::::: '''3.2.3.2.2.B.''' If the point t.3' is not found, then the confirmed t.3 becomes a cancelled t.3. The program searches for a new t.3, for which it processes each previously unprocessed bar for the cancelled t.3 according to step 2 and further according to the algorithm. <br /> <br /> : If between t.1 and the analyzed bar there are 150 or more bars, and the program has not yet moved to another step of the algorithm, this potential t.1 is discarded.<br /> <br /> :'''3.3. Checking TL on the Section After t.3.'''<br /> : The analyzed bar is checked for overcoming TL.<br /> :: '''3.3.1. TL is not overcome''' - the analyzed bar is processed according to sub-step 3.4.<br /> :: '''3.3.2. TL is overcome.''' In this case, there are 2 options:<br /> ::: '''3.3.2.1.''' If between the analyzed bar (not inclusive) and the bar of t.3 (inclusive) the level of t.2 was not reached, the program performs a search for t.3', for which it moves to sub-step 3.2.3.<br /> ::: '''3.3.2.2.''' If between the analyzed bar (not inclusive) and the bar of t.3 (inclusive) the level of t.2 was reached, the program performs a search for a new candidate for t.3. For this, the analyzed bar is processed according to step 2 and further according to the algorithm.<br /> <br /> :'''3.4: Searching for Potential or Alternative t.4'''<br /> : If the program is searching for t.4 and the analyzed bar is further from t.1 than 5 times the distance between t.1 and t.3, then this potential t.1 is discarded.<br /> : If the program is searching for an alternative t.4 and the analyzed bar is further from t.1 than 10 times the number of bars between t.1 and t.3, then the search for an alternative t.4 is terminated.<br /> : The analyzed bar is checked for being an extreme according to rule N1 (as a potential t.4).<br /> <br /> ::'''Step 3.4.1: If the Bar is not an Extreme'''<br /> :: The program checks the analyzed bar for breaking through (in this case, not touching) the TL.<br /> ::: '''Step 3.4.1.1:''' If the TL is not reached (not broken), then the program processes the next bar according to step 3.4.<br /> ::: '''Step 3.4.1.2:''' If the TL is broken, then the analyzed bar is processed similarly to step 3.3.2.<br /> <br /> ::'''Step 3.4.2: If the Bar is an Extreme'''<br /> :: This is potentially t.4, proceed to step 3.5.<br /> <br /> :'''3.5. Checking the Position of t.4'''<br /> : The program checks the position of the potential t.4 relative to the extreme of t.2. There are 3 possible scenarios:<br /> :: '''3.5.1.''' The level of the potential t.4 is closer to the level of t.1 than the level of t.2. A candidate for t.4 for the Wedge model is found. In this case:<br /> ::: '''3.5.1.0.''' The bar of the potential t.4 is checked for the presence between it and the bar of t.3 of bars containing price values<br /> :::: more distant from t.3 than the value of the potential t.4, or<br /> :::: equal to t.4.<br /> :::: This is a check for the potential absoluteness of the extreme of the potential t.4. Possible options are:<br /> ::::: '''3.5.1.0.1.''' The potential t.4 is not a potentially absolute extreme (there are bars more distant from t.3). In this case, the next bar is processed according to sub-step 3.4.<br /> ::::: '''3.5.1.0.2.''' The potential t.4 is a potentially absolute extreme. In this case checking if t.2-t.4 line (this is the Aims Line, hereinafter - AL) is crossed by the price in the section between t.2 and t.4 (hereinafter - section 2-4). There are 2 options – 3.5.1.1. and 3.5.1.2.<br /> :::::: '''3.5.1.1.''' If AL is crossed, the program checks the analyzed bar for reaching the TL.<br /> :::::::: '''3.5.1.1.1.''' If the TL is not reached - the next bar is processed according to sub-step 3.4.<br /> :::::::: '''3.5.1.1.2.''' If the TL is reached, the program searches for a new candidate in t.3/t.3'. To do this, the analyzed bar is processed according to sub-step 3.2.3 and further according to the algorithm.<br /> :::::: '''3.5.1.2.''' If there is no linecrossing, the bar t.4 is checked for reaching the TL. The following options are possible:<br /> :::::::: '''3.5.1.2.1.''' If the bar t.4 reached the TL, then the [Wedge Found] Wedge model is fixed, for which the level of intersection of the TL and the AL is calculated, after which the program searches for t.3’ with the same points 1,2,3, or searches for a new t.3. To do this, the program processes the analyzed bar (in this case, the bar t.4, while reaching the TL) starting from sub-step 3.2.3. Model's Type (parameter G1) = WEDGE . <br /> :::::::: '''3.5.1.2.2.''' If the t.4 bar did not reach the TL, then the next bar after it (and when reapplying this step - the next bar after the previously analyzed bar) is analyzed for reaching the TL. At the same time, a check is made for not overcoming the distance equal to (t.1-t.3)*10. If the distance is overcome, then we return (go in a cycle) to the search for t.3. The following options are possible:<br /> :::::::::: '''3.5.1.2.2.1.''' If the analyzed bar reached the TL, then the program acts in analogy with sub-step 3.5.1.2.1. (i.e., the [Wedge Found] Wedge model is fixed and in a new branch of the algorithm the program processes the analyzed bar (in this case, the bar that reached the TL) starting from sub-step 3.2.3.<br /> :::::::::: '''3.5.1.2.2.2.''' If the TL is not reached, then the analyzed bar is checked for reaching the level of t.4. The following options are possible:<br /> :::::::::::: '''3.5.1.2.2.2.A.''' If the level of t.4 is not reached, the program analyzes the next bar for reaching the TL, options are similar to sub-steps 3.5.1.2.2.1. and 3.5.1.2.2.2.<br /> :::::::::::: '''3.5.1.2.2.2.B.''' If the level of t.4 is reached, then the program checks the analyzed bar according to sub-step 3.4.<br /> :: '''3.5.2.''' The level of the potential t.4 is further from the level of t.1 than the level of the potential t.2 - transition to step 4.<br /> :: '''3.5.3.''' The level of the potential t.4 is equal to the level of the potential t.2 - the program checks whether the bar of the considered candidate in t.4 has broken through (touched) the Trend Line (TL).<br /> ::: '''3.5.3.1. If not''' - the program searches for the next candidate for t.4. For this, the program processes the next bar according to sub-step 3.4.<br /> ::: '''3.5.3.2. If yes''' – the program searches for a new t.3, for which it analyzes the next bar according to step 2 and further according to the algorithm.<br /> <br /> <br /> ==='''Step IV. Checking for Intersection of the Aim Line (AL) by Price on Section 2-4'''===<br /> The program checks for intersections of the Aim Line by price on the section from t.2 to t.4 (hereafter - section 2-4).<br /> : '''4.1.''' If the AL is intersected by price on section 2-4 the program checks the analyzed bar (which is also the bar of the potential t.4) for a breakout (in this case, not a touch) of the Trend Line (TL).<br /> :: '''4.1.1.''' If the TL is not reached, the program processes the next bar according to step 3.4.<br /> :: '''4.1.2.''' If the TL is broken,<br /> ::: - t.3 becomes the cancelled t.3;<br /> ::: - the program searches for a new candidate for t.3. To do this, the analyzed bar is processed according to step 2.<br /> : '''4.2.''' If the AL is not intersected by price on section 2-4 the program proceeds to step 5.<br /> <br /> <br /> ==='''Step V. Model Fixation at the TL Breakthrough. Search for t.5. Search for t.6.'''===<br /> <br /> 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:<br /> <br /> : '''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.<br /> :: '''5.1.1.''' If the level of t.4 is not surpassed, then the model is considered formed [The model is formed without 6];<br /> :: Then the program proceeds to step 6.<br /> <br /> :: '''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).<br /> :: 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).<br /> <br /> ::: '''5.1.2.1.''' If the extreme is found - this is a potential t.5.<br /> ::: There are 2 scenarios:<br /> :::: '''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:<br /> ::::: '''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.<br /> ::::: There are 2 scenarios:<br /> ::::::: '''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.<br /> ::::::: '''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.<br /> <br /> ::::: '''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.<br /> <br /> :::: '''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.<br /> <br /> ::: '''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.<br /> <br /> : '''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:<br /> <br /> : for extremity according to rule N1 (as t.5);<br /> : 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<br /> :-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).<br /> :: '''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:<br /> ::: '''5.2.1.1.''' If the level of t.4 is reached (confirmed by the bar of the potential t.5)<br /> ::: 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:<br /> ::: There are 2 scenarios:<br /> :::: '''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:<br /> ::::: '''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.<br /> ::::: '''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.<br /> <br /> :::: '''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. <br /> :::: The program proceeds to step 6. (there was an idea to redo to step 5.3.)<br /> <br /> ::: '''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.<br /> <br /> :: '''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.<br /> ::: '''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:<br /> :::: '''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.)<br /> :::: '''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.<br /> <br /> ::: '''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).<br /> <br /> '''5.3.''' Algorithm for determining the presumed real p.6:<br /> <br /> : '''5.3.1.''' Apply Algorithm I to the models, excluding AM.<br /> : 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.<br /> :The extremum identified in step 2 is considered the real t.6.<br /> :Instead of x's representing price value or time and date, the report displays the following:<br /> : P6: xxxxx (price value)<br /> : P6t: xx:xx:xxxx (time and date)<br /> <br /> :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.<br /> :P6supp: -<br /> :P6suppt: -<br /> <br /> : '''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.<br /> :: '''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.<br /> <br /> ::: '''5.3.2.2.''' If the number of bars formed after t.4 does not exceed 300, several scenarios are possible.<br /> :::: '''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.<br /> :::: 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.<br /> :::: The program then checks if the price has surpassed this level in the section after t.4 of the analyzed model.<br /> <br /> :::: '''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. <br /> <br /> :::: '''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. <br /> <br /> ::: '''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. <br /> <br /> :: '''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.<br /> <br /> : '''5.4.''' Algorithm for Determining Whether the Model is from the Start of the Trend Model or Along the Trend (Trend-Following) Model<br /> <br /> :: '''5.4.1.''' For main models except for EAM <br /> :: 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 .<br /> <br /> ::* 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.<br /> ::* If the intersection lies to the left of the (presumed) starting point of the preceding trend (related to this model), the report displays: <br /> :: G3: HTModel<br /> :: * 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: <br /> :: G3: BTModel<br /> :: * 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: <br /> :: G3: NoData<br /> <br /> :: '''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.<br /> <br /> :The program proceeds to step 6.<br /> <br /> ==='''Step VI. Search for Tangents and Construction of the Auxiliary Attraction Model'''===<br /> <br /> : '''6.1.''' Search for t.2’<br /> <br /> : The program conducts a search for t.2’ (tangent, i.e., the rule N1 is removed for it), which will yield the LC, without any intersections with the price in the section between T.1 and T.2. Bars are checked from right to left starting from the bar t.2 to the bar t.1 inclusive (further – section 1-2). Point 2’ (further – t.2’) can coincide with t.2, if the LC through t.2 does not have extra price intersections on 1-2, however t.2’ cannot belong to the bar t.1.<br /> <br /> :: '''6.1.1.''' If t.2’ is found <br /> <br /> :: If t.2’ is found (including if t.2’ coincides with t.2), then the program calculates the Line of goals by the tangent from t.2’ to t.4 (further -AL’). It is then checked whether the considered model has the status [The model is formed without point 6].<br /> <br /> ::: '''6.1.1.1.''' The model has the status [The model is formed without point 6] <br /> <br /> ::: If the model has the status [The model is formed without point 6], the program proceeds to step 7.<br /> <br /> ::: '''6.1.1.2.''' The model does not have the status [The model is formed without point 6] <br /> <br /> ::: If the model does not have the status [The model is formed without point 6], the program proceeds to sub-step 6.2.<br /> <br /> ::: '''6.1.2.''' If T.2’ is not found <br /> <br /> ::: If t.2’ is not found (i.e., it is impossible to build such a line through points t.2’ and t.4, which will not contain extra points on section 1-2), then this is a model without an Auxiliary AM. Theprogram proceeds to step 7.<br /> <br /> :: '''6.2.''' Search for t.3’ of the Auxiliary AM <br /> <br /> :: The program constructs a line from t.3 (or t.3’ if it exists) to t.5 (Trend Line of the Auxiliary Attraction Model, further - TLam) and checks it for the presence of price intersections in the section between t.3 and t.5.<br /> <br /> ::: '''6.2.1.''' Intersections are found <br /> <br /> ::: If intersections are found, the line t.3/t.3’-t.5 in this case is not displayed on the chart. The program searches for such point 3’ of the Auxiliary Attraction Model (further t.3’am), through which it is possible to construct a line, which will not have price intersections on the section from t.3/t.3’ to t.5.<br /> <br /> :::: '''6.2.1.1.''' If t.3’am is found<br /> <br /> :::: If t.3’am is found, then the program constructs the Line of trend of the auxiliary model of attraction by the tangent from t.3’am to t.5 (further – TLam’) and calculates the level of intersection of AL’ and TLmp’ (further – calculated t.6). There are 2 options:<br /> <br /> :::: '''6.2.1.1.1.''' If the calculated t.6 is found<br /> <br /> :::: If the calculated t.6 is found, then a check is carried out for the minimum ratio of the time segment t.2-t.4 to the segment t.4-t.6 for the Auxiliary AM (should be within 0.5). If the check is not passed, then the model does not have an auxiliary MP (in this case LTmp is not displayed on the chart), the algorithm proceeds to sub-step 6.3. If the check is passed, the program checks whether the bar t.5 breaks through the level of the calculated p.6.<br /> <br /> ::::: '''6.2.1.1.1.A.''' If the bar t.5 does not break through the level of the calculated p.6 <br /> <br /> ::::: If the t.5 bar does not break through the level of the calculated p.6, then the program proceeds to sub-step 6.3. In the report is displayed: AUX AM<br /> <br /> ::::: '''6.2.1.1.1.B.''' If the t.5 bar breaks through the level of the calculated p.6<br /> <br /> ::::: If the t.5 bar breaks through the level of the calculated p.6, then this AM cannot be built and the program is looking for a new t.4. for this the next bar is checked according to sub-step 3.4., or in case if the model has a mark draw_flag this branch of the algorithm stops.<br /> <br /> :::: '''6.2.1.1.2.''' The calculated point 6-th is not found<br /> <br /> :::: The calculated 6-th is not found (i.e., the lines do not intersect). In this case TLam is not displayed on the chart. In the report is displayed: AUX NoAM The program proceeds to sub-step 6.3.<br /> <br /> ::: '''6.2.1.2.''' If t.3’am is not found<br /> <br /> ::: If t.3’am is not found, then in the report is displayed: AUX NoAM The program proceeds to step 7.<br /> <br /> :: '''6.2.2.''' Intersections are not found <br /> <br /> :: Intersections are not found. In this case, the program calculates the level of intersection of TLam and AL’ (this is the level of the calculated p.6). There are 2 options according to sub-steps 6.2.1.1.1. and 6.2.1.1.2.<br /> <br /> : '''6.3.''' Construction of the Auxiliary AM through t.5<br /> <br /> : The program checks for the presence of t.5’ (the first possible local extremum in time on the section T.4-T.5). If T.5’ is found, in the report is displayed: AimsBlock5’ 5' If t.5’ is not, then in the report is displayed: AimsBlock5’ No5'<br /> <br /> : If t.5' is present, the program will follow a similar process as sub-step 6.2 to construct the Trend Line for the Auxiliary Attraction Model. However, this time it will start from t.5' and, if necessary, use another suitable t.3' (referred to as t.3'am5'). If the program successfully constructs a Auxiliary AM through t.5' (indicating convergence of the lines), the model will be labeled as [The AM is built through t.5'] in the report. <br /> : The report will display: <br /> : AUX5’: AUX5’<br /> : Alternatively, if the MP is not built through t.5', the program will display: <br /> : AUX5’: NoAUX5’ <br /> : After this, the program will proceed to step.7.<br /> <br /> <br /> ===''' Step VII. Determination of SP and Model Type.'''===<br /> The program recalls whether the model was built through t.2 or through t.2’<br /> : '''7.1.''' In case if AL is built through t.2 does not have intersection with the price on the section t.1-t.2, or if there is ALam, built through t.2’. Here and further it is assumed that if the line, built through t.2 to t.4 does not have intersections with the price on the section t.1-t.2, then it is considered that t.2’=t.2 and AL’=AL.<br /> <br /> : The type of the model is determined by the position of the intersection point of TL and AL’ (this is the line built from t.2’ to t.4) in relation to t.4:<br /> <br /> :: '''7.1.1.''' The intersection point of TL and AL’ lies to the right of t.4. In this case the intersection point of the lines is the calculated point 6 (further - calculated t.6).), then the program calculates the ratio of time segments from t.1 to t.4 and from t.4 to calculated point 6 for AM.<br /> <br /> ::: '''7.1.1.1.''' If the section from t.1 to t.4, multiplied by 3 is greater than the section from t.4 to the calculated point 6 for CMP, this model's type is AM.<br /> ::: G1: AM<br /> <br /> ::: If the model under consideration is AM and at the same time it is formed (i.e. after t.4 the TL is broken through), the program checks each bar after the t.4 bar, until one of the following events:<br /> <br /> :::: '''7.1.1.1.1.''' A bar is found that has reached the level of t.3 (but has not reached the level of t.4). In this case, this branch of the algorithm is completed.<br /> <br /> :::: '''7.1.1.1.2.''' A bar is found that has reached the level of t.4 (while either not reaching or reaching the level of t.3).<br /> <br /> :::: -in case of the presence of the draw_flag label – this branch stops;<br /> :::: -in another case, the program checks for the presence on the section from t.4 (not including) to the bar, which reached the level of t.4 (inclusive) of the extremum, opposite to the extremum t.4 (i.e. co-directed with the extremum t.1 of the analyzed model. There are 2 options:<br /> <br /> ::::: '''7.1.1.1.2.A.''' The extremum is found. In this case, the algorithm proceeds to step 8.<br /> <br /> ::::: '''7.1.1.1.2.B.''' The extremum is not found. In this case the status of the formed model is canceled (the model is discarded);<br /> ::::: -t.3 becomes the canceled t.3;<br /> ::::: -the program searches for the next candidate for t.3. For this, the program processes the bar that broke through the TL according to step 2.<br /> ::: '''7.1.1.2.''' If<br /> ::: -the section from t.1 to t.4, multiplied by 3 is less than or equal to the section from t.4 to the calculated t.6 (for converging lines) and at the same time<br /> ::: -the section from t.1 to t.4 multiplied by 12 is greater than the section t.4-t.6, this model is AM/DBM<br /> ::: G1: AM/DBM<br /> <br /> ::: '''7.1.1.3.''' The section from t.1 to t.4 multiplied by 12 is less than or equal to the section from SP to t.1 (for TL and AL converging to the left), then this model is DBM. <br /> ::: G1: DBM<br /> <br /> :: '''7.1.2.''' The intersection point of TL and AL’ (AL’ – this is the line from t.2’ – t.4) lies to the left of t.4 —this point is qualified as the Sacral Point (further – SP).<br /> <br /> ::: '''7.1.2.1.''' If<br /> ::: -the section from t.1 to t.4 multiplied by 3 is less than or equal to the section from SP to t.1, and at the same time;<br /> ::: -the section from t.1 to t.4 multiplied by 12 is greater than the section from SP to t.1 then this is EM/DBM <br /> ::: G1: EM/DBM<br /> <br /> ::: '''7.1.2.2.''' If the section from t.1 to t.4 multiplied by 3 is greater than the section from SP to t.1, this is eng. - EM.<br /> ::: G1: EM<br /> <br /> ::: '''7.1.2.3.''' If<br /> ::: -TL and AL of the model are parallel, or<br /> ::: -the section from t.1 to t.4 multiplied by 12 is less than or equal to the section t.4-t.6 (for TL and AL converging to the right);<br /> ::: -the section from t.1 to t.4 multiplied by 12 is less than or equal to the section from SP to t.1 (for TL and AL converging to the left), then this model is eng. - DBM <br /> ::: G1: DBM<br /> <br /> ::: The program proceeds to step 8.<br /> <br /> : '''7.2.''' If for this model it was impossible to construct AL (AL’) in such a way that there were no extra intersections on the section t.1 (inclusive) - t.2, then the program checks where TL and AL from t.2 intersect.<br /> <br /> :: '''7.2.1.''' If the lines intersect to the right (i.e. after t.4), then<br /> ::: '''7.2.1.1.''' if the section from t.1 to t.4, multiplied by 3 is greater than the section from t.4 to the calculated t.6 (for converging lines), then this model is incorrect.<br /> ::: There are one of 2 options:<br /> <br /> :::: '''7.2.1.1.1''' If the TL of the incorrect AM is broken through by the t.4 bar or the bar immediately following t.4, then<br /> <br /> :::: -in case of the presence of the draw_flag label – this branch stops;<br /> :::: -in another case t.3 becomes the canceled t.3 and the program searches for a new t.3, for this it processes the bar that broke through the TL AM according to step 2.<br /> :::: '''7.2.1.1.2.''' If the TL of the incorrect CMP is not broken through by the t.4 bar or the bar immediately following it, then the program searches for a new t.4, for this the next bar is checked according to sub-step 3.4.<br /> <br /> ::: '''7.2.1.2.''' -the section from t.1 to t.4, multiplied by 12 is greater than the section from t.4 to the calculated t.6, then this model is AM/DBM .<br /> ::: G1: AM/DBM<br /> <br /> ::: '''7.2.1.3.''' the section from t.1 to t.4 multiplied by 12 is less than or equal to the section from t.4 to t.6 then this model is DBM .<br /> ::: G1: DBM<br /> <br /> :: '''7.2.2.''' If TL and AL intersect to the left (i.e. in the past) relative to t.4, the program performs an indirect check for the Strength of the trend. For this, a pseudo SP is used – this is the intersection point of AL (built through t.2) and TL in case it is impossible to build AL through t.2 so that there are no extra points on it. The following options are possible:<br /> <br /> ::: '''7.2.2.1.''' If the pseudo SP lies to the right (i.e. later) of t.1 to t.3 (or t.3’, if the model is built on it), then the type of this model is determined as EM, moreover, the model is strong by pseudo SP.<br /> <br /> ::: G1: EM<br /> <br /> ::: SP: strongpseudoSP<br /> <br /> ::: '''7.2.2.2.''' Otherwise<br /> ::: If the lines intersect to the left of t.1 (i.e. earlier), the following options are possible:<br /> <br /> :::: '''7.2.2.2.1.''' If the section from t.1 to t.3 (3’) is greater than the section from the intersection of TL and AL to t.1, the model is assigned the type EM, while the Strength of the model is not determined.<br /> :::: G1: EM<br /> <br /> :::: SP: undef<br /> <br /> :::: '''7.2.2.2.2.''' If<br /> :::: -the section from T.1 to t.3(3’) is less than or equal to the section from the intersection of TL and AL to t.1 and up to<br /> :::: -the section from T.1 to t.3(3’) multiplied by 3 is greater than the section from the intersection of TL and AL to t.1, the model is assigned the type is EM. At the same time, the model is weak.<br /> <br /> :::: G1: EM<br /> <br /> :::: SP: weakpseudoST<br /> <br /> :::: '''7.2.2.2.3.''' If the section from t.1 to t.3(3’) multiplied by 3 is less than the section from the intersection of TL and AL to t.1, then the model type is EM/DBM.<br /> :::: G1: EM/DBM<br /> <br /> : '''7.3.''' Also, occasionally there are cases when the model for some reason does not fall under any of the above options. Then the model type is not determined.<br /> <br /> === '''Step VIII: Search for Alternative Models. Launching a New Branch from the Previous t.1 but with a Different t.3 '''===<br /> <br /> The program initiates a search for the subsequent model with the same t.1, but a new t.3. The bar following t.3/t.3’, according to step 2, is analyzed for this purpose. Concurrently, the program initiates a search for an alternative model in relation to the one already found. For this, it analyzes the bar that has broken through the level of t.4 as a potential t.4, according to step 3.4, and continues further according to the algorithm.<br /> <br /> <br /> ==References==<br /> &lt;references /&gt;</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_I&diff=213 2024-01-04T20:56:52Z

<p>Admin: /* Step V. Model Fixation at the TL Breakthrough. Search for t.5. Search for t.6. */</p> <hr /> <div> '''The Orientaion rule (N1 requirement) for Algorithm I is as follows:'''<br /> If point 1 is low, then the level of point 3 should be equal to or higher than point 1. <br /> If point 1 is high, then the level of point 3 should be equal to or lower than point 1.<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with [[UMG General Concepts]].<br /> <br /> <br /> ==='''Step I. Find Point 1. Search for a Confirming Extreme.'''===<br /> : '''1.1.''' The program searches for the first possible extreme that satisfies Single Bar Rule. This extreme is a candidate for point 1.<br /> : '''1.2.''' When a candidate for point 1 (hereinafter referred to as t.1 candifate) is found, all bars to the left (i.e., in the past) of the bar containing the t.1 candidate extreme are checked until one of the following events occurs:<br /> :: '''1.2.1.''' The place of the last intersection of the price level of the t.1 candidate is found &lt;ref&gt;High or low equal to high or low of t.1 is an intersection&lt;/ref&gt;. In this case, the program searches for an absolute extreme that confirms point 1 from the intersection of the price with the t.1 candidate level (inclusive) to the bar of t.1 candidate (exclusive). There are two possibilities:<br /> ::: '''1.2.1.1.''' If the extreme is not found, the program searches for a new candidate for point 1.<br /> ::: '''1.2.1.2.''' If the absolute extreme is found, it is the beginning of the preceding trend. The point 1 is confirmed. <br /> ::: The program checks for the absence of extremes equal to point 1 from the Beginning of the preceding trend. <br /> :::: '''1.2.1.2.1.''' If such an extreme is found, this candidate for point 1 is discarded (the program continues to process other t.1 candidates).<br /> :::: '''1.2.1.2.2.''' If such an extreme is not found, the program proceeds to process the next bar after point 1 according to point 2 of the Algorithm.<br /> :: '''1.2.2.''' The program has reached the starting point of the chart (i.e., after the starting point of the chart, the levels of points 1 and 2 have never intersected). The program searches for a confirming extreme from right to left to the starting point of the chart. The options are similar to the sub-steps 1.2.1.1. and 1.2.1.2.<br /> :: '''1.2.3.''' The program has checked 50 bars &lt;ref&gt;The depth of the search for the extreme confirming point 1&lt;/ref&gt; preceding the bar of the potential point 1, and none of the above events have occurred. The program searches for a confirming extreme from right to left in the area of 50 bars before the potential point 1. The options are similar to the sub-steps 1.2.1.1. and 1.2.1.2.<br /> <br /> ==='''Step II. Searching for Points 3 and 2.'''===<br /> If the program returns to this step during the construction of an alternative model, this branch of the algorithm stops.<br /> <br /> The bar being analyzed after point 1 (or in cases of repeated application of the step specified in the algorithm) is checked for non-exceedance of the level of point 1.<br /> : '''2.1.''' If the level of point 1 is exceeded, the program discards this point 1.<br /> : '''2.2. Searching for Point 3.''' If the level of point 1 is not exceeded, the bar being analyzed is checked by rule N1 as an extreme.<br /> :: '''2.2.1.''' If this bar is not an extreme according to rule N1 (as a potential point 3)&lt;ref&gt; Here and further under the formulation (as a potential T.3) a reminder is implied that this extremum should be aligned with the potential T.1. (see the Rule of alternating extremes).&lt;/ref&gt;, the program checks the next bar in accordance with step 2.<br /> :: '''2.2.2.''' If this bar is an extreme according to rule N1 (as a potential point 3), then<br /> ::: '''2.2.2.1.''' If this step (step 2) is applied again after confirmed candidates for point 3 have been found (i.e., such point 3, for which there is a point 2 between point 3 and point 1), but for one reason or another they were rejected, and the algorithm returned to the search for point 3, then the exceedance of the level of the previous candidate for point 3 by this extreme is checked.<br /> :::: '''2.2.2.1.A.''' If the check is not passed (i.e., if the level of the previous candidate for point 3 is not exceeded), then the program processes the next bar in accordance with this step (step 2) and further according to the algorithm.<br /> :::: '''2.2.2.1.B.''' If the check is passed, then the program proceeds to sub-step 2.2.2.2.<br /> ::: '''2.2.2.2. Searching for Point 2.''' The program searches for an absolute minimum (if point 1 and point 3 are high) or maximum (if point 1 and point 3 are low) in the range from point 1 to point 3 (hereinafter segment 1-3) as point 2 (hereinafter point 2). Then this bar is checked for &quot;extremity&quot; according to N1 rule. Two variants are possible &lt;ref&gt;As part of this particular check, it should be noted that bars T.1 and T.3 should not reach the level of T.2&lt;/ref&gt;:<br /> :::: '''2.2.2.2.A.''' If the bar is an extreme, then this is a potential point 2, and the potential point 3 becomes a confirmed point 3. In this case, the program proceeds to step 3.<br /> :::: '''2.2.2.2.B.''' The bar is not an extreme. In this case, the program begins to search for another candidate for point 3, for which it returns to the beginning of step 2.<br /> <br /> If the program has processed 50 bars &lt;ref&gt;The range of continuous search is t.3 in one iteration for all models except EAM&lt;/ref&gt; in a row in accordance with this step (step 2), and potential points 2 and 3 have not been found (i.e., the program has not yet moved to another step of the algorithm), then this potential point 1 is discarded.<br /> <br /> If there are 150 or more bars &lt;ref&gt;Maximum search range t3 for all models except EAM&lt;/ref&gt; between the potential point 1 and the bar being analyzed, and the program has not yet moved to another step of the algorithm, this potential point 1 is discarded.<br /> <br /> ==='''Step III. Building TL. Search for t.4'''===<br /> : '''3.1. Checking for Fragmentation of the Base:''' After finding candidates for points 1, 2, and 3, a check is performed for the fragmentation of the Base. This means that there should be no extremes, co-directed with t.1, between the levels of t.1 and t.3 (Extremes that Fragment the Base, hereinafter referred to as EFB).<br /> <br /> :: '''3.1.1:''' If such extremes are present, the program checks each EFB for the presence of a confirming counter-directed extreme on the section from the last intersection of the price level of the EFB to the EFB (analogous to the search for a confirming extreme of a potential t.1 in sub-step 1.2.1). If the EFB does not have a confirming extreme, then such an EFB is no longer considered (i.e., if there are no EFBs with confirming extremes, then the check is passed). If there is at least 1 EFB with a confirming extreme, then:<br /> :: - The Base is fragmented;<br /> :: - The confirmed t.3 becomes a cancelled t.3;<br /> :: The program searches for a new t.3, for which it processes the next bar after the bar of the last cancelled t.3 according to step 2 of the algorithm.<br /> :: '''3.1.2:''' If the check is successful and no EFBs are found (including if there are no confirmed EFBs), then the program proceeds to sub-step 3.2.<br /> <br /> <br /> :'''3.2. Building and Checking TL on the 1-3 Section'''<br /> : '''Determining the Section on Which t.3' Can Be Found'''<br /> : '''Searching for t.3'.'''<br /> :The parameters of the Trend Line passing through t.1 and t.3 (hereinafter TL) are calculated. TL is checked for breakthroughs on the 1-3 section.<br /> :: '''3.2.1.''' TL is Broken<br /> :: The bar of the confirmed t.3 is checked for breaking the level of t.2.<br /> ::: '''3.2.1.1.''' If the level of t.2 is broken by the bar of the confirmed t.3, the confirmed t.3 becomes a cancelled t.3. The program searches for a new t.3. To do this, the bar that broke the level of t.2 is processed according to sub-step 3.4.<br /> ::: '''3.2.1.2.''' If the level of t.2 is not broken by the bar of the confirmed t.3, then the next bar is processed according to sub-step 3.2.3.<br /> :: '''3.2.2.''' TL is Not Broken - the bar following the bar of the confirmed t.3 is processed according to sub-step 3.3.<br /> <br /> ::'''3.2.3. Determining the Section on Which t.3' Can Be Found'''<br /> ::The analyzed bar is checked for breaking the level of the confirmed t.3.<br /> ::: '''3.2.3.1.''' If the level of the confirmed t.3 is broken, the confirmed t.3 becomes a cancelled t.3. The program searches for a new t.3. For this, the bar that broke the level of the confirmed t.3 is processed according to step 2 and further according to the algorithm.<br /> ::: '''3.2.3.2.''' If the level of t.3 is not broken, the program checks the analyzed bar for breaking the level of t.2.<br /> :::: '''3.2.3.2.1.''' If the level of t.2 is not broken, the program analyzes the next bar according to sub-step 3.2.3.<br /> :::: '''3.2.3.2.2. Searching for t.3'.'''<br /> :::: If it breaks the level of t.2, then the program looks for such a point 3' (hereinafter t.3') through which a line can be drawn from t.1 to t.3', which will not contain extra touches by the price on the section from the bar of t.1 to the bar following the bar of t.3' (inclusive), and this line should not contain extra breakthroughs (not touches) by the price on the section to the bar that broke the level of t.2 (not inclusive).<br /> ::::: '''3.2.3.2.2.A.''' If t.3' is found, then the TL is rebuilt through t.3' (i.e., TL is now the line from t.1 to t.3'), and the algorithm searches for a potential t.4, for which it processes the bar that broke the level of t.2 (but if the bar that broke the level of t.2 coincides with the bar of t.3', then the program immediately proceeds to process the next bar) according to sub-step 3.4.<br /> ::::: '''3.2.3.2.2.B.''' If the point t.3' is not found, then the confirmed t.3 becomes a cancelled t.3. The program searches for a new t.3, for which it processes each previously unprocessed bar for the cancelled t.3 according to step 2 and further according to the algorithm. <br /> <br /> : If between t.1 and the analyzed bar there are 150 or more bars, and the program has not yet moved to another step of the algorithm, this potential t.1 is discarded.<br /> <br /> :'''3.3. Checking TL on the Section After t.3.'''<br /> : The analyzed bar is checked for overcoming TL.<br /> :: '''3.3.1. TL is not overcome''' - the analyzed bar is processed according to sub-step 3.4.<br /> :: '''3.3.2. TL is overcome.''' In this case, there are 2 options:<br /> ::: '''3.3.2.1.''' If between the analyzed bar (not inclusive) and the bar of t.3 (inclusive) the level of t.2 was not reached, the program performs a search for t.3', for which it moves to sub-step 3.2.3.<br /> ::: '''3.3.2.2.''' If between the analyzed bar (not inclusive) and the bar of t.3 (inclusive) the level of t.2 was reached, the program performs a search for a new candidate for t.3. For this, the analyzed bar is processed according to step 2 and further according to the algorithm.<br /> <br /> :'''3.4: Searching for Potential or Alternative t.4'''<br /> : If the program is searching for t.4 and the analyzed bar is further from t.1 than 5 times the distance between t.1 and t.3, then this potential t.1 is discarded.<br /> : If the program is searching for an alternative t.4 and the analyzed bar is further from t.1 than 10 times the number of bars between t.1 and t.3, then the search for an alternative t.4 is terminated.<br /> : The analyzed bar is checked for being an extreme according to rule N1 (as a potential t.4).<br /> <br /> ::'''Step 3.4.1: If the Bar is not an Extreme'''<br /> :: The program checks the analyzed bar for breaking through (in this case, not touching) the TL.<br /> ::: '''Step 3.4.1.1:''' If the TL is not reached (not broken), then the program processes the next bar according to step 3.4.<br /> ::: '''Step 3.4.1.2:''' If the TL is broken, then the analyzed bar is processed similarly to step 3.3.2.<br /> <br /> ::'''Step 3.4.2: If the Bar is an Extreme'''<br /> :: This is potentially t.4, proceed to step 3.5.<br /> <br /> :'''3.5. Checking the Position of t.4'''<br /> : The program checks the position of the potential t.4 relative to the extreme of t.2. There are 3 possible scenarios:<br /> :: '''3.5.1.''' The level of the potential t.4 is closer to the level of t.1 than the level of t.2. A candidate for t.4 for the Wedge model is found. In this case:<br /> ::: '''3.5.1.0.''' The bar of the potential t.4 is checked for the presence between it and the bar of t.3 of bars containing price values<br /> :::: more distant from t.3 than the value of the potential t.4, or<br /> :::: equal to t.4.<br /> :::: This is a check for the potential absoluteness of the extreme of the potential t.4. Possible options are:<br /> ::::: '''3.5.1.0.1.''' The potential t.4 is not a potentially absolute extreme (there are bars more distant from t.3). In this case, the next bar is processed according to sub-step 3.4.<br /> ::::: '''3.5.1.0.2.''' The potential t.4 is a potentially absolute extreme. In this case checking if t.2-t.4 line (this is the Aims Line, hereinafter - AL) is crossed by the price in the section between t.2 and t.4 (hereinafter - section 2-4). There are 2 options – 3.5.1.1. and 3.5.1.2.<br /> :::::: '''3.5.1.1.''' If AL is crossed, the program checks the analyzed bar for reaching the TL.<br /> :::::::: '''3.5.1.1.1.''' If the TL is not reached - the next bar is processed according to sub-step 3.4.<br /> :::::::: '''3.5.1.1.2.''' If the TL is reached, the program searches for a new candidate in t.3/t.3'. To do this, the analyzed bar is processed according to sub-step 3.2.3 and further according to the algorithm.<br /> :::::: '''3.5.1.2.''' If there is no linecrossing, the bar t.4 is checked for reaching the TL. The following options are possible:<br /> :::::::: '''3.5.1.2.1.''' If the bar t.4 reached the TL, then the [Wedge Found] Wedge model is fixed, for which the level of intersection of the TL and the AL is calculated, after which the program searches for t.3’ with the same points 1,2,3, or searches for a new t.3. To do this, the program processes the analyzed bar (in this case, the bar t.4, while reaching the TL) starting from sub-step 3.2.3. Model's Type (parameter G1) = WEDGE . <br /> :::::::: '''3.5.1.2.2.''' If the t.4 bar did not reach the TL, then the next bar after it (and when reapplying this step - the next bar after the previously analyzed bar) is analyzed for reaching the TL. At the same time, a check is made for not overcoming the distance equal to (t.1-t.3)*10. If the distance is overcome, then we return (go in a cycle) to the search for t.3. The following options are possible:<br /> :::::::::: '''3.5.1.2.2.1.''' If the analyzed bar reached the TL, then the program acts in analogy with sub-step 3.5.1.2.1. (i.e., the [Wedge Found] Wedge model is fixed and in a new branch of the algorithm the program processes the analyzed bar (in this case, the bar that reached the TL) starting from sub-step 3.2.3.<br /> :::::::::: '''3.5.1.2.2.2.''' If the TL is not reached, then the analyzed bar is checked for reaching the level of t.4. The following options are possible:<br /> :::::::::::: '''3.5.1.2.2.2.A.''' If the level of t.4 is not reached, the program analyzes the next bar for reaching the TL, options are similar to sub-steps 3.5.1.2.2.1. and 3.5.1.2.2.2.<br /> :::::::::::: '''3.5.1.2.2.2.B.''' If the level of t.4 is reached, then the program checks the analyzed bar according to sub-step 3.4.<br /> :: '''3.5.2.''' The level of the potential t.4 is further from the level of t.1 than the level of the potential t.2 - transition to step 4.<br /> :: '''3.5.3.''' The level of the potential t.4 is equal to the level of the potential t.2 - the program checks whether the bar of the considered candidate in t.4 has broken through (touched) the Trend Line (TL).<br /> ::: '''3.5.3.1. If not''' - the program searches for the next candidate for t.4. For this, the program processes the next bar according to sub-step 3.4.<br /> ::: '''3.5.3.2. If yes''' – the program searches for a new t.3, for which it analyzes the next bar according to step 2 and further according to the algorithm.<br /> <br /> <br /> ==='''Step IV. Checking for Intersection of the Aim Line (AL) by Price on Section 2-4'''===<br /> The program checks for intersections of the Aim Line by price on the section from t.2 to t.4 (hereafter - section 2-4).<br /> : '''4.1.''' If the AL is intersected by price on section 2-4 the program checks the analyzed bar (which is also the bar of the potential t.4) for a breakout (in this case, not a touch) of the Trend Line (TL).<br /> :: '''4.1.1.''' If the TL is not reached, the program processes the next bar according to step 3.4.<br /> :: '''4.1.2.''' If the TL is broken,<br /> ::: - t.3 becomes the cancelled t.3;<br /> ::: - the program searches for a new candidate for t.3. To do this, the analyzed bar is processed according to step 2.<br /> : '''4.2.''' If the AL is not intersected by price on section 2-4 the program proceeds to step 5.<br /> <br /> <br /> ==='''Step V. Model Fixation at the TL Breakthrough. Search for t.5. Search for t.6.'''===<br /> <br /> 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:<br /> <br /> : '''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.<br /> :: '''5.1.1.''' If the level of t.4 is not surpassed, then the model is considered formed [The model is formed without 6];<br /> :: Then the program proceeds to step 6.<br /> <br /> :: '''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).<br /> :: 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).<br /> <br /> ::: '''5.1.2.1.''' If the extreme is found - this is a potential t.5.<br /> ::: There are 2 scenarios:<br /> :::: '''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:<br /> ::::: '''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.<br /> ::::: There are 2 scenarios:<br /> ::::::: '''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.<br /> ::::::: '''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.<br /> <br /> ::::: '''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.<br /> <br /> :::: '''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.<br /> <br /> ::: '''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.<br /> <br /> : '''5.2.''' LT 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:<br /> <br /> : for extremity according to rule N1 (as t.5);<br /> : 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<br /> :-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).<br /> :: '''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:<br /> ::: '''5.2.1.1.''' If the level of t.4 is reached (confirmed by the bar of the potential t.5)<br /> ::: 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:<br /> ::: There are 2 scenarios:<br /> :::: '''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:<br /> ::::: '''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.<br /> ::::: '''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.<br /> <br /> :::: '''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. <br /> :::: The program proceeds to step 6. (there was an idea to redo to step 5.3.)<br /> <br /> ::: '''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.<br /> <br /> :: '''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.<br /> ::: '''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:<br /> :::: '''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.)<br /> :::: '''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.<br /> <br /> ::: '''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).<br /> <br /> '''5.3.''' Algorithm for determining the presumed real p.6:<br /> <br /> : '''5.3.1.''' Apply Algorithm I to the models, excluding AM.<br /> : 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.<br /> :The extremum identified in step 2 is considered the real t.6.<br /> :Instead of x's representing price value or time and date, the report displays the following:<br /> : P6: xxxxx (price value)<br /> : P6t: xx:xx:xxxx (time and date)<br /> <br /> :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.<br /> :P6supp: -<br /> :P6suppt: -<br /> <br /> : '''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.<br /> :: '''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.<br /> <br /> ::: '''5.3.2.2.''' If the number of bars formed after t.4 does not exceed 300, several scenarios are possible.<br /> :::: '''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.<br /> :::: 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.<br /> :::: The program then checks if the price has surpassed this level in the section after t.4 of the analyzed model.<br /> <br /> :::: '''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. <br /> <br /> :::: '''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. <br /> <br /> ::: '''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. <br /> <br /> :: '''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.<br /> <br /> : '''5.4.''' Algorithm for Determining Whether the Model is from the Start of the Trend Model or Along the Trend (Trend-Following) Model<br /> <br /> :: '''5.4.1.''' For main models except for EAM <br /> :: 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 .<br /> <br /> ::* 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.<br /> ::* If the intersection lies to the left of the (presumed) starting point of the preceding trend (related to this model), the report displays: <br /> :: G3: HTModel<br /> :: * 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: <br /> :: G3: BTModel<br /> :: * 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: <br /> :: G3: NoData<br /> <br /> :: '''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.<br /> <br /> :The program proceeds to step 6.<br /> <br /> ==='''Step VI. Search for Tangents and Construction of the Auxiliary Attraction Model'''===<br /> <br /> : '''6.1.''' Search for t.2’<br /> <br /> : The program conducts a search for t.2’ (tangent, i.e., the rule N1 is removed for it), which will yield the LC, without any intersections with the price in the section between T.1 and T.2. Bars are checked from right to left starting from the bar t.2 to the bar t.1 inclusive (further – section 1-2). Point 2’ (further – t.2’) can coincide with t.2, if the LC through t.2 does not have extra price intersections on 1-2, however t.2’ cannot belong to the bar t.1.<br /> <br /> :: '''6.1.1.''' If t.2’ is found <br /> <br /> :: If t.2’ is found (including if t.2’ coincides with t.2), then the program calculates the Line of goals by the tangent from t.2’ to t.4 (further -AL’). It is then checked whether the considered model has the status [The model is formed without point 6].<br /> <br /> ::: '''6.1.1.1.''' The model has the status [The model is formed without point 6] <br /> <br /> ::: If the model has the status [The model is formed without point 6], the program proceeds to step 7.<br /> <br /> ::: '''6.1.1.2.''' The model does not have the status [The model is formed without point 6] <br /> <br /> ::: If the model does not have the status [The model is formed without point 6], the program proceeds to sub-step 6.2.<br /> <br /> ::: '''6.1.2.''' If T.2’ is not found <br /> <br /> ::: If t.2’ is not found (i.e., it is impossible to build such a line through points t.2’ and t.4, which will not contain extra points on section 1-2), then this is a model without an Auxiliary AM. Theprogram proceeds to step 7.<br /> <br /> :: '''6.2.''' Search for t.3’ of the Auxiliary AM <br /> <br /> :: The program constructs a line from t.3 (or t.3’ if it exists) to t.5 (Trend Line of the Auxiliary Attraction Model, further - TLam) and checks it for the presence of price intersections in the section between t.3 and t.5.<br /> <br /> ::: '''6.2.1.''' Intersections are found <br /> <br /> ::: If intersections are found, the line t.3/t.3’-t.5 in this case is not displayed on the chart. The program searches for such point 3’ of the Auxiliary Attraction Model (further t.3’am), through which it is possible to construct a line, which will not have price intersections on the section from t.3/t.3’ to t.5.<br /> <br /> :::: '''6.2.1.1.''' If t.3’am is found<br /> <br /> :::: If t.3’am is found, then the program constructs the Line of trend of the auxiliary model of attraction by the tangent from t.3’am to t.5 (further – TLam’) and calculates the level of intersection of AL’ and TLmp’ (further – calculated t.6). There are 2 options:<br /> <br /> :::: '''6.2.1.1.1.''' If the calculated t.6 is found<br /> <br /> :::: If the calculated t.6 is found, then a check is carried out for the minimum ratio of the time segment t.2-t.4 to the segment t.4-t.6 for the Auxiliary AM (should be within 0.5). If the check is not passed, then the model does not have an auxiliary MP (in this case LTmp is not displayed on the chart), the algorithm proceeds to sub-step 6.3. If the check is passed, the program checks whether the bar t.5 breaks through the level of the calculated p.6.<br /> <br /> ::::: '''6.2.1.1.1.A.''' If the bar t.5 does not break through the level of the calculated p.6 <br /> <br /> ::::: If the t.5 bar does not break through the level of the calculated p.6, then the program proceeds to sub-step 6.3. In the report is displayed: AUX AM<br /> <br /> ::::: '''6.2.1.1.1.B.''' If the t.5 bar breaks through the level of the calculated p.6<br /> <br /> ::::: If the t.5 bar breaks through the level of the calculated p.6, then this AM cannot be built and the program is looking for a new t.4. for this the next bar is checked according to sub-step 3.4., or in case if the model has a mark draw_flag this branch of the algorithm stops.<br /> <br /> :::: '''6.2.1.1.2.''' The calculated point 6-th is not found<br /> <br /> :::: The calculated 6-th is not found (i.e., the lines do not intersect). In this case TLam is not displayed on the chart. In the report is displayed: AUX NoAM The program proceeds to sub-step 6.3.<br /> <br /> ::: '''6.2.1.2.''' If t.3’am is not found<br /> <br /> ::: If t.3’am is not found, then in the report is displayed: AUX NoAM The program proceeds to step 7.<br /> <br /> :: '''6.2.2.''' Intersections are not found <br /> <br /> :: Intersections are not found. In this case, the program calculates the level of intersection of TLam and AL’ (this is the level of the calculated p.6). There are 2 options according to sub-steps 6.2.1.1.1. and 6.2.1.1.2.<br /> <br /> : '''6.3.''' Construction of the Auxiliary AM through t.5<br /> <br /> : The program checks for the presence of t.5’ (the first possible local extremum in time on the section T.4-T.5). If T.5’ is found, in the report is displayed: AimsBlock5’ 5' If t.5’ is not, then in the report is displayed: AimsBlock5’ No5'<br /> <br /> : If t.5' is present, the program will follow a similar process as sub-step 6.2 to construct the Trend Line for the Auxiliary Attraction Model. However, this time it will start from t.5' and, if necessary, use another suitable t.3' (referred to as t.3'am5'). If the program successfully constructs a Auxiliary AM through t.5' (indicating convergence of the lines), the model will be labeled as [The AM is built through t.5'] in the report. <br /> : The report will display: <br /> : AUX5’: AUX5’<br /> : Alternatively, if the MP is not built through t.5', the program will display: <br /> : AUX5’: NoAUX5’ <br /> : After this, the program will proceed to step.7.<br /> <br /> <br /> ===''' Step VII. Determination of SP and Model Type.'''===<br /> The program recalls whether the model was built through t.2 or through t.2’<br /> : '''7.1.''' In case if AL is built through t.2 does not have intersection with the price on the section t.1-t.2, or if there is ALam, built through t.2’. Here and further it is assumed that if the line, built through t.2 to t.4 does not have intersections with the price on the section t.1-t.2, then it is considered that t.2’=t.2 and AL’=AL.<br /> <br /> : The type of the model is determined by the position of the intersection point of TL and AL’ (this is the line built from t.2’ to t.4) in relation to t.4:<br /> <br /> :: '''7.1.1.''' The intersection point of TL and AL’ lies to the right of t.4. In this case the intersection point of the lines is the calculated point 6 (further - calculated t.6).), then the program calculates the ratio of time segments from t.1 to t.4 and from t.4 to calculated point 6 for AM.<br /> <br /> ::: '''7.1.1.1.''' If the section from t.1 to t.4, multiplied by 3 is greater than the section from t.4 to the calculated point 6 for CMP, this model's type is AM.<br /> ::: G1: AM<br /> <br /> ::: If the model under consideration is AM and at the same time it is formed (i.e. after t.4 the TL is broken through), the program checks each bar after the t.4 bar, until one of the following events:<br /> <br /> :::: '''7.1.1.1.1.''' A bar is found that has reached the level of t.3 (but has not reached the level of t.4). In this case, this branch of the algorithm is completed.<br /> <br /> :::: '''7.1.1.1.2.''' A bar is found that has reached the level of t.4 (while either not reaching or reaching the level of t.3).<br /> <br /> :::: -in case of the presence of the draw_flag label – this branch stops;<br /> :::: -in another case, the program checks for the presence on the section from t.4 (not including) to the bar, which reached the level of t.4 (inclusive) of the extremum, opposite to the extremum t.4 (i.e. co-directed with the extremum t.1 of the analyzed model. There are 2 options:<br /> <br /> ::::: '''7.1.1.1.2.A.''' The extremum is found. In this case, the algorithm proceeds to step 8.<br /> <br /> ::::: '''7.1.1.1.2.B.''' The extremum is not found. In this case the status of the formed model is canceled (the model is discarded);<br /> ::::: -t.3 becomes the canceled t.3;<br /> ::::: -the program searches for the next candidate for t.3. For this, the program processes the bar that broke through the TL according to step 2.<br /> ::: '''7.1.1.2.''' If<br /> ::: -the section from t.1 to t.4, multiplied by 3 is less than or equal to the section from t.4 to the calculated t.6 (for converging lines) and at the same time<br /> ::: -the section from t.1 to t.4 multiplied by 12 is greater than the section t.4-t.6, this model is AM/DBM<br /> ::: G1: AM/DBM<br /> <br /> ::: '''7.1.1.3.''' The section from t.1 to t.4 multiplied by 12 is less than or equal to the section from SP to t.1 (for TL and AL converging to the left), then this model is DBM. <br /> ::: G1: DBM<br /> <br /> :: '''7.1.2.''' The intersection point of TL and AL’ (AL’ – this is the line from t.2’ – t.4) lies to the left of t.4 —this point is qualified as the Sacral Point (further – SP).<br /> <br /> ::: '''7.1.2.1.''' If<br /> ::: -the section from t.1 to t.4 multiplied by 3 is less than or equal to the section from SP to t.1, and at the same time;<br /> ::: -the section from t.1 to t.4 multiplied by 12 is greater than the section from SP to t.1 then this is EM/DBM <br /> ::: G1: EM/DBM<br /> <br /> ::: '''7.1.2.2.''' If the section from t.1 to t.4 multiplied by 3 is greater than the section from SP to t.1, this is eng. - EM.<br /> ::: G1: EM<br /> <br /> ::: '''7.1.2.3.''' If<br /> ::: -TL and AL of the model are parallel, or<br /> ::: -the section from t.1 to t.4 multiplied by 12 is less than or equal to the section t.4-t.6 (for TL and AL converging to the right);<br /> ::: -the section from t.1 to t.4 multiplied by 12 is less than or equal to the section from SP to t.1 (for TL and AL converging to the left), then this model is eng. - DBM <br /> ::: G1: DBM<br /> <br /> ::: The program proceeds to step 8.<br /> <br /> : '''7.2.''' If for this model it was impossible to construct AL (AL’) in such a way that there were no extra intersections on the section t.1 (inclusive) - t.2, then the program checks where TL and AL from t.2 intersect.<br /> <br /> :: '''7.2.1.''' If the lines intersect to the right (i.e. after t.4), then<br /> ::: '''7.2.1.1.''' if the section from t.1 to t.4, multiplied by 3 is greater than the section from t.4 to the calculated t.6 (for converging lines), then this model is incorrect.<br /> ::: There are one of 2 options:<br /> <br /> :::: '''7.2.1.1.1''' If the TL of the incorrect AM is broken through by the t.4 bar or the bar immediately following t.4, then<br /> <br /> :::: -in case of the presence of the draw_flag label – this branch stops;<br /> :::: -in another case t.3 becomes the canceled t.3 and the program searches for a new t.3, for this it processes the bar that broke through the TL AM according to step 2.<br /> :::: '''7.2.1.1.2.''' If the TL of the incorrect CMP is not broken through by the t.4 bar or the bar immediately following it, then the program searches for a new t.4, for this the next bar is checked according to sub-step 3.4.<br /> <br /> ::: '''7.2.1.2.''' -the section from t.1 to t.4, multiplied by 12 is greater than the section from t.4 to the calculated t.6, then this model is AM/DBM .<br /> ::: G1: AM/DBM<br /> <br /> ::: '''7.2.1.3.''' the section from t.1 to t.4 multiplied by 12 is less than or equal to the section from t.4 to t.6 then this model is DBM .<br /> ::: G1: DBM<br /> <br /> :: '''7.2.2.''' If TL and AL intersect to the left (i.e. in the past) relative to t.4, the program performs an indirect check for the Strength of the trend. For this, a pseudo SP is used – this is the intersection point of AL (built through t.2) and TL in case it is impossible to build AL through t.2 so that there are no extra points on it. The following options are possible:<br /> <br /> ::: '''7.2.2.1.''' If the pseudo SP lies to the right (i.e. later) of t.1 to t.3 (or t.3’, if the model is built on it), then the type of this model is determined as EM, moreover, the model is strong by pseudo SP.<br /> <br /> ::: G1: EM<br /> <br /> ::: SP: strongpseudoSP<br /> <br /> ::: '''7.2.2.2.''' Otherwise<br /> ::: If the lines intersect to the left of t.1 (i.e. earlier), the following options are possible:<br /> <br /> :::: '''7.2.2.2.1.''' If the section from t.1 to t.3 (3’) is greater than the section from the intersection of TL and AL to t.1, the model is assigned the type EM, while the Strength of the model is not determined.<br /> :::: G1: EM<br /> <br /> :::: SP: undef<br /> <br /> :::: '''7.2.2.2.2.''' If<br /> :::: -the section from T.1 to t.3(3’) is less than or equal to the section from the intersection of TL and AL to t.1 and up to<br /> :::: -the section from T.1 to t.3(3’) multiplied by 3 is greater than the section from the intersection of TL and AL to t.1, the model is assigned the type is EM. At the same time, the model is weak.<br /> <br /> :::: G1: EM<br /> <br /> :::: SP: weakpseudoST<br /> <br /> :::: '''7.2.2.2.3.''' If the section from t.1 to t.3(3’) multiplied by 3 is less than the section from the intersection of TL and AL to t.1, then the model type is EM/DBM.<br /> :::: G1: EM/DBM<br /> <br /> : '''7.3.''' Also, occasionally there are cases when the model for some reason does not fall under any of the above options. Then the model type is not determined.<br /> <br /> === '''Step VIII: Search for Alternative Models. Launching a New Branch from the Previous t.1 but with a Different t.3 '''===<br /> <br /> The program initiates a search for the subsequent model with the same t.1, but a new t.3. The bar following t.3/t.3’, according to step 2, is analyzed for this purpose. Concurrently, the program initiates a search for an alternative model in relation to the one already found. For this, it analyzes the bar that has broken through the level of t.4 as a potential t.4, according to step 3.4, and continues further according to the algorithm.<br /> <br /> <br /> ==References==<br /> &lt;references /&gt;</div>

Admin http://wiki.marketpawns.com/index.php?title=UMG_General_Concepts&diff=212 2024-01-04T20:53:16Z

<p>Admin: Definition of a Model as &quot;Half-Trend&quot; or &quot;From the Beginning of the Trend</p> <hr /> <div><br /> '''Algorithm''' is a specific set of rules used to construct technical analysis models on financial instrument charts. UMG utilizes two distinct algorithms, each responsible for building different types of technical analysis models.<br /> <br /> <br /> '''Model''' is a key structural concept in UMG that include a set of elements such as:<br /> # A segment of the price chart where the algorithm has been successfully applied.<br /> # A collection of lines constructed on the relevant price chart segment as a result of a complete and successful application of the Algorithm.<br /> <br /> <br /> '''Model’s Parameters''' is a collection of values derived from:<br /> # The price chart segment and the set of lines created by the Algorithm.<br /> # Certain parameters may also be calculated using other previously constructed models.<br /> <br /> <br /> '''Points, Touches and Breakdowns''':<br /> <br /> :'''Point''' is a key element of the model, which is determined in one of the following ways:<br /> ::- as the high/low of bar on the chart (for example Points 1,2,3,3',4,5 of a model) ;<br /> ::- as a specific bar where the price has formed an Absolute Extreme (for example Real Point 6);<br /> ::- as a forecast of the level and/or time calculated as the intersection of models lines (for example Calculated Point 6, Sacral Point, Supposed Point 6).<br /> :'''Touch''' is a specific location on the chart associated with the high or low of a particular bar, through which the model's line passes. Significant Extremes or tangent points identified by the Algorithm may serve as reference Points for building model's lines. <br /> :In the other case (Touch isn't a model's Point) it is the contact of the price with model's line (but not crossing of the line by the price). <br /> :'''Breakdown''' is a location where there price crossed (not just touched) the model's line for the first time.<br /> <br /> <br /> '''Extremes''':<br /> :'''Significant Extreme''' is a price extreme that has a Confirming Extreme.<br /> <br /> :'''Confirming Extreme''' is a price extreme that precedes a Significant Extreme. In essence, an extreme can only be deemed Significant if there is a Confirming Extreme preceding it.<br /> <br /> :'''Absolute Extreme''': In the context of algorithms, this refers to a price chart extreme that satisfies the following conditions:<br /> # It represents the lowest or highest price value in the region between two adjacent Absolute Extremes. Therefore, Absolute Extremes are mutually defining.<br /> # It is a Significant Extreme.<br /> <br /> :'''Local Extreme''': This is a price extreme that satisfies the following conditions:<br /> # Does not represent the lowest or highest price value in the region between two adjacent Absolute Extremes.<br /> # It is a Significant Extreme.<br /> <br /> <br /> '''Definition of a Model as &quot;Half-Trend&quot; or &quot;From the Beginning of the Trend&quot;'''<br /> <br /> For main models other than EAM, the program sequentially checks bars from right to left (i.e., into the past) from the bar containing t.1 until one of the following events occurs:<br /> <br /> # A price level intersection of t.2 is found.<br /> # A price level intersection of t.1 is found.<br /> <br /> ::- If the program checks 50 bars before t.1 of the model, and neither intersection is found, the model is considered a model from the beginning of the trend.<br /> ::- If the program checks less than 50 bars before t.1 of the model and reaches the initial bar of the chart without finding the desired intersection, the model is considered a model from the beginning of the trend.<br /> ::- If a t.1 intersection is found before a t.2 intersection, the model is considered a trend model.<br /> ::- If a t.2 intersection is found before a t.1 intersection, the model is considered a model from the beginning of the trend.</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_II&diff=211 2024-01-04T20:36:41Z

<p>Admin: /* Step XI. Final Selection of t.2 - Checking the Convergence of LT and LC */</p> <hr /> <div>This article is not finished<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with UMG General Concepts.<br /> <br /> ==='''Step I. Search For Point 3 of the External Attraction Model (EAM) and the Sarting Point of the Previous Trend.'''===<br /> : '''1.1.''' The program looks for the first possible extreme, satisfying Single Bar Rule. Such an extreme is a candidate for potential point 3 ( potential t.3).<br /> : '''1.2.''' Next, the program checks the bars from right to left (i.e., in the past) from the bar containing the extreme candidate for point 3 to one of the following events:<br /> :: '''1.2.1.''' Found the last intersection (breakthrough) point by the price level of the candidate for point 3.<br /> ::In this case, the report displays: <br /> :: PREVdata: FullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.2.''' The program reached the starting point of the chart (i.e., the price did not intersect the level of point 3 after the starting point of the chart).<br /> ::In this case, the report displays: <br /> :: PREVdata: NoFullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.3.''' The price checked 300 bars preceding point 3 &lt;ref&gt;The depth of the search for the extreme confirming point 3 of EAM model&lt;/ref&gt;, but the level of step 3 did not intersect at this segment. The program looks for an absolute extreme (opposite to step 3) on the segment from the 300th bar before point 3 to point 3. The program proceeds to substep 1.3.<br /> : '''1.3.''' The program looks for an absolute extreme (opposite to point 3 extreme) on the segment:<br /> ::- from the last intersection by the price level of the candidate for point 3 (inclusive) (if came from 1.2.1.), or <br /> :: - from the starting point of the chart (if came from 1.2.2.), or <br /> :: - from 300 bars(if came from 1.2.3.) <br /> :: to point 3 (excluding).<br /> :: '''1.3.1.''' Absolute extreme found. The candidate for point 3 is confirmed; moreover, the found confirming extreme is the assumed (if coming from 1.2.2. or 1.2.3.) starting point of the preceding trend.'''<br /> ::The program checks for the absence of extremes equal to point 3 between the assumed starting point of the previous trend and point 3. <br /> :::'''1.3.1.1.''' If such an extreme is found, this candidate for point 3 is discarded, and this point 3 is discarded. <br /> :::'''1.3.1.2.''' If such an extreme is not found, the program proceeds to step 2.<br /> ::'''1.3.2.''' Absolute extreme not found. This point 3 is discarded.'''<br /> ::Simultaneously with step 1, the program launches the search for the next potential point 3.<br /> <br /> ==='''Step II. Search For Potentioal Points 5 and 4 ''' ===<br /> '''The Orientation rule (N1 requirement) for Algorithm II is as follows:'''<br /> If point 3 is low, then the level of point 5 should be higher than point 3. <br /> If point 3 is high, then the level of point 5 should be lower than point 3.<br /> '''Search for Point 5.''' The bar following the bar of Point 3 (and in repeated applications of this step - the bar specified in this algorithm) is checked for not overcoming the level of point 3 (since N1 requirement for Algorithm II must be observed).<br /> :'''2.1.''' If the price has overcome the level of point 3, the program discards the considered step 3 (due to N1 requirement).<br /> :'''2.2.''' If N1 requirement is met for the analyzed bar, it is checked for compliance with N1 requirement as a potential point 5 (hereafter - point 5 or t.5).<br /> ::'''2.2.1.''' If the analyzed bar is not an extreme according to N1 requirement (as a potential point 5), the program checks the next bar from the beginning of step 2.<br /> ::'''2.2.2.''' If the analyzed bar is determined as an extreme according to N1 requirement (as a potential point 5), then this bar is checked for reaching (but not necessarily overcoming) the level of point 3. There are 2 options:<br /> :::'''2.2.2.1.''' If the level of point 3 is reached, the program analyzes the next bar according to this step (i.e., from the beginning of step 2).<br /> :::'''2.2.2.2.''' If the level of point 3 is not reached, the analyzed bar is a potential point 5, and the program moves to substep 2.3.<br /> :'''2.3. Search for Point 4.''' The program searches for a bar, which was the last to cross the level of the considered potential point 5. Let's denote this bar as lcb5 (line-crossing-bar-5). If lcb5 coincides with the bar of point 3, we denote the bar following lcb5 as look4. Otherwise, look4 = lcb5. The program searches for a bar with the maximum (if point 3 is low) or minimum (if point 3 is high) price in the interval from lcb5 to potential point 5. Then this bar is checked for being an extreme according to N1 requirement as a potential pont 4 (hereafter – point 4 or t.4). There are 2 options:<br /> ::'''2.3.1.''' The bar is an absolute extreme (as a potential point 4). In this case, potential point 4 is found.<br /> :::'''2.3.1.1.''' If step 2 has already been determined (this is possible when this step is triggered during the search for an alternative model), the program checks the line chart for extra points in the section from step 2 to step 4. There are 2 options:<br /> ::::'''2.3.1.1.A.''' If extra points are found, the program processes the next bar after potential point 5 according to step 2.<br /> ::::'''2.3.1.1.B.''' Extra intersections are not found; the program moves to substep 2.4.<br /> :::'''2.3.1.2.''' If substep 2.3.1. is triggered during the search for the basic model, the program moves to substep 2.4.<br /> ::'''2.3.2.''' The bar is not an absolute extreme (as a potential point 4). In this case, the program looks for another candidate for point 5 according to this step (i.e., according to step 2).<br /> If the program has processed 50 bars in a row according to this step (step 2), and the program has not moved to another step of the algorithm, then this potential point 3 is discarded.<br /> If there are 150 or more bars&lt;ref&gt;Continuous search range of t.5 in one iteration for EAM model&lt;/ref&gt; between potential point 3 and the analyzed bar, and potential points 4 and 5 are not found, then this potential point 3 is discarded.<br /> :'''2.4.''' Real-Time Verification of t.5 <br /> :The potential t.5 bar is checked for the presence of bars between the analyzed bar and the potential t.4 bar, which contain price values more distant (or even equally distant) from the potential t.4 than the most distant from t.4 value of the analyzed bar. This is a check of the potential t.5 for beeing the '''potential absolute extreme'''. The following options are possible:<br /> ::'''2.4.1.''' If the extreme is potentially absolute, the program proceeds to step 3.<br /> ::'''2.4.2.''' If the extreme is not potentially absolute, the program checks the next bar starting from this step (i.e., step 2).<br /> <br /> ===''' Step III. Confirmation of Point 4. Searching for Alternative t.5 and t.5&quot; '''===<br /> The program checks whether the bar of potential t.5 has reached the level of t.4. Two scenarios are possible:<br /> :'''3.1.''' The Bar of Potential t.5 Has Reached t.4.<br /> :In this case:<br /> ::The model is built through absolute t.5.<br /> ::The t.5 bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> ::Point 4 is confirmed,<br /> ::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3 (since there is already possible to display the model through t.5 on the chart).<br /> :'''3.2.''' The Bar of Potential t.5 Has Not Reached t.4. <br /> :In this case, the program checks the next bar for reaching the level of t.4. The following options are possible:<br /> ::'''3.2.1. The Considered Bar Reaches the Level of Potential t.4. <br /> ::In this case:<br /> :::The model is built through absolute t.5.<br /> :::The considered bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> :::Point 4 is confirmed,<br /> :::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3.ext, but first goes through sub-step 3.3.<br /> ::'''3.2.2.''' The Considered Bar Does Not Reach the Level of t.4.<br /> ::In this case the program checks the next bar for overcoming the level of potential t.5. Two scenarios are possible:<br /> :::'''3.2.2.1.''' If the t.5 level is overcome, the analyzed bar is considered as a new potential t.5. The program processes this bar according to step 2.<br /> :::'''3.2.2.2.''' If the t.5 level is not overcome, the analyzed bar is checked for reaching the level of t.4 according to sub-step 3.2.<br /> ::In parallel (i.e., an additional branch is created), the program proceeds to sub-step 3.3 (since there is already an option to display the model through t.5 on the chart). The model in this branch receives a &quot;draw_flag&quot; label.<br /> :'''3.3.''' Construction of the Trend Line (TL). <br /> :A Trend Line (TL) is constructed from t.3 to t.5. Each bar between t.3 and t.5 is checked for breaking the TL. Two scenarios are possible:<br /> ::'''3.3.1.'''The Price Crosses the TL. <br /> ::In this case, the TL through t.3 is not constructed. The program searches for a candidate for point 3' (hereafter - t.3'). T.3' is selected in such a way that the TL' (constructed from t.3' to t.5) is not crossed by the price in the 3-5 segment. Rule No.1 for t.3' is not applied. T.3' cannot belong to the same bar as t.4. Two scenarios are possible:<br /> :::'''3.3.1.1.''' T.3' is found, this model is classified as built through t.3'. The program proceeds to step 4, or to sub-step 3.3.extended if coming from 3.2.<br /> :::'''3.3.1.2.''' T.3' is not found. In this case, the program searches for new potential t.5 and t.4 according to step 2.<br /> ::'''3.3.2.''' The Price Does Not Break the TL. <br /> ::In this case, this model is classified as built through t.3 (absolute extreme). The program proceeds to step 4, or to sub-step 3.3.ext. if current algorithm line is coming from 3.2.<br /> <br /> <br /> ::'''3.3.ext. Additional Trend Line Construction Through t.5&quot;.'''<br /> ::If:<br /> ::*The t.5 bar does not exceed the range of t.4;<br /> ::*At the time of model calculation, the level of t.4 is confirmed, then this model is checked for the possibility of constructing an additional Trend Line (TL) through t.5&quot;. Note: If t.4 is not confirmed, this model should be recalculated upon the appearance of a bar that confirms it's t.4.<br /> <br /> ::''' Definition: Point 5&quot; '''<br /> ::Point 5&quot; can lie in the segment between t.5 and the point confirming t.4. On this segment, a point is searched that meets the following requirements:<br /> <br /> ::''' Rule for Selecting Point 5&quot; High '''<br /> ::To the left of the bar containing t.5&quot;, the nearest high should be above the level of t.5.<br /> ::To the right of t.5&quot;, at least one nearest high should be below or equal to t.5. ::If the nearest high is equal to the level of t.5, then the next high should again be below or equal to the level of t.5, until at least one bar is strictly below the level of t.5.<br /> <br /> ::''' Rule for Selecting Point 5&quot; Low '''<br /> ::To the left of the bar containing t.5&quot;, the nearest low should be below the level of the extreme.<br /> ::To the right of t.5&quot;, at least one nearest low should be above or equal to t.5. If the nearest low is equal to the level of t.5, then the next low should again be above or equal to the level of t.5, until at least one bar is strictly above the level of t.5.<br /> <br /> ::''' Special Cases for Point 5&quot; '''<br /> ::Point 5&quot; may belong to a bar that has broken the level of t.4 (but only the first of such bars). If the bar of potential t.5&quot; breaks the level of calculated t.6 from t.5, then it is impossible to construct a TL through t.5&quot; for this model (this model does not contain such a point).<br /> <br /> :::'''3.3.ext.1.''' Additional TL Calculation <br /> :::If a bar is found that fits the rule for selecting 5&quot;, an additional TL is calculated for the potential t.5&quot; (hereafter TL&quot;). This line is checked for the absence of breaks in the segment from t.3/3'' to potential t.5&quot;.<br /> <br /> :::::'''3.3ext.1.a.''' If there is an intersection, the program moves to check the next bar as a potential t.5&quot;.<br /> <br /> :::::'''3.3ext.1.b.''' If there is no intersection, the found bar is compared with the previous candidate for t.5&quot; (if there was one in the previous iteration of the cycle). If the considered bar is closer to the level of t.4 than the candidate for t.5&quot;, then the considered bar becomes the new candidate for t.5&quot;.<br /> :::The check of bars continues in a cycle until a bar confirming t.4 is reached. If a candidate for t.5 is found as a result of the check, the program moves to sub-step 3.3ext.1.1; otherwise, it moves to step 4.<br /> ::::'''3.3ext.1.1.''' If the analyzed model is built through t.3', a candidate for t.3&quot; is sought in the segment t.3-t.3', through which such a line to t.5&quot; can be built that will not have price intersections in the segment t.3-t.3&quot;.<br /> :::::'''3.3ext.1.1.1.''' If a candidate for t.3&quot; is found, where there are no intersections, a check is made for the intersection of TL&quot; by the bar following t.5&quot;.<br /> ::::::'''3.3.ext.1.1.1.A.''' If there are intersections, t.5&quot; is declared canceled, and the next one is sought according to sub-step 3.3.ext.<br /> ::::::'''3.3.ext.1.1.1.B.''' Otherwise, the program moves to step 13.2.<br /> :::::'''3.3.ext.1.1.2.''' If a suitable t.3&quot; is not found, a re-search for a candidate for t.5&quot; is carried out according to sub-steps 3.3.ext., but in this case, if a candidate for t.5&quot; was found, it becomes a canceled candidate for t.5&quot;. The new candidate must already be further from t.4 than the previously discarded ones.<br /> ::::'''3.3ext.1.2.''' If the analyzed model is built through t.3, a check is made for the intersection of TL'' by the bar following t.5&quot;.<br /> :::::'''3.3ext.1.2.A.''' If there are intersections, t.5&quot; is declared as canceled t.5', and the next one is sought according to sub-step 3.3.ext.<br /> :::::'''3.3ext.1.2.B.''' If there are no intersections, the algorithm moves to step 13.2.<br /> :::'''3.3.ext.2.''' TL'' is checked for price intersections in the segment between t.5 (inclusive) and potential t.5&quot; (hereafter segment 5-5&quot;).<br /> ::::'''3.3.ext.2.1.''' If there is an intersection, then this 5&quot; is filtered out. A re-search for a candidate for t.5&quot; is carried out according to sub-steps 3.3.ext., but in this case, the new candidate must already be further from t.4 (in terms of time) than the previously discarded ones.<br /> ::::'''3.3.ext.2.2.''' If there are no intersections of TL&quot; in the segment 5-5&quot;, then t.5&quot; is found.<br /> ::::In this case, the report displays: EAM5&quot; EAM5&quot;<br /> ::::The program moves to step 4.<br /> ::::'''3.3.ext.2.3.''' If t.5&quot; is not found, the program moves to step 4.<br /> <br /> ==='''Step IV: Searching for Potential Foundation Blocks.'''===<br /> <br /> ====Initial Check====<br /> First, it is necessary to check for the presence of a fixed t.2. If it exists, it means we are in a branch for searching for alternative models.<br /> <br /> ::'''4.0.1.''' If t.2 is defined in the model, proceed to step 6.<br /> ::'''4.0.2.''' If t.2 is not defined, the program moves to step 4.1.<br /> ====Examination of Extremes====<br /> On the preceding trend, extremes are checked sequentially from right to left (i.e., into the past) from t.3 (or from another analyzed bar in repeated applications of this step) according to the N1 bar rule (as a candidate for t.2). Each found candidate for t.2 is checked for the presence of a confirming extreme (which also serves as t.1) according to the following algorithm:<br /> <br /> ::'''4.1.0.''' An extreme candidate for t.2 is found.<br /> ::'''4.1.1.''' The point of the last intersection &lt;ref&gt;High or low of a bar, repeating or crossing high or low of t.2 bar – is an intersection&lt;/ref&gt; of the candidate's level with the price is found. In this case, the program looks for the absolute maximum (if t.2 is a minimum, i.e., t.2 is low) or the absolute minimum (if t.2 is a maximum, i.e., t.2 is high) in the segment from the last intersection of the t.2 level with the price to t.2.<br /> :::'''4.1.1.1.''' Maximum/minimum not found. In this case, the program discards this candidate for t.2.<br /> :::'''4.1.1.2.''' Maximum/minimum found. In this case, the potential t.2 is confirmed.<br /> :::'''4.1.2.''' The program reaches the starting point of the chart.<br /> :::'''4.1.3.''' The check reaches the boundary of the Depth of Search for t.1 &lt;ref&gt;&quot;Search depth t.1 for EAM models&quot; is set in the Calculation Parameters. It is calculated in bars from the bar of the considered potential t.2. By default, this value is 50 bars.&lt;/ref&gt; for the model and none of the above events (4.1.1. or 4.1.2.) occurred.<br /> <br /> ::'''4.2.''' The search for Foundation Blocks (i.e., points 1 and 2, a.k.a FB) continues until one of the events in steps 4.2.A, 4.2.B or 4.2.C. occurs.<br /> :::'''4.2.A. The check reaches the bar containing the (presumed) starting point of the preceding trend (from sub-step 1.2.2.1.). This point is not considered as a potential t.2<br /> :::'''4.2.B.''' The check reaches the bar that intersects the level of the presumed point 4 of the considered model.<br /> :::'''4.2.C.''' A bar that is located at a distance (by time) from T.3 greater than or equal to X* (distance from T.3 to t.4), where x is the parameter set in the settings &lt;ref&gt; This is the &quot;Time Ratio of 23 to 24&quot;(by default it is 3)&lt;/ref&gt;.<br /> ::=== Results ===<br /> ::As a result of the search for potential t.2 (i.e., upon the occurrence of4.2.A, 4.2.B or 4.2.C.), two scenarios are possible:<br /> :::'''4.2.1. ''' One or more pairs of potential t.2 and t.1 are found (potential Foundation Blocks). The program moves to step 5.<br /> :::'''4.2.2. ''' No potential Foundation Blocks are found. In this case, the program looks for the next potential t.5 according to step 2.<br /> <br /> === '''Step V. Search for Presupposition''' ===<br /> Presupposition is an optional part of the EAM.<br /> The program attempts to construct Presuppositions from all available candidates for t.2.<br /> <br /> ==== Presupposition Search Algorithm ====<br /> The program takes each potential t.2 of the EAM (as part of a potential FB) as a t.1 of Presupposition (hereinafter t.1p). In other words, the program tries to construct Presuppositions from each of the t.2.<br /> <br /> Initially, the most recent (rightmost) potential t.2 (or the one specified in the algorithm if we have returned to the beginning of the Step V in the cycle) in the EAM is taken as a potential t.1p. If there are no more unconfirmed t.1p, the algorithm proceeds to Step 6.<br /> <br /> : '''5.1.''' The program sequentially checks bars from left to right (into the future) from the potential t.1p to t.3 of EAM model (excluding t.3) for being an extreme according to the N1 rule as point 3 of the Presupposition (hereinafter t.3p).<br /> <br /> : '''N1 rule for the Presupposition points'''<br /> : If t.1p is low, t.3p must be below t.1p.<br /> : If t.1p is high, t.3p must be above t.1p.<br /> <br /> :: '''5.1.1.''' If the potential t.3p is not found, the program considers the next (to the left of the previous) potential t.2 of the EAM (within the FB) as t.1p.<br /> :: If the potential t.3p is not found, and there are no more potential FBs, the algorithm proceeds to Step 6.<br /> :: '''5.1.2.''' Once the potential t.3p is found, the program searches for point 2 of the Presupposition (hereinafter t.2p) as an extreme with the maximum/minimum price on the segment from t.1p to t.3p (hereinafter segment 1p-3p).<br /> :: If a suitable extreme is not found, the algorithm looks for the next potential t.3p for the previously found t.1p.<br /> :: If a maximum/minimum is found, it is checked for for being an extreme (as t.2p).<br /> :: There are two possibilities:<br /> ::: '''5.1.2.1.''' The bar is an absolute extreme. In this case, a potential t.2p is found, and the program proceeds to step 5.2.<br /> ::: '''5.1.2.2.''' The bar is not an extreme. In this case, the program looks for another candidate for t.3p for the previously found t.1p following the instructions in 5.1.<br /> : '''5.2.''' The program constructs a line from t.1p to t.3p and checks it for price crossings on the segment from t.1p to t.3 of the EAM (including t.3 of EAM).<br /> :: '''5.2.1.''' If this lines price crossings are found, the program looks for a new candidate for t.3p for the previously found t.1p following the instructions in sub-step 5.1.<br /> :: '''5.2.2.''' If there are no price crossings, the program proceeds to sub-step 5.3.<br /> <br /> : '''5.3.''' The program searches for a potential point 4 of the Presupposition (t.4p) according to the N1 rule on the segment from t.3p to t.3 in the VMP (including t.3).<br /> <br /> : If t.1p is low, t.4p must be below t.2p. Each subsequent candidate for t.4p must be below the previous candidate for t.4p.<br /> : If t.1p is high, t.4p must be above t.2p. Each subsequent candidate for t.4p must be above the previous candidate for t.4p.<br /> : Possible scenarios:<br /> :: '''5.3.A.''' If the potential t.4p coincides with t.3 in the EAM, t.4p is confirmed (found), and the program proceeds to sub-step 5.3.1.<br /> :: '''5.3.B.''' If the potential t.4p does not coincide with t.3 in the EAM (i.e., it is located before it), the program looks for an opposite-direction potential t.4p extreme on the segment from the potential t.4p (excluding it) to the bar where the price again reached the value of the potential t.4p (excluding it).<br /> <br /> :: There are two possibilities:<br /> ::: '''5.3.B.1.''' If the opposite-direction extreme is found, t.4p is confirmed (found), and the program proceeds to sub-step 5.3.1.<br /> ::: '''5.3.B.2.''' If the opposite-direction extreme is not found, the program looks for a new potential t.4p following the instructions in sub-step 5.3.1.<br /> :: '''5.3.1.''' If t.4p is found, the program constructs a line from t.2p to t.4p and checks it for price crossings on the segment from t.1p (excluding it) to t.3 in the VMP (including t.3).<br /> ::: If unnecessary intersections are found, the program looks for the next potential t.4p on the segment following the instructions in 5.3.<br /> ::: If no unnecessary intersections are found, the algorithm proceeds to sub-step 5.4.<br /> :: '''5.3.2.''' Check for Absolute Level<br /> :: The program checks the bar of the potential t.3p for absoluteness. The level of t.3p should not be exceeded by the price on the segment between t.3p and potential t.4p (excluding it).<br /> ::: '''5.3.2.1.''' If the level of t.3p is exceeded, the potential t.3p is discarded, and the program looks for a new t.3p following the instructions in sub-step 5.1. and further according to the algorithm.<br /> <br /> :::: '''5.3.2.2.''' If the level of t.3p is not exceeded, t.3p is confirmed, t.4p is confirmed, and the algorithm proceeds to sub- step 5.4.<br /> <br /> ==== Presupposition Verification ====<br /> : ''' 5.4.''' Presuppositions undergo the following checks:<br /> :: '''A.''' - Bars t.1p, t.2p, t.3p must follow each other.<br /> :: '''B.''' - The distance in levels between t.1 and t.2 (hereinafter rank 12) must be at least the value of the Minimum Distance between t.1 and t.2 Levels of the Presupposition, which is set in the Calculation Parameters, from the distance between t.4 and t.5 levels of the EAM model(this is rank 45).<br /> <br /> :: If all checks are successful, the Presupposition is found. If there are no unchecked t.1p left, the algorithm proceeds to Step 6.<br /> <br /> :: If there are no unchecked t.1p left, the algorithm proceeds to Step 6.<br /> <br /> === '''Step VI. Check for AL price crossings''' ===<br /> <br /> ==== '''6 alfa.''' ==== <br /> First it is necessary to check for the presence of a fixed t.2. If it exists, it means we are in a branch of searching for alternative models. <br /> <br /> The potential Aims Line (from t.2 to t.4), hereinafter referred to as AL, is calculated, and then:<br /> : '''6 alfa.1.''' AL Crossing Check<br /> <br /> :: '''6 alfa.1. A.''' - If there are no AL price crossings, the algorithm proceeds to step 6 alfa.2.<br /> :: '''6 alfa.1. B.''' - If AL is crossed, the next potential t.5 is determined according to Step 2, starting from bar t.5+2.<br /> : '''6.2. alfa.''' Distance Check for AL and TL Intersection<br /> : If:<br /> :: - TL and AL of the model do not intersect on the right (in the future) or<br /> :: - the ratio of the distance in bars between t.2 and t.4 to the distance between t.4 and the calculated point 6 is less than the default value of the parameter &quot;Minimum ratio of t.2-t.4 to t.4-t.6 EAM,&quot; then the search for alternative models is terminated. Otherwise, the program proceeds to Step 9. <br /> <br /> ====''' In the general case (no precviously fixed t.2)''' ====<br /> The program performs the following checks for each of the potential FBs:<br /> : '''6.1.''' AL Price Crossing Check (not just touching)<br /> : If AL intersects with the price on the segment between t.2 and t.4, this pair of candidates for t.1 and t.2 (this FB) is rejected.<br /> :: '''6.1.A.''' If FBs are found that give AL without intersections, the algorithm proceeds to step 6.2.<br /> :: '''6.1.B.''' If there are no suitable FBs, the algorithm looks for a new t.5 according to Step 2.<br /> <br /> : '''6.2.''' Checking for intersection of AL and TL (hereinafter referred to as calculated point 6) with each other on the right (in the future) along the time axis.<br /> : If the ratio of the distance in bars between t.2 and t.4 to the distance between t.4 and the calculated t.6 is less than the default value of the parameter &quot;Minimum ratio of t.2-t.4 to t.4-t.6 VMP,&quot; then these candidates for t.1 and t.2 are rejected.<br /> : The following scenarios are possible:<br /> :: '''6.2.A.''' One or several potential FBs remain - in this case, the program proceeds to Step 7.<br /> :: '''6.2.B.''' There are no potential FBs left - in this case, the program looks for a new potential t.5, starting from Step 2 and onwards.<br /> <br /> === '''Step VII. Dtermintaion of FB's with and without 2X5''' ===<br /> <br /> The program checks for the intersection of the bodies of candles at t.2 and t.5 (hereinafter referred to as 2x5). If there is only one potential FB, determining FB with 2x5 is not required, and the program proceeds to Step 8.<br /> <br /> :'''7.1.''' If there are multiple potential BOs, some of which have 2x5 and some do not, those potential BOs that have 2x5 are filtered out, and the program proceeds to Step 8.<br /> <br /> :'''7.2.''' If all potential FBs have 2x5, then all are filtered out except the one whose t.2 level is closer to the t.3 level. The program proceeds to <br /> <br /> === '''Step VIII: Filtering Based on Presupposition''' ===<br /> <br /> The algorithm checks whether Presuppositions have been found for the analyzed model.<br /> <br /> :'''8.0.''' If no Presuppositions are found, the program proceeds to Step 9.<br /> <br /> :'''8.1.''' The model has one or more Presuppositions. For each Presupposition program checks if the available candidates for t.2 belong to the interval between the last price level intersection of t.1p and t.1p itself (t.1p can also be used as t.2 EAM).<br /> <br /> ::'''8.1.1.''' There are candidates for t.2 that belong to the interval between the last price level intersection of t.1p and t.1p itself. Such a Presupposition is retained.<br /> ::'''8.1.2.''' There are no candidates for t.2 within the specified interval. In this case, such a Presupposition is discarded and not further considered (meaning the model has no Presupposition).<br /> :'''8.2.''' If after checking all Presuppositions according to sub-step 8.1., there are one or more Presuppositions with candidates in t.2 within the interval between the last price level intersection of t.1p and t.1p itself (inclusive), then:<br /> <br /> : - Among such Presuppositions, only the one with t.1p occurring later on the time axis is considered further;<br /> : - Only those candidates that belong to the interval between the last price level intersection of t.1p and t.1p itself are retained as t.2 candidates for the remaining Presupposition.<br /> ::'''8.2.1.''' If only one potential FB remains, the model is confirmed.<br /> ::'''8.2.2.''' If more than one potential FB remains, the program proceeds to Step 9.<br /> <br /> === '''Step IX. Search for Embedded Models in EAM''' ===<br /> <br /> :'''9.1.''' If EAM is constructed through t.3', then the interval from EAM's t.3 is checked for the presence of models according to Algorithm I, for which the following conditions are simultaneously satisfied. In the paragraph below, the numbers I and II in parentheses next to the model points denote the algorithm to which the model with this point belongs:<br /> <br /> : - If the model according to Algorithm I contains t.5, then its t.5 should precede or coincide with the t.5 of the analyzed EAM.<br /> : - t.4 does not lie beyond t.4 of the analyzed EAM; (bar of t.4(I) cannot coincide with bar of t.3(II), but can coincide with bar of t.4(II);<br /> : -t.1 lies before t.3' of the analyzed model (if it coincides with bar of t.3', then it is not suitable anymore) (t.1(I) can coincide with t.3(II), but cannot coincide with t.3'(II)<br /> <br /> If there are more than 5 models, those with the time distance from t.1 to t.4 greater than others are considered embedded models.<br /> <br /> ::'''9.1.1.''' If models are not found, then EAM does not have an embedded primary model.<br /> <br /> ::'''9.1.2.''' If the model/s is/are found, EAM is given the status of &quot;Models described near the Primary model.&quot;<br /> <br /> ::'''9.1.3.''' If EAM has one or more embedded models, models among them built from EAM's t.3 are searched for meeting one of the following criteria:<br /> <br /> ::: A. Having a trendline breakthrough in the interval before t.3' of the analyzed model;<br /> ::: B. Having an intersection of candle bodies at points 2 and 5 (hereinafter 2x5).<br /> ::: C. If the embedded model has a rank 45 greater than the ranks of 12 and 25 of the same model.<br /> ::: '''9.1.3.1.''' In the presence of one of these criteria, the model is Specific based on the 1st criterion.<br /> ::: '''9.1.3.2.''' In the absence of the specified criteria, the model is Normal based on the 1st criterion.<br /> <br /> :: '''9.1.4.''' If there is a model according to Algorithm I on the interval from t.3 to t.3' of the EAM, aligned with the preceding EAM trend, and with points t.1-t.4 lying on the interval 3-3' EAM (inclusive), then this EAM is Specific based on the 2nd criterion. <br /> :: In the absence of the specified criteria, the model is Normal based on the 2nd criterion.<br /> <br /> : Upon completion of all checks in step 9.1., the program proceeds to step 10.<br /> <br /> :'''9.2.''' If EAM is constructed through t.3, the program proceeds to step 10.<br /> <br /> === '''Step X. Search for Preceding Models''' ===<br /> <br /> The program identifies all possible models in accordance with Algorithm I, starting from the initial point of the preceding trend or starting from the presumed initial point of the preceding trend, see step 1.3.).<br /> In these models, the actual t.6 is determined, and if there was no intersection of TL, the Presumed t.6 (P6supp) is used. The algorithm for finding the actual/presumed t.6 is described in the branch of Algorithm I, see substep 5.3.<br /> <br /> Models on the preceding trend, with TL coinciding with t.3 of the EAM, are (directly) preceding for the given TL.<br /> <br /> Models on the preceding trend, for which the following conditions are simultaneously satisfied:<br /> : - actual/presumed t.6 precedes or equals t.3 of the EAM;<br /> : - t.6 is aligned with t.4 of the EAM;<br /> : - the level of t.6 lies between the levels of t.3 and t.4 of the EAM;<br /> are considered preceding corrective for the given EAM.<br /> <br /> From models with the same t.4 and the same t.1, the model with the later t.1 is selected as the priority for choosing t.2.<br /> <br /> From the remaining models with the same t.4, only the very last model is considered as both preceding and preceding corrective (i.e., with a later t.5 or without t.5) – one of each type.<br /> <br /> If there are more than 10 preceding and preceding corrective models (rarely encountered), only the last ones are selected (the last ones are determined as those with t.4 lying later than others).<br /> <br /> === '''Step XI. Final Selection of t.2 - Checking the Convergence of LT and LC''' ===<br /> <br /> :'''11.0.''' If t.2 is known (for example, in the case algorythm is searching for an alternative model), proceed directly to sub-step 11.3.<br /> <br /> ::'''11.0.1.''' The program finds the closest (in terms of time from t.1 of these models to t.3 of EAM) linked model on the preceding trend (preceding or preceding corrective).<br /> :::'''11.0.1.1.''' If<br /> :::: - the closest preceding model is a model from the beginning of the trend, and<br /> :::: - t.2 of the analyzed model is before or coincides with t.1 of the preceding model, then the considered t.2 is rejected, and this branch of the algorithm is terminated.<br /> :::'''11.0.1.2.''' If<br /> :::: - the closest preceding model is a trend model, and<br /> :::: - t.2 of the analyzed model is before t.1 of the preceding model,<br /> ::: the considered t.2 is rejected, and this branch of the algorithm is terminated.<br /> <br /> If EAM contains a presupposition, the program proceeds to sub-item 11.2. If the model does not contain a presupposition, the program proceeds to sub-item 11.1.<br /> <br /> :'''11.1.''' The program finds the closest (in terms of time from t.1 of these models to t.3 of EAM) linked model on the preceding trend (preceding or preceding corrective).<br /> ::'''11.1.0.''' If there are no preceding models, the program proceeds to sub-step 11.2.<br /> ::'''11.1.1.''' If the nearest found linked model (preceding or preceding corrective) is a model from the beginning of the trend (not a trend model), then all potential t.2 that coincide with the bar of t.1 of the found linked model or are located before t.1 of the found linked model are rejected. The program proceeds to sub-step 11.2.<br /> ::'''11.1.2.''' If the nearest found linked model (preceding or preceding corrective) is a trend model, then<br /> :::'''11.1.2.1.''' In the presence of a preceding trend model, all t.2 that are located before t.1 of the preceding model are rejected. In other words, t.1 of the preceding can be t.2 of EAM, and the points located before t.1 of the preceding - cannot be t.2 of EAM. The program proceeds to sub-step 11.2.<br /> :::'''11.1.2.2.''' In the presence of a preceding corrective trend model, the program looks for another linked model on the preceding trend of EAM (the next in terms of distance) and analyzes it as a reference for this item (11.1.). In other words, the program returns to the beginning of sub-step 11.1.<br /> <br /> ::'''11.2.1.''' For specific models, the program selects the most distant t.2 in terms of time from t.3.<br /> ::'''11.2.2.''' For simple models, the program selects t.2 that is as close as possible in time to t.3.<br /> <br /> :'''11.3.''' The algorithm calculates the level of intersection of TL and AL of EAM (hereinafter – the calculated t.6). The position of t.5 in relation to the level of the calculated t.6 is checked. There are two possible scenarios:<br /> ::'''11.3.1.''' If the bar of t.5 does not penetrate the level of the calculated t.6, the program checks if t.5'' has been found (in sub-step 13). Two scenarios are possible:<br /> :::'''11.3.1.1.''' If t.5'' has been found, then the program checks for the convergence of TL'' and AL. <br /> ::::'''11.3.1.1.А.''' If the lines converge, then the program checks for the extent of convergence of TL'' and AL. If the ratio of the distance in bars between t.2 and t.4 to the distance between t.4 and the calculated t.6'' is less than the default value of the parameter &quot;Minimum ratio of t.2-t.4 to t.4-t.6 EAM&quot;, then t.5'' is rejected.<br /> ::::'''11.3.1.1.Б.''' If TL'' and AL diverge, then t.5'' is rejected.<br /> :::: In the end of sub-step 11.3.1.1. - the program records the model.<br /> <br /> :::'''11.3.1.2.''' If t.5'' is absent, the program records the model.<br /> <br /> ::'''11.3.2.''' If the bar of t.5 penetrates the level of the calculated t.6, then this EAM cannot be built, and the program looks for a new t.5 by processing the bar following the bar of t.5 according to sub-step 2 and further according to the algorithm.<br /> <br /> ==References==<br /> &lt;references /&gt;</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_II&diff=210 2024-01-04T20:35:32Z

<p>Admin: Adding Step 11</p> <hr /> <div>This article is not finished<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with UMG General Concepts.<br /> <br /> ==='''Step I. Search For Point 3 of the External Attraction Model (EAM) and the Sarting Point of the Previous Trend.'''===<br /> : '''1.1.''' The program looks for the first possible extreme, satisfying Single Bar Rule. Such an extreme is a candidate for potential point 3 ( potential t.3).<br /> : '''1.2.''' Next, the program checks the bars from right to left (i.e., in the past) from the bar containing the extreme candidate for point 3 to one of the following events:<br /> :: '''1.2.1.''' Found the last intersection (breakthrough) point by the price level of the candidate for point 3.<br /> ::In this case, the report displays: <br /> :: PREVdata: FullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.2.''' The program reached the starting point of the chart (i.e., the price did not intersect the level of point 3 after the starting point of the chart).<br /> ::In this case, the report displays: <br /> :: PREVdata: NoFullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.3.''' The price checked 300 bars preceding point 3 &lt;ref&gt;The depth of the search for the extreme confirming point 3 of EAM model&lt;/ref&gt;, but the level of step 3 did not intersect at this segment. The program looks for an absolute extreme (opposite to step 3) on the segment from the 300th bar before point 3 to point 3. The program proceeds to substep 1.3.<br /> : '''1.3.''' The program looks for an absolute extreme (opposite to point 3 extreme) on the segment:<br /> ::- from the last intersection by the price level of the candidate for point 3 (inclusive) (if came from 1.2.1.), or <br /> :: - from the starting point of the chart (if came from 1.2.2.), or <br /> :: - from 300 bars(if came from 1.2.3.) <br /> :: to point 3 (excluding).<br /> :: '''1.3.1.''' Absolute extreme found. The candidate for point 3 is confirmed; moreover, the found confirming extreme is the assumed (if coming from 1.2.2. or 1.2.3.) starting point of the preceding trend.'''<br /> ::The program checks for the absence of extremes equal to point 3 between the assumed starting point of the previous trend and point 3. <br /> :::'''1.3.1.1.''' If such an extreme is found, this candidate for point 3 is discarded, and this point 3 is discarded. <br /> :::'''1.3.1.2.''' If such an extreme is not found, the program proceeds to step 2.<br /> ::'''1.3.2.''' Absolute extreme not found. This point 3 is discarded.'''<br /> ::Simultaneously with step 1, the program launches the search for the next potential point 3.<br /> <br /> ==='''Step II. Search For Potentioal Points 5 and 4 ''' ===<br /> '''The Orientation rule (N1 requirement) for Algorithm II is as follows:'''<br /> If point 3 is low, then the level of point 5 should be higher than point 3. <br /> If point 3 is high, then the level of point 5 should be lower than point 3.<br /> '''Search for Point 5.''' The bar following the bar of Point 3 (and in repeated applications of this step - the bar specified in this algorithm) is checked for not overcoming the level of point 3 (since N1 requirement for Algorithm II must be observed).<br /> :'''2.1.''' If the price has overcome the level of point 3, the program discards the considered step 3 (due to N1 requirement).<br /> :'''2.2.''' If N1 requirement is met for the analyzed bar, it is checked for compliance with N1 requirement as a potential point 5 (hereafter - point 5 or t.5).<br /> ::'''2.2.1.''' If the analyzed bar is not an extreme according to N1 requirement (as a potential point 5), the program checks the next bar from the beginning of step 2.<br /> ::'''2.2.2.''' If the analyzed bar is determined as an extreme according to N1 requirement (as a potential point 5), then this bar is checked for reaching (but not necessarily overcoming) the level of point 3. There are 2 options:<br /> :::'''2.2.2.1.''' If the level of point 3 is reached, the program analyzes the next bar according to this step (i.e., from the beginning of step 2).<br /> :::'''2.2.2.2.''' If the level of point 3 is not reached, the analyzed bar is a potential point 5, and the program moves to substep 2.3.<br /> :'''2.3. Search for Point 4.''' The program searches for a bar, which was the last to cross the level of the considered potential point 5. Let's denote this bar as lcb5 (line-crossing-bar-5). If lcb5 coincides with the bar of point 3, we denote the bar following lcb5 as look4. Otherwise, look4 = lcb5. The program searches for a bar with the maximum (if point 3 is low) or minimum (if point 3 is high) price in the interval from lcb5 to potential point 5. Then this bar is checked for being an extreme according to N1 requirement as a potential pont 4 (hereafter – point 4 or t.4). There are 2 options:<br /> ::'''2.3.1.''' The bar is an absolute extreme (as a potential point 4). In this case, potential point 4 is found.<br /> :::'''2.3.1.1.''' If step 2 has already been determined (this is possible when this step is triggered during the search for an alternative model), the program checks the line chart for extra points in the section from step 2 to step 4. There are 2 options:<br /> ::::'''2.3.1.1.A.''' If extra points are found, the program processes the next bar after potential point 5 according to step 2.<br /> ::::'''2.3.1.1.B.''' Extra intersections are not found; the program moves to substep 2.4.<br /> :::'''2.3.1.2.''' If substep 2.3.1. is triggered during the search for the basic model, the program moves to substep 2.4.<br /> ::'''2.3.2.''' The bar is not an absolute extreme (as a potential point 4). In this case, the program looks for another candidate for point 5 according to this step (i.e., according to step 2).<br /> If the program has processed 50 bars in a row according to this step (step 2), and the program has not moved to another step of the algorithm, then this potential point 3 is discarded.<br /> If there are 150 or more bars&lt;ref&gt;Continuous search range of t.5 in one iteration for EAM model&lt;/ref&gt; between potential point 3 and the analyzed bar, and potential points 4 and 5 are not found, then this potential point 3 is discarded.<br /> :'''2.4.''' Real-Time Verification of t.5 <br /> :The potential t.5 bar is checked for the presence of bars between the analyzed bar and the potential t.4 bar, which contain price values more distant (or even equally distant) from the potential t.4 than the most distant from t.4 value of the analyzed bar. This is a check of the potential t.5 for beeing the '''potential absolute extreme'''. The following options are possible:<br /> ::'''2.4.1.''' If the extreme is potentially absolute, the program proceeds to step 3.<br /> ::'''2.4.2.''' If the extreme is not potentially absolute, the program checks the next bar starting from this step (i.e., step 2).<br /> <br /> ===''' Step III. Confirmation of Point 4. Searching for Alternative t.5 and t.5&quot; '''===<br /> The program checks whether the bar of potential t.5 has reached the level of t.4. Two scenarios are possible:<br /> :'''3.1.''' The Bar of Potential t.5 Has Reached t.4.<br /> :In this case:<br /> ::The model is built through absolute t.5.<br /> ::The t.5 bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> ::Point 4 is confirmed,<br /> ::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3 (since there is already possible to display the model through t.5 on the chart).<br /> :'''3.2.''' The Bar of Potential t.5 Has Not Reached t.4. <br /> :In this case, the program checks the next bar for reaching the level of t.4. The following options are possible:<br /> ::'''3.2.1. The Considered Bar Reaches the Level of Potential t.4. <br /> ::In this case:<br /> :::The model is built through absolute t.5.<br /> :::The considered bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> :::Point 4 is confirmed,<br /> :::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3.ext, but first goes through sub-step 3.3.<br /> ::'''3.2.2.''' The Considered Bar Does Not Reach the Level of t.4.<br /> ::In this case the program checks the next bar for overcoming the level of potential t.5. Two scenarios are possible:<br /> :::'''3.2.2.1.''' If the t.5 level is overcome, the analyzed bar is considered as a new potential t.5. The program processes this bar according to step 2.<br /> :::'''3.2.2.2.''' If the t.5 level is not overcome, the analyzed bar is checked for reaching the level of t.4 according to sub-step 3.2.<br /> ::In parallel (i.e., an additional branch is created), the program proceeds to sub-step 3.3 (since there is already an option to display the model through t.5 on the chart). The model in this branch receives a &quot;draw_flag&quot; label.<br /> :'''3.3.''' Construction of the Trend Line (TL). <br /> :A Trend Line (TL) is constructed from t.3 to t.5. Each bar between t.3 and t.5 is checked for breaking the TL. Two scenarios are possible:<br /> ::'''3.3.1.'''The Price Crosses the TL. <br /> ::In this case, the TL through t.3 is not constructed. The program searches for a candidate for point 3' (hereafter - t.3'). T.3' is selected in such a way that the TL' (constructed from t.3' to t.5) is not crossed by the price in the 3-5 segment. Rule No.1 for t.3' is not applied. T.3' cannot belong to the same bar as t.4. Two scenarios are possible:<br /> :::'''3.3.1.1.''' T.3' is found, this model is classified as built through t.3'. The program proceeds to step 4, or to sub-step 3.3.extended if coming from 3.2.<br /> :::'''3.3.1.2.''' T.3' is not found. In this case, the program searches for new potential t.5 and t.4 according to step 2.<br /> ::'''3.3.2.''' The Price Does Not Break the TL. <br /> ::In this case, this model is classified as built through t.3 (absolute extreme). The program proceeds to step 4, or to sub-step 3.3.ext. if current algorithm line is coming from 3.2.<br /> <br /> <br /> ::'''3.3.ext. Additional Trend Line Construction Through t.5&quot;.'''<br /> ::If:<br /> ::*The t.5 bar does not exceed the range of t.4;<br /> ::*At the time of model calculation, the level of t.4 is confirmed, then this model is checked for the possibility of constructing an additional Trend Line (TL) through t.5&quot;. Note: If t.4 is not confirmed, this model should be recalculated upon the appearance of a bar that confirms it's t.4.<br /> <br /> ::''' Definition: Point 5&quot; '''<br /> ::Point 5&quot; can lie in the segment between t.5 and the point confirming t.4. On this segment, a point is searched that meets the following requirements:<br /> <br /> ::''' Rule for Selecting Point 5&quot; High '''<br /> ::To the left of the bar containing t.5&quot;, the nearest high should be above the level of t.5.<br /> ::To the right of t.5&quot;, at least one nearest high should be below or equal to t.5. ::If the nearest high is equal to the level of t.5, then the next high should again be below or equal to the level of t.5, until at least one bar is strictly below the level of t.5.<br /> <br /> ::''' Rule for Selecting Point 5&quot; Low '''<br /> ::To the left of the bar containing t.5&quot;, the nearest low should be below the level of the extreme.<br /> ::To the right of t.5&quot;, at least one nearest low should be above or equal to t.5. If the nearest low is equal to the level of t.5, then the next low should again be above or equal to the level of t.5, until at least one bar is strictly above the level of t.5.<br /> <br /> ::''' Special Cases for Point 5&quot; '''<br /> ::Point 5&quot; may belong to a bar that has broken the level of t.4 (but only the first of such bars). If the bar of potential t.5&quot; breaks the level of calculated t.6 from t.5, then it is impossible to construct a TL through t.5&quot; for this model (this model does not contain such a point).<br /> <br /> :::'''3.3.ext.1.''' Additional TL Calculation <br /> :::If a bar is found that fits the rule for selecting 5&quot;, an additional TL is calculated for the potential t.5&quot; (hereafter TL&quot;). This line is checked for the absence of breaks in the segment from t.3/3'' to potential t.5&quot;.<br /> <br /> :::::'''3.3ext.1.a.''' If there is an intersection, the program moves to check the next bar as a potential t.5&quot;.<br /> <br /> :::::'''3.3ext.1.b.''' If there is no intersection, the found bar is compared with the previous candidate for t.5&quot; (if there was one in the previous iteration of the cycle). If the considered bar is closer to the level of t.4 than the candidate for t.5&quot;, then the considered bar becomes the new candidate for t.5&quot;.<br /> :::The check of bars continues in a cycle until a bar confirming t.4 is reached. If a candidate for t.5 is found as a result of the check, the program moves to sub-step 3.3ext.1.1; otherwise, it moves to step 4.<br /> ::::'''3.3ext.1.1.''' If the analyzed model is built through t.3', a candidate for t.3&quot; is sought in the segment t.3-t.3', through which such a line to t.5&quot; can be built that will not have price intersections in the segment t.3-t.3&quot;.<br /> :::::'''3.3ext.1.1.1.''' If a candidate for t.3&quot; is found, where there are no intersections, a check is made for the intersection of TL&quot; by the bar following t.5&quot;.<br /> ::::::'''3.3.ext.1.1.1.A.''' If there are intersections, t.5&quot; is declared canceled, and the next one is sought according to sub-step 3.3.ext.<br /> ::::::'''3.3.ext.1.1.1.B.''' Otherwise, the program moves to step 13.2.<br /> :::::'''3.3.ext.1.1.2.''' If a suitable t.3&quot; is not found, a re-search for a candidate for t.5&quot; is carried out according to sub-steps 3.3.ext., but in this case, if a candidate for t.5&quot; was found, it becomes a canceled candidate for t.5&quot;. The new candidate must already be further from t.4 than the previously discarded ones.<br /> ::::'''3.3ext.1.2.''' If the analyzed model is built through t.3, a check is made for the intersection of TL'' by the bar following t.5&quot;.<br /> :::::'''3.3ext.1.2.A.''' If there are intersections, t.5&quot; is declared as canceled t.5', and the next one is sought according to sub-step 3.3.ext.<br /> :::::'''3.3ext.1.2.B.''' If there are no intersections, the algorithm moves to step 13.2.<br /> :::'''3.3.ext.2.''' TL'' is checked for price intersections in the segment between t.5 (inclusive) and potential t.5&quot; (hereafter segment 5-5&quot;).<br /> ::::'''3.3.ext.2.1.''' If there is an intersection, then this 5&quot; is filtered out. A re-search for a candidate for t.5&quot; is carried out according to sub-steps 3.3.ext., but in this case, the new candidate must already be further from t.4 (in terms of time) than the previously discarded ones.<br /> ::::'''3.3.ext.2.2.''' If there are no intersections of TL&quot; in the segment 5-5&quot;, then t.5&quot; is found.<br /> ::::In this case, the report displays: EAM5&quot; EAM5&quot;<br /> ::::The program moves to step 4.<br /> ::::'''3.3.ext.2.3.''' If t.5&quot; is not found, the program moves to step 4.<br /> <br /> ==='''Step IV: Searching for Potential Foundation Blocks.'''===<br /> <br /> ====Initial Check====<br /> First, it is necessary to check for the presence of a fixed t.2. If it exists, it means we are in a branch for searching for alternative models.<br /> <br /> ::'''4.0.1.''' If t.2 is defined in the model, proceed to step 6.<br /> ::'''4.0.2.''' If t.2 is not defined, the program moves to step 4.1.<br /> ====Examination of Extremes====<br /> On the preceding trend, extremes are checked sequentially from right to left (i.e., into the past) from t.3 (or from another analyzed bar in repeated applications of this step) according to the N1 bar rule (as a candidate for t.2). Each found candidate for t.2 is checked for the presence of a confirming extreme (which also serves as t.1) according to the following algorithm:<br /> <br /> ::'''4.1.0.''' An extreme candidate for t.2 is found.<br /> ::'''4.1.1.''' The point of the last intersection &lt;ref&gt;High or low of a bar, repeating or crossing high or low of t.2 bar – is an intersection&lt;/ref&gt; of the candidate's level with the price is found. In this case, the program looks for the absolute maximum (if t.2 is a minimum, i.e., t.2 is low) or the absolute minimum (if t.2 is a maximum, i.e., t.2 is high) in the segment from the last intersection of the t.2 level with the price to t.2.<br /> :::'''4.1.1.1.''' Maximum/minimum not found. In this case, the program discards this candidate for t.2.<br /> :::'''4.1.1.2.''' Maximum/minimum found. In this case, the potential t.2 is confirmed.<br /> :::'''4.1.2.''' The program reaches the starting point of the chart.<br /> :::'''4.1.3.''' The check reaches the boundary of the Depth of Search for t.1 &lt;ref&gt;&quot;Search depth t.1 for EAM models&quot; is set in the Calculation Parameters. It is calculated in bars from the bar of the considered potential t.2. By default, this value is 50 bars.&lt;/ref&gt; for the model and none of the above events (4.1.1. or 4.1.2.) occurred.<br /> <br /> ::'''4.2.''' The search for Foundation Blocks (i.e., points 1 and 2, a.k.a FB) continues until one of the events in steps 4.2.A, 4.2.B or 4.2.C. occurs.<br /> :::'''4.2.A. The check reaches the bar containing the (presumed) starting point of the preceding trend (from sub-step 1.2.2.1.). This point is not considered as a potential t.2<br /> :::'''4.2.B.''' The check reaches the bar that intersects the level of the presumed point 4 of the considered model.<br /> :::'''4.2.C.''' A bar that is located at a distance (by time) from T.3 greater than or equal to X* (distance from T.3 to t.4), where x is the parameter set in the settings &lt;ref&gt; This is the &quot;Time Ratio of 23 to 24&quot;(by default it is 3)&lt;/ref&gt;.<br /> ::=== Results ===<br /> ::As a result of the search for potential t.2 (i.e., upon the occurrence of4.2.A, 4.2.B or 4.2.C.), two scenarios are possible:<br /> :::'''4.2.1. ''' One or more pairs of potential t.2 and t.1 are found (potential Foundation Blocks). The program moves to step 5.<br /> :::'''4.2.2. ''' No potential Foundation Blocks are found. In this case, the program looks for the next potential t.5 according to step 2.<br /> <br /> === '''Step V. Search for Presupposition''' ===<br /> Presupposition is an optional part of the EAM.<br /> The program attempts to construct Presuppositions from all available candidates for t.2.<br /> <br /> ==== Presupposition Search Algorithm ====<br /> The program takes each potential t.2 of the EAM (as part of a potential FB) as a t.1 of Presupposition (hereinafter t.1p). In other words, the program tries to construct Presuppositions from each of the t.2.<br /> <br /> Initially, the most recent (rightmost) potential t.2 (or the one specified in the algorithm if we have returned to the beginning of the Step V in the cycle) in the EAM is taken as a potential t.1p. If there are no more unconfirmed t.1p, the algorithm proceeds to Step 6.<br /> <br /> : '''5.1.''' The program sequentially checks bars from left to right (into the future) from the potential t.1p to t.3 of EAM model (excluding t.3) for being an extreme according to the N1 rule as point 3 of the Presupposition (hereinafter t.3p).<br /> <br /> : '''N1 rule for the Presupposition points'''<br /> : If t.1p is low, t.3p must be below t.1p.<br /> : If t.1p is high, t.3p must be above t.1p.<br /> <br /> :: '''5.1.1.''' If the potential t.3p is not found, the program considers the next (to the left of the previous) potential t.2 of the EAM (within the FB) as t.1p.<br /> :: If the potential t.3p is not found, and there are no more potential FBs, the algorithm proceeds to Step 6.<br /> :: '''5.1.2.''' Once the potential t.3p is found, the program searches for point 2 of the Presupposition (hereinafter t.2p) as an extreme with the maximum/minimum price on the segment from t.1p to t.3p (hereinafter segment 1p-3p).<br /> :: If a suitable extreme is not found, the algorithm looks for the next potential t.3p for the previously found t.1p.<br /> :: If a maximum/minimum is found, it is checked for for being an extreme (as t.2p).<br /> :: There are two possibilities:<br /> ::: '''5.1.2.1.''' The bar is an absolute extreme. In this case, a potential t.2p is found, and the program proceeds to step 5.2.<br /> ::: '''5.1.2.2.''' The bar is not an extreme. In this case, the program looks for another candidate for t.3p for the previously found t.1p following the instructions in 5.1.<br /> : '''5.2.''' The program constructs a line from t.1p to t.3p and checks it for price crossings on the segment from t.1p to t.3 of the EAM (including t.3 of EAM).<br /> :: '''5.2.1.''' If this lines price crossings are found, the program looks for a new candidate for t.3p for the previously found t.1p following the instructions in sub-step 5.1.<br /> :: '''5.2.2.''' If there are no price crossings, the program proceeds to sub-step 5.3.<br /> <br /> : '''5.3.''' The program searches for a potential point 4 of the Presupposition (t.4p) according to the N1 rule on the segment from t.3p to t.3 in the VMP (including t.3).<br /> <br /> : If t.1p is low, t.4p must be below t.2p. Each subsequent candidate for t.4p must be below the previous candidate for t.4p.<br /> : If t.1p is high, t.4p must be above t.2p. Each subsequent candidate for t.4p must be above the previous candidate for t.4p.<br /> : Possible scenarios:<br /> :: '''5.3.A.''' If the potential t.4p coincides with t.3 in the EAM, t.4p is confirmed (found), and the program proceeds to sub-step 5.3.1.<br /> :: '''5.3.B.''' If the potential t.4p does not coincide with t.3 in the EAM (i.e., it is located before it), the program looks for an opposite-direction potential t.4p extreme on the segment from the potential t.4p (excluding it) to the bar where the price again reached the value of the potential t.4p (excluding it).<br /> <br /> :: There are two possibilities:<br /> ::: '''5.3.B.1.''' If the opposite-direction extreme is found, t.4p is confirmed (found), and the program proceeds to sub-step 5.3.1.<br /> ::: '''5.3.B.2.''' If the opposite-direction extreme is not found, the program looks for a new potential t.4p following the instructions in sub-step 5.3.1.<br /> :: '''5.3.1.''' If t.4p is found, the program constructs a line from t.2p to t.4p and checks it for price crossings on the segment from t.1p (excluding it) to t.3 in the VMP (including t.3).<br /> ::: If unnecessary intersections are found, the program looks for the next potential t.4p on the segment following the instructions in 5.3.<br /> ::: If no unnecessary intersections are found, the algorithm proceeds to sub-step 5.4.<br /> :: '''5.3.2.''' Check for Absolute Level<br /> :: The program checks the bar of the potential t.3p for absoluteness. The level of t.3p should not be exceeded by the price on the segment between t.3p and potential t.4p (excluding it).<br /> ::: '''5.3.2.1.''' If the level of t.3p is exceeded, the potential t.3p is discarded, and the program looks for a new t.3p following the instructions in sub-step 5.1. and further according to the algorithm.<br /> <br /> :::: '''5.3.2.2.''' If the level of t.3p is not exceeded, t.3p is confirmed, t.4p is confirmed, and the algorithm proceeds to sub- step 5.4.<br /> <br /> ==== Presupposition Verification ====<br /> : ''' 5.4.''' Presuppositions undergo the following checks:<br /> :: '''A.''' - Bars t.1p, t.2p, t.3p must follow each other.<br /> :: '''B.''' - The distance in levels between t.1 and t.2 (hereinafter rank 12) must be at least the value of the Minimum Distance between t.1 and t.2 Levels of the Presupposition, which is set in the Calculation Parameters, from the distance between t.4 and t.5 levels of the EAM model(this is rank 45).<br /> <br /> :: If all checks are successful, the Presupposition is found. If there are no unchecked t.1p left, the algorithm proceeds to Step 6.<br /> <br /> :: If there are no unchecked t.1p left, the algorithm proceeds to Step 6.<br /> <br /> === '''Step VI. Check for AL price crossings''' ===<br /> <br /> ==== '''6 alfa.''' ==== <br /> First it is necessary to check for the presence of a fixed t.2. If it exists, it means we are in a branch of searching for alternative models. <br /> <br /> The potential Aims Line (from t.2 to t.4), hereinafter referred to as AL, is calculated, and then:<br /> : '''6 alfa.1.''' AL Crossing Check<br /> <br /> :: '''6 alfa.1. A.''' - If there are no AL price crossings, the algorithm proceeds to step 6 alfa.2.<br /> :: '''6 alfa.1. B.''' - If AL is crossed, the next potential t.5 is determined according to Step 2, starting from bar t.5+2.<br /> : '''6.2. alfa.''' Distance Check for AL and TL Intersection<br /> : If:<br /> :: - TL and AL of the model do not intersect on the right (in the future) or<br /> :: - the ratio of the distance in bars between t.2 and t.4 to the distance between t.4 and the calculated point 6 is less than the default value of the parameter &quot;Minimum ratio of t.2-t.4 to t.4-t.6 EAM,&quot; then the search for alternative models is terminated. Otherwise, the program proceeds to Step 9. <br /> <br /> ====''' In the general case (no precviously fixed t.2)''' ====<br /> The program performs the following checks for each of the potential FBs:<br /> : '''6.1.''' AL Price Crossing Check (not just touching)<br /> : If AL intersects with the price on the segment between t.2 and t.4, this pair of candidates for t.1 and t.2 (this FB) is rejected.<br /> :: '''6.1.A.''' If FBs are found that give AL without intersections, the algorithm proceeds to step 6.2.<br /> :: '''6.1.B.''' If there are no suitable FBs, the algorithm looks for a new t.5 according to Step 2.<br /> <br /> : '''6.2.''' Checking for intersection of AL and TL (hereinafter referred to as calculated point 6) with each other on the right (in the future) along the time axis.<br /> : If the ratio of the distance in bars between t.2 and t.4 to the distance between t.4 and the calculated t.6 is less than the default value of the parameter &quot;Minimum ratio of t.2-t.4 to t.4-t.6 VMP,&quot; then these candidates for t.1 and t.2 are rejected.<br /> : The following scenarios are possible:<br /> :: '''6.2.A.''' One or several potential FBs remain - in this case, the program proceeds to Step 7.<br /> :: '''6.2.B.''' There are no potential FBs left - in this case, the program looks for a new potential t.5, starting from Step 2 and onwards.<br /> <br /> === '''Step VII. Dtermintaion of FB's with and without 2X5''' ===<br /> <br /> The program checks for the intersection of the bodies of candles at t.2 and t.5 (hereinafter referred to as 2x5). If there is only one potential FB, determining FB with 2x5 is not required, and the program proceeds to Step 8.<br /> <br /> :'''7.1.''' If there are multiple potential BOs, some of which have 2x5 and some do not, those potential BOs that have 2x5 are filtered out, and the program proceeds to Step 8.<br /> <br /> :'''7.2.''' If all potential FBs have 2x5, then all are filtered out except the one whose t.2 level is closer to the t.3 level. The program proceeds to <br /> <br /> === '''Step VIII: Filtering Based on Presupposition''' ===<br /> <br /> The algorithm checks whether Presuppositions have been found for the analyzed model.<br /> <br /> :'''8.0.''' If no Presuppositions are found, the program proceeds to Step 9.<br /> <br /> :'''8.1.''' The model has one or more Presuppositions. For each Presupposition program checks if the available candidates for t.2 belong to the interval between the last price level intersection of t.1p and t.1p itself (t.1p can also be used as t.2 EAM).<br /> <br /> ::'''8.1.1.''' There are candidates for t.2 that belong to the interval between the last price level intersection of t.1p and t.1p itself. Such a Presupposition is retained.<br /> ::'''8.1.2.''' There are no candidates for t.2 within the specified interval. In this case, such a Presupposition is discarded and not further considered (meaning the model has no Presupposition).<br /> :'''8.2.''' If after checking all Presuppositions according to sub-step 8.1., there are one or more Presuppositions with candidates in t.2 within the interval between the last price level intersection of t.1p and t.1p itself (inclusive), then:<br /> <br /> : - Among such Presuppositions, only the one with t.1p occurring later on the time axis is considered further;<br /> : - Only those candidates that belong to the interval between the last price level intersection of t.1p and t.1p itself are retained as t.2 candidates for the remaining Presupposition.<br /> ::'''8.2.1.''' If only one potential FB remains, the model is confirmed.<br /> ::'''8.2.2.''' If more than one potential FB remains, the program proceeds to Step 9.<br /> <br /> === '''Step IX. Search for Embedded Models in EAM''' ===<br /> <br /> :'''9.1.''' If EAM is constructed through t.3', then the interval from EAM's t.3 is checked for the presence of models according to Algorithm I, for which the following conditions are simultaneously satisfied. In the paragraph below, the numbers I and II in parentheses next to the model points denote the algorithm to which the model with this point belongs:<br /> <br /> : - If the model according to Algorithm I contains t.5, then its t.5 should precede or coincide with the t.5 of the analyzed EAM.<br /> : - t.4 does not lie beyond t.4 of the analyzed EAM; (bar of t.4(I) cannot coincide with bar of t.3(II), but can coincide with bar of t.4(II);<br /> : -t.1 lies before t.3' of the analyzed model (if it coincides with bar of t.3', then it is not suitable anymore) (t.1(I) can coincide with t.3(II), but cannot coincide with t.3'(II)<br /> <br /> If there are more than 5 models, those with the time distance from t.1 to t.4 greater than others are considered embedded models.<br /> <br /> ::'''9.1.1.''' If models are not found, then EAM does not have an embedded primary model.<br /> <br /> ::'''9.1.2.''' If the model/s is/are found, EAM is given the status of &quot;Models described near the Primary model.&quot;<br /> <br /> ::'''9.1.3.''' If EAM has one or more embedded models, models among them built from EAM's t.3 are searched for meeting one of the following criteria:<br /> <br /> ::: A. Having a trendline breakthrough in the interval before t.3' of the analyzed model;<br /> ::: B. Having an intersection of candle bodies at points 2 and 5 (hereinafter 2x5).<br /> ::: C. If the embedded model has a rank 45 greater than the ranks of 12 and 25 of the same model.<br /> ::: '''9.1.3.1.''' In the presence of one of these criteria, the model is Specific based on the 1st criterion.<br /> ::: '''9.1.3.2.''' In the absence of the specified criteria, the model is Normal based on the 1st criterion.<br /> <br /> :: '''9.1.4.''' If there is a model according to Algorithm I on the interval from t.3 to t.3' of the EAM, aligned with the preceding EAM trend, and with points t.1-t.4 lying on the interval 3-3' EAM (inclusive), then this EAM is Specific based on the 2nd criterion. <br /> :: In the absence of the specified criteria, the model is Normal based on the 2nd criterion.<br /> <br /> : Upon completion of all checks in step 9.1., the program proceeds to step 10.<br /> <br /> :'''9.2.''' If EAM is constructed through t.3, the program proceeds to step 10.<br /> <br /> === '''Step X. Search for Preceding Models''' ===<br /> <br /> The program identifies all possible models in accordance with Algorithm I, starting from the initial point of the preceding trend or starting from the presumed initial point of the preceding trend, see step 1.3.).<br /> In these models, the actual t.6 is determined, and if there was no intersection of TL, the Presumed t.6 (P6supp) is used. The algorithm for finding the actual/presumed t.6 is described in the branch of Algorithm I, see substep 5.3.<br /> <br /> Models on the preceding trend, with TL coinciding with t.3 of the EAM, are (directly) preceding for the given TL.<br /> <br /> Models on the preceding trend, for which the following conditions are simultaneously satisfied:<br /> : - actual/presumed t.6 precedes or equals t.3 of the EAM;<br /> : - t.6 is aligned with t.4 of the EAM;<br /> : - the level of t.6 lies between the levels of t.3 and t.4 of the EAM;<br /> are considered preceding corrective for the given EAM.<br /> <br /> From models with the same t.4 and the same t.1, the model with the later t.1 is selected as the priority for choosing t.2.<br /> <br /> From the remaining models with the same t.4, only the very last model is considered as both preceding and preceding corrective (i.e., with a later t.5 or without t.5) – one of each type.<br /> <br /> If there are more than 10 preceding and preceding corrective models (rarely encountered), only the last ones are selected (the last ones are determined as those with t.4 lying later than others).<br /> <br /> === '''Step XI. Final Selection of t.2 - Checking the Convergence of LT and LC''' ===<br /> <br /> :'''11.0.''' If t.2 is known (for example, in the case algorythm is searching for an alternative model), proceed directly to sub-step 11.3.<br /> <br /> ::'''11.0.1.''' The program finds the closest (in terms of time from t.1 of these models to t.3 of EAM) linked model on the preceding trend (preceding or preceding corrective).<br /> :::'''11.0.1.1.''' If<br /> :::: - the closest preceding model is a model from the beginning of the trend, and<br /> :::: - t.2 of the analyzed model is before or coincides with t.1 of the preceding model, then the considered t.2 is rejected, and this branch of the algorithm is terminated.<br /> :::'''11.0.1.2.''' If<br /> :::: - the closest preceding model is a trend model, and<br /> :::: - t.2 of the analyzed model is before t.1 of the preceding model,<br /> ::: the considered t.2 is rejected, and this branch of the algorithm is terminated.<br /> <br /> If EAM contains a presupposition, the program proceeds to sub-item 11.2. If the model does not contain a presupposition, the program proceeds to sub-item 11.1.<br /> <br /> :'''11.1.''' The program finds the closest (in terms of time from t.1 of these models to t.3 of EAM) linked model on the preceding trend (preceding or preceding corrective).<br /> ::'''11.1.0.''' If there are no preceding models, the program proceeds to sub-step 11.2.<br /> ::'''11.1.1.''' If the nearest found linked model (preceding or preceding corrective) is a model from the beginning of the trend (not a trend model), then all potential t.2 that coincide with the bar of t.1 of the found linked model or are located before t.1 of the found linked model are rejected. The program proceeds to sub-step 11.2.<br /> ::'''11.1.2.''' If the nearest found linked model (preceding or preceding corrective) is a trend model, then<br /> :::'''11.1.2.1.''' In the presence of a preceding trend model, all t.2 that are located before t.1 of the preceding model are rejected. In other words, t.1 of the preceding can be t.2 of EAM, and the points located before t.1 of the preceding - cannot be t.2 of EAM. The program proceeds to sub-step 11.2.<br /> :::'''11.1.2.2.''' In the presence of a preceding corrective trend model, the program looks for another linked model on the preceding trend of EAM (the next in terms of distance) and analyzes it as a reference for this item (11.1.). In other words, the program returns to the beginning of sub-step 11.1.<br /> <br /> ::'''11.2.1.''' For specific models, the program selects the most distant t.2 in terms of time from t.3.<br /> ::'''11.2.2.''' For simple models, the program selects t.2 that is as close as possible in time to t.3.<br /> <br /> :'''11.3.''' The algorithm calculates the level of intersection of TL and AL of EAM (hereinafter – the calculated t.6). The position of t.5 in relation to the level of the calculated t.6 is checked. There are two possible scenarios:<br /> ::'''11.3.1.''' If the bar of t.5 does not penetrate the level of the calculated t.6, the program checks if t.5'' has been found (in sub-step 13). Two scenarios are possible:<br /> :::'''11.3.1.1.''' If t.5'' has been found, then the program checks for the convergence of TL'' and AL. <br /> ::::'''11.3.1.1.А.''' If the lines converge, then the program checks for the extent of convergence of TL'' and AL. If the ratio of the distance in bars between t.2 and t.4 to the distance between t.4 and the calculated t.6'' is less than the default value of the parameter &quot;Minimum ratio of t.2-t.4 to t.4-t.6 EAM&quot;, then t.5'' is rejected.<br /> ::::'''11.3.1.1.Б.''' If TL'' and AL diverge, then t.5'' is rejected.<br /> Regarding the entire sub-step 11.3.1.1. - the program records the model.<br /> <br /> :::'''11.3.1.2.''' If t.5'' is absent, the program records the model.<br /> <br /> ::'''11.3.2.''' If the bar of t.5 penetrates the level of the calculated t.6, then this EAM cannot be built, and the program looks for a new t.5 by processing the bar following the bar of t.5 according to sub-step 2 and further according to the algorithm.<br /> <br /> ==References==<br /> &lt;references /&gt;</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_II&diff=209 2024-01-04T08:51:33Z

<p>Admin: /* Step X. Search for Preceding Models (EAM) */</p> <hr /> <div>This article is not finished<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with UMG General Concepts.<br /> <br /> ==='''Step I. Search For Point 3 of the External Attraction Model (EAM) and the Sarting Point of the Previous Trend.'''===<br /> : '''1.1.''' The program looks for the first possible extreme, satisfying Single Bar Rule. Such an extreme is a candidate for potential point 3 ( potential t.3).<br /> : '''1.2.''' Next, the program checks the bars from right to left (i.e., in the past) from the bar containing the extreme candidate for point 3 to one of the following events:<br /> :: '''1.2.1.''' Found the last intersection (breakthrough) point by the price level of the candidate for point 3.<br /> ::In this case, the report displays: <br /> :: PREVdata: FullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.2.''' The program reached the starting point of the chart (i.e., the price did not intersect the level of point 3 after the starting point of the chart).<br /> ::In this case, the report displays: <br /> :: PREVdata: NoFullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.3.''' The price checked 300 bars preceding point 3 &lt;ref&gt;The depth of the search for the extreme confirming point 3 of EAM model&lt;/ref&gt;, but the level of step 3 did not intersect at this segment. The program looks for an absolute extreme (opposite to step 3) on the segment from the 300th bar before point 3 to point 3. The program proceeds to substep 1.3.<br /> : '''1.3.''' The program looks for an absolute extreme (opposite to point 3 extreme) on the segment:<br /> ::- from the last intersection by the price level of the candidate for point 3 (inclusive) (if came from 1.2.1.), or <br /> :: - from the starting point of the chart (if came from 1.2.2.), or <br /> :: - from 300 bars(if came from 1.2.3.) <br /> :: to point 3 (excluding).<br /> :: '''1.3.1.''' Absolute extreme found. The candidate for point 3 is confirmed; moreover, the found confirming extreme is the assumed (if coming from 1.2.2. or 1.2.3.) starting point of the preceding trend.'''<br /> ::The program checks for the absence of extremes equal to point 3 between the assumed starting point of the previous trend and point 3. <br /> :::'''1.3.1.1.''' If such an extreme is found, this candidate for point 3 is discarded, and this point 3 is discarded. <br /> :::'''1.3.1.2.''' If such an extreme is not found, the program proceeds to step 2.<br /> ::'''1.3.2.''' Absolute extreme not found. This point 3 is discarded.'''<br /> ::Simultaneously with step 1, the program launches the search for the next potential point 3.<br /> <br /> ==='''Step II. Search For Potentioal Points 5 and 4 ''' ===<br /> '''The Orientation rule (N1 requirement) for Algorithm II is as follows:'''<br /> If point 3 is low, then the level of point 5 should be higher than point 3. <br /> If point 3 is high, then the level of point 5 should be lower than point 3.<br /> '''Search for Point 5.''' The bar following the bar of Point 3 (and in repeated applications of this step - the bar specified in this algorithm) is checked for not overcoming the level of point 3 (since N1 requirement for Algorithm II must be observed).<br /> :'''2.1.''' If the price has overcome the level of point 3, the program discards the considered step 3 (due to N1 requirement).<br /> :'''2.2.''' If N1 requirement is met for the analyzed bar, it is checked for compliance with N1 requirement as a potential point 5 (hereafter - point 5 or t.5).<br /> ::'''2.2.1.''' If the analyzed bar is not an extreme according to N1 requirement (as a potential point 5), the program checks the next bar from the beginning of step 2.<br /> ::'''2.2.2.''' If the analyzed bar is determined as an extreme according to N1 requirement (as a potential point 5), then this bar is checked for reaching (but not necessarily overcoming) the level of point 3. There are 2 options:<br /> :::'''2.2.2.1.''' If the level of point 3 is reached, the program analyzes the next bar according to this step (i.e., from the beginning of step 2).<br /> :::'''2.2.2.2.''' If the level of point 3 is not reached, the analyzed bar is a potential point 5, and the program moves to substep 2.3.<br /> :'''2.3. Search for Point 4.''' The program searches for a bar, which was the last to cross the level of the considered potential point 5. Let's denote this bar as lcb5 (line-crossing-bar-5). If lcb5 coincides with the bar of point 3, we denote the bar following lcb5 as look4. Otherwise, look4 = lcb5. The program searches for a bar with the maximum (if point 3 is low) or minimum (if point 3 is high) price in the interval from lcb5 to potential point 5. Then this bar is checked for being an extreme according to N1 requirement as a potential pont 4 (hereafter – point 4 or t.4). There are 2 options:<br /> ::'''2.3.1.''' The bar is an absolute extreme (as a potential point 4). In this case, potential point 4 is found.<br /> :::'''2.3.1.1.''' If step 2 has already been determined (this is possible when this step is triggered during the search for an alternative model), the program checks the line chart for extra points in the section from step 2 to step 4. There are 2 options:<br /> ::::'''2.3.1.1.A.''' If extra points are found, the program processes the next bar after potential point 5 according to step 2.<br /> ::::'''2.3.1.1.B.''' Extra intersections are not found; the program moves to substep 2.4.<br /> :::'''2.3.1.2.''' If substep 2.3.1. is triggered during the search for the basic model, the program moves to substep 2.4.<br /> ::'''2.3.2.''' The bar is not an absolute extreme (as a potential point 4). In this case, the program looks for another candidate for point 5 according to this step (i.e., according to step 2).<br /> If the program has processed 50 bars in a row according to this step (step 2), and the program has not moved to another step of the algorithm, then this potential point 3 is discarded.<br /> If there are 150 or more bars&lt;ref&gt;Continuous search range of t.5 in one iteration for EAM model&lt;/ref&gt; between potential point 3 and the analyzed bar, and potential points 4 and 5 are not found, then this potential point 3 is discarded.<br /> :'''2.4.''' Real-Time Verification of t.5 <br /> :The potential t.5 bar is checked for the presence of bars between the analyzed bar and the potential t.4 bar, which contain price values more distant (or even equally distant) from the potential t.4 than the most distant from t.4 value of the analyzed bar. This is a check of the potential t.5 for beeing the '''potential absolute extreme'''. The following options are possible:<br /> ::'''2.4.1.''' If the extreme is potentially absolute, the program proceeds to step 3.<br /> ::'''2.4.2.''' If the extreme is not potentially absolute, the program checks the next bar starting from this step (i.e., step 2).<br /> <br /> ===''' Step III. Confirmation of Point 4. Searching for Alternative t.5 and t.5&quot; '''===<br /> The program checks whether the bar of potential t.5 has reached the level of t.4. Two scenarios are possible:<br /> :'''3.1.''' The Bar of Potential t.5 Has Reached t.4.<br /> :In this case:<br /> ::The model is built through absolute t.5.<br /> ::The t.5 bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> ::Point 4 is confirmed,<br /> ::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3 (since there is already possible to display the model through t.5 on the chart).<br /> :'''3.2.''' The Bar of Potential t.5 Has Not Reached t.4. <br /> :In this case, the program checks the next bar for reaching the level of t.4. The following options are possible:<br /> ::'''3.2.1. The Considered Bar Reaches the Level of Potential t.4. <br /> ::In this case:<br /> :::The model is built through absolute t.5.<br /> :::The considered bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> :::Point 4 is confirmed,<br /> :::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3.ext, but first goes through sub-step 3.3.<br /> ::'''3.2.2.''' The Considered Bar Does Not Reach the Level of t.4.<br /> ::In this case the program checks the next bar for overcoming the level of potential t.5. Two scenarios are possible:<br /> :::'''3.2.2.1.''' If the t.5 level is overcome, the analyzed bar is considered as a new potential t.5. The program processes this bar according to step 2.<br /> :::'''3.2.2.2.''' If the t.5 level is not overcome, the analyzed bar is checked for reaching the level of t.4 according to sub-step 3.2.<br /> ::In parallel (i.e., an additional branch is created), the program proceeds to sub-step 3.3 (since there is already an option to display the model through t.5 on the chart). The model in this branch receives a &quot;draw_flag&quot; label.<br /> :'''3.3.''' Construction of the Trend Line (TL). <br /> :A Trend Line (TL) is constructed from t.3 to t.5. Each bar between t.3 and t.5 is checked for breaking the TL. Two scenarios are possible:<br /> ::'''3.3.1.'''The Price Crosses the TL. <br /> ::In this case, the TL through t.3 is not constructed. The program searches for a candidate for point 3' (hereafter - t.3'). T.3' is selected in such a way that the TL' (constructed from t.3' to t.5) is not crossed by the price in the 3-5 segment. Rule No.1 for t.3' is not applied. T.3' cannot belong to the same bar as t.4. Two scenarios are possible:<br /> :::'''3.3.1.1.''' T.3' is found, this model is classified as built through t.3'. The program proceeds to step 4, or to sub-step 3.3.extended if coming from 3.2.<br /> :::'''3.3.1.2.''' T.3' is not found. In this case, the program searches for new potential t.5 and t.4 according to step 2.<br /> ::'''3.3.2.''' The Price Does Not Break the TL. <br /> ::In this case, this model is classified as built through t.3 (absolute extreme). The program proceeds to step 4, or to sub-step 3.3.ext. if current algorithm line is coming from 3.2.<br /> <br /> <br /> ::'''3.3.ext. Additional Trend Line Construction Through t.5&quot;.'''<br /> ::If:<br /> ::*The t.5 bar does not exceed the range of t.4;<br /> ::*At the time of model calculation, the level of t.4 is confirmed, then this model is checked for the possibility of constructing an additional Trend Line (TL) through t.5&quot;. Note: If t.4 is not confirmed, this model should be recalculated upon the appearance of a bar that confirms it's t.4.<br /> <br /> ::''' Definition: Point 5&quot; '''<br /> ::Point 5&quot; can lie in the segment between t.5 and the point confirming t.4. On this segment, a point is searched that meets the following requirements:<br /> <br /> ::''' Rule for Selecting Point 5&quot; High '''<br /> ::To the left of the bar containing t.5&quot;, the nearest high should be above the level of t.5.<br /> ::To the right of t.5&quot;, at least one nearest high should be below or equal to t.5. ::If the nearest high is equal to the level of t.5, then the next high should again be below or equal to the level of t.5, until at least one bar is strictly below the level of t.5.<br /> <br /> ::''' Rule for Selecting Point 5&quot; Low '''<br /> ::To the left of the bar containing t.5&quot;, the nearest low should be below the level of the extreme.<br /> ::To the right of t.5&quot;, at least one nearest low should be above or equal to t.5. If the nearest low is equal to the level of t.5, then the next low should again be above or equal to the level of t.5, until at least one bar is strictly above the level of t.5.<br /> <br /> ::''' Special Cases for Point 5&quot; '''<br /> ::Point 5&quot; may belong to a bar that has broken the level of t.4 (but only the first of such bars). If the bar of potential t.5&quot; breaks the level of calculated t.6 from t.5, then it is impossible to construct a TL through t.5&quot; for this model (this model does not contain such a point).<br /> <br /> :::'''3.3.ext.1.''' Additional TL Calculation <br /> :::If a bar is found that fits the rule for selecting 5&quot;, an additional TL is calculated for the potential t.5&quot; (hereafter TL&quot;). This line is checked for the absence of breaks in the segment from t.3/3'' to potential t.5&quot;.<br /> <br /> :::::'''3.3ext.1.a.''' If there is an intersection, the program moves to check the next bar as a potential t.5&quot;.<br /> <br /> :::::'''3.3ext.1.b.''' If there is no intersection, the found bar is compared with the previous candidate for t.5&quot; (if there was one in the previous iteration of the cycle). If the considered bar is closer to the level of t.4 than the candidate for t.5&quot;, then the considered bar becomes the new candidate for t.5&quot;.<br /> :::The check of bars continues in a cycle until a bar confirming t.4 is reached. If a candidate for t.5 is found as a result of the check, the program moves to sub-step 3.3ext.1.1; otherwise, it moves to step 4.<br /> ::::'''3.3ext.1.1.''' If the analyzed model is built through t.3', a candidate for t.3&quot; is sought in the segment t.3-t.3', through which such a line to t.5&quot; can be built that will not have price intersections in the segment t.3-t.3&quot;.<br /> :::::'''3.3ext.1.1.1.''' If a candidate for t.3&quot; is found, where there are no intersections, a check is made for the intersection of TL&quot; by the bar following t.5&quot;.<br /> ::::::'''3.3.ext.1.1.1.A.''' If there are intersections, t.5&quot; is declared canceled, and the next one is sought according to sub-step 3.3.ext.<br /> ::::::'''3.3.ext.1.1.1.B.''' Otherwise, the program moves to step 13.2.<br /> :::::'''3.3.ext.1.1.2.''' If a suitable t.3&quot; is not found, a re-search for a candidate for t.5&quot; is carried out according to sub-steps 3.3.ext., but in this case, if a candidate for t.5&quot; was found, it becomes a canceled candidate for t.5&quot;. The new candidate must already be further from t.4 than the previously discarded ones.<br /> ::::'''3.3ext.1.2.''' If the analyzed model is built through t.3, a check is made for the intersection of TL'' by the bar following t.5&quot;.<br /> :::::'''3.3ext.1.2.A.''' If there are intersections, t.5&quot; is declared as canceled t.5', and the next one is sought according to sub-step 3.3.ext.<br /> :::::'''3.3ext.1.2.B.''' If there are no intersections, the algorithm moves to step 13.2.<br /> :::'''3.3.ext.2.''' TL'' is checked for price intersections in the segment between t.5 (inclusive) and potential t.5&quot; (hereafter segment 5-5&quot;).<br /> ::::'''3.3.ext.2.1.''' If there is an intersection, then this 5&quot; is filtered out. A re-search for a candidate for t.5&quot; is carried out according to sub-steps 3.3.ext., but in this case, the new candidate must already be further from t.4 (in terms of time) than the previously discarded ones.<br /> ::::'''3.3.ext.2.2.''' If there are no intersections of TL&quot; in the segment 5-5&quot;, then t.5&quot; is found.<br /> ::::In this case, the report displays: EAM5&quot; EAM5&quot;<br /> ::::The program moves to step 4.<br /> ::::'''3.3.ext.2.3.''' If t.5&quot; is not found, the program moves to step 4.<br /> <br /> ==='''Step IV: Searching for Potential Foundation Blocks.'''===<br /> <br /> ====Initial Check====<br /> First, it is necessary to check for the presence of a fixed t.2. If it exists, it means we are in a branch for searching for alternative models.<br /> <br /> ::'''4.0.1.''' If t.2 is defined in the model, proceed to step 6.<br /> ::'''4.0.2.''' If t.2 is not defined, the program moves to step 4.1.<br /> ====Examination of Extremes====<br /> On the preceding trend, extremes are checked sequentially from right to left (i.e., into the past) from t.3 (or from another analyzed bar in repeated applications of this step) according to the N1 bar rule (as a candidate for t.2). Each found candidate for t.2 is checked for the presence of a confirming extreme (which also serves as t.1) according to the following algorithm:<br /> <br /> ::'''4.1.0.''' An extreme candidate for t.2 is found.<br /> ::'''4.1.1.''' The point of the last intersection &lt;ref&gt;High or low of a bar, repeating or crossing high or low of t.2 bar – is an intersection&lt;/ref&gt; of the candidate's level with the price is found. In this case, the program looks for the absolute maximum (if t.2 is a minimum, i.e., t.2 is low) or the absolute minimum (if t.2 is a maximum, i.e., t.2 is high) in the segment from the last intersection of the t.2 level with the price to t.2.<br /> :::'''4.1.1.1.''' Maximum/minimum not found. In this case, the program discards this candidate for t.2.<br /> :::'''4.1.1.2.''' Maximum/minimum found. In this case, the potential t.2 is confirmed.<br /> :::'''4.1.2.''' The program reaches the starting point of the chart.<br /> :::'''4.1.3.''' The check reaches the boundary of the Depth of Search for t.1 &lt;ref&gt;&quot;Search depth t.1 for EAM models&quot; is set in the Calculation Parameters. It is calculated in bars from the bar of the considered potential t.2. By default, this value is 50 bars.&lt;/ref&gt; for the model and none of the above events (4.1.1. or 4.1.2.) occurred.<br /> <br /> ::'''4.2.''' The search for Foundation Blocks (i.e., points 1 and 2, a.k.a FB) continues until one of the events in steps 4.2.A, 4.2.B or 4.2.C. occurs.<br /> :::'''4.2.A. The check reaches the bar containing the (presumed) starting point of the preceding trend (from sub-step 1.2.2.1.). This point is not considered as a potential t.2<br /> :::'''4.2.B.''' The check reaches the bar that intersects the level of the presumed point 4 of the considered model.<br /> :::'''4.2.C.''' A bar that is located at a distance (by time) from T.3 greater than or equal to X* (distance from T.3 to t.4), where x is the parameter set in the settings &lt;ref&gt; This is the &quot;Time Ratio of 23 to 24&quot;(by default it is 3)&lt;/ref&gt;.<br /> ::=== Results ===<br /> ::As a result of the search for potential t.2 (i.e., upon the occurrence of4.2.A, 4.2.B or 4.2.C.), two scenarios are possible:<br /> :::'''4.2.1. ''' One or more pairs of potential t.2 and t.1 are found (potential Foundation Blocks). The program moves to step 5.<br /> :::'''4.2.2. ''' No potential Foundation Blocks are found. In this case, the program looks for the next potential t.5 according to step 2.<br /> <br /> === '''Step V. Search for Presupposition''' ===<br /> Presupposition is an optional part of the EAM.<br /> The program attempts to construct Presuppositions from all available candidates for t.2.<br /> <br /> ==== Presupposition Search Algorithm ====<br /> The program takes each potential t.2 of the EAM (as part of a potential FB) as a t.1 of Presupposition (hereinafter t.1p). In other words, the program tries to construct Presuppositions from each of the t.2.<br /> <br /> Initially, the most recent (rightmost) potential t.2 (or the one specified in the algorithm if we have returned to the beginning of the Step V in the cycle) in the EAM is taken as a potential t.1p. If there are no more unconfirmed t.1p, the algorithm proceeds to Step 6.<br /> <br /> : '''5.1.''' The program sequentially checks bars from left to right (into the future) from the potential t.1p to t.3 of EAM model (excluding t.3) for being an extreme according to the N1 rule as point 3 of the Presupposition (hereinafter t.3p).<br /> <br /> : '''N1 rule for the Presupposition points'''<br /> : If t.1p is low, t.3p must be below t.1p.<br /> : If t.1p is high, t.3p must be above t.1p.<br /> <br /> :: '''5.1.1.''' If the potential t.3p is not found, the program considers the next (to the left of the previous) potential t.2 of the EAM (within the FB) as t.1p.<br /> :: If the potential t.3p is not found, and there are no more potential FBs, the algorithm proceeds to Step 6.<br /> :: '''5.1.2.''' Once the potential t.3p is found, the program searches for point 2 of the Presupposition (hereinafter t.2p) as an extreme with the maximum/minimum price on the segment from t.1p to t.3p (hereinafter segment 1p-3p).<br /> :: If a suitable extreme is not found, the algorithm looks for the next potential t.3p for the previously found t.1p.<br /> :: If a maximum/minimum is found, it is checked for for being an extreme (as t.2p).<br /> :: There are two possibilities:<br /> ::: '''5.1.2.1.''' The bar is an absolute extreme. In this case, a potential t.2p is found, and the program proceeds to step 5.2.<br /> ::: '''5.1.2.2.''' The bar is not an extreme. In this case, the program looks for another candidate for t.3p for the previously found t.1p following the instructions in 5.1.<br /> : '''5.2.''' The program constructs a line from t.1p to t.3p and checks it for price crossings on the segment from t.1p to t.3 of the EAM (including t.3 of EAM).<br /> :: '''5.2.1.''' If this lines price crossings are found, the program looks for a new candidate for t.3p for the previously found t.1p following the instructions in sub-step 5.1.<br /> :: '''5.2.2.''' If there are no price crossings, the program proceeds to sub-step 5.3.<br /> <br /> : '''5.3.''' The program searches for a potential point 4 of the Presupposition (t.4p) according to the N1 rule on the segment from t.3p to t.3 in the VMP (including t.3).<br /> <br /> : If t.1p is low, t.4p must be below t.2p. Each subsequent candidate for t.4p must be below the previous candidate for t.4p.<br /> : If t.1p is high, t.4p must be above t.2p. Each subsequent candidate for t.4p must be above the previous candidate for t.4p.<br /> : Possible scenarios:<br /> :: '''5.3.A.''' If the potential t.4p coincides with t.3 in the EAM, t.4p is confirmed (found), and the program proceeds to sub-step 5.3.1.<br /> :: '''5.3.B.''' If the potential t.4p does not coincide with t.3 in the EAM (i.e., it is located before it), the program looks for an opposite-direction potential t.4p extreme on the segment from the potential t.4p (excluding it) to the bar where the price again reached the value of the potential t.4p (excluding it).<br /> <br /> :: There are two possibilities:<br /> ::: '''5.3.B.1.''' If the opposite-direction extreme is found, t.4p is confirmed (found), and the program proceeds to sub-step 5.3.1.<br /> ::: '''5.3.B.2.''' If the opposite-direction extreme is not found, the program looks for a new potential t.4p following the instructions in sub-step 5.3.1.<br /> :: '''5.3.1.''' If t.4p is found, the program constructs a line from t.2p to t.4p and checks it for price crossings on the segment from t.1p (excluding it) to t.3 in the VMP (including t.3).<br /> ::: If unnecessary intersections are found, the program looks for the next potential t.4p on the segment following the instructions in 5.3.<br /> ::: If no unnecessary intersections are found, the algorithm proceeds to sub-step 5.4.<br /> :: '''5.3.2.''' Check for Absolute Level<br /> :: The program checks the bar of the potential t.3p for absoluteness. The level of t.3p should not be exceeded by the price on the segment between t.3p and potential t.4p (excluding it).<br /> ::: '''5.3.2.1.''' If the level of t.3p is exceeded, the potential t.3p is discarded, and the program looks for a new t.3p following the instructions in sub-step 5.1. and further according to the algorithm.<br /> <br /> :::: '''5.3.2.2.''' If the level of t.3p is not exceeded, t.3p is confirmed, t.4p is confirmed, and the algorithm proceeds to sub- step 5.4.<br /> <br /> ==== Presupposition Verification ====<br /> : ''' 5.4.''' Presuppositions undergo the following checks:<br /> :: '''A.''' - Bars t.1p, t.2p, t.3p must follow each other.<br /> :: '''B.''' - The distance in levels between t.1 and t.2 (hereinafter rank 12) must be at least the value of the Minimum Distance between t.1 and t.2 Levels of the Presupposition, which is set in the Calculation Parameters, from the distance between t.4 and t.5 levels of the EAM model(this is rank 45).<br /> <br /> :: If all checks are successful, the Presupposition is found. If there are no unchecked t.1p left, the algorithm proceeds to Step 6.<br /> <br /> :: If there are no unchecked t.1p left, the algorithm proceeds to Step 6.<br /> <br /> === '''Step VI. Check for AL price crossings''' ===<br /> <br /> ==== '''6 alfa.''' ==== <br /> First it is necessary to check for the presence of a fixed t.2. If it exists, it means we are in a branch of searching for alternative models. <br /> <br /> The potential Aims Line (from t.2 to t.4), hereinafter referred to as AL, is calculated, and then:<br /> : '''6 alfa.1.''' AL Crossing Check<br /> <br /> :: '''6 alfa.1. A.''' - If there are no AL price crossings, the algorithm proceeds to step 6 alfa.2.<br /> :: '''6 alfa.1. B.''' - If AL is crossed, the next potential t.5 is determined according to Step 2, starting from bar t.5+2.<br /> : '''6.2. alfa.''' Distance Check for AL and TL Intersection<br /> : If:<br /> :: - TL and AL of the model do not intersect on the right (in the future) or<br /> :: - the ratio of the distance in bars between t.2 and t.4 to the distance between t.4 and the calculated point 6 is less than the default value of the parameter &quot;Minimum ratio of t.2-t.4 to t.4-t.6 EAM,&quot; then the search for alternative models is terminated. Otherwise, the program proceeds to Step 9. <br /> <br /> ====''' In the general case (no precviously fixed t.2)''' ====<br /> The program performs the following checks for each of the potential FBs:<br /> : '''6.1.''' AL Price Crossing Check (not just touching)<br /> : If AL intersects with the price on the segment between t.2 and t.4, this pair of candidates for t.1 and t.2 (this FB) is rejected.<br /> :: '''6.1.A.''' If FBs are found that give AL without intersections, the algorithm proceeds to step 6.2.<br /> :: '''6.1.B.''' If there are no suitable FBs, the algorithm looks for a new t.5 according to Step 2.<br /> <br /> : '''6.2.''' Checking for intersection of AL and TL (hereinafter referred to as calculated point 6) with each other on the right (in the future) along the time axis.<br /> : If the ratio of the distance in bars between t.2 and t.4 to the distance between t.4 and the calculated t.6 is less than the default value of the parameter &quot;Minimum ratio of t.2-t.4 to t.4-t.6 VMP,&quot; then these candidates for t.1 and t.2 are rejected.<br /> : The following scenarios are possible:<br /> :: '''6.2.A.''' One or several potential FBs remain - in this case, the program proceeds to Step 7.<br /> :: '''6.2.B.''' There are no potential FBs left - in this case, the program looks for a new potential t.5, starting from Step 2 and onwards.<br /> <br /> === '''Step VII. Dtermintaion of FB's with and without 2X5''' ===<br /> <br /> The program checks for the intersection of the bodies of candles at t.2 and t.5 (hereinafter referred to as 2x5). If there is only one potential FB, determining FB with 2x5 is not required, and the program proceeds to Step 8.<br /> <br /> :'''7.1.''' If there are multiple potential BOs, some of which have 2x5 and some do not, those potential BOs that have 2x5 are filtered out, and the program proceeds to Step 8.<br /> <br /> :'''7.2.''' If all potential FBs have 2x5, then all are filtered out except the one whose t.2 level is closer to the t.3 level. The program proceeds to <br /> <br /> === '''Step VIII: Filtering Based on Presupposition''' ===<br /> <br /> The algorithm checks whether Presuppositions have been found for the analyzed model.<br /> <br /> :'''8.0.''' If no Presuppositions are found, the program proceeds to Step 9.<br /> <br /> :'''8.1.''' The model has one or more Presuppositions. For each Presupposition program checks if the available candidates for t.2 belong to the interval between the last price level intersection of t.1p and t.1p itself (t.1p can also be used as t.2 EAM).<br /> <br /> ::'''8.1.1.''' There are candidates for t.2 that belong to the interval between the last price level intersection of t.1p and t.1p itself. Such a Presupposition is retained.<br /> ::'''8.1.2.''' There are no candidates for t.2 within the specified interval. In this case, such a Presupposition is discarded and not further considered (meaning the model has no Presupposition).<br /> :'''8.2.''' If after checking all Presuppositions according to sub-step 8.1., there are one or more Presuppositions with candidates in t.2 within the interval between the last price level intersection of t.1p and t.1p itself (inclusive), then:<br /> <br /> : - Among such Presuppositions, only the one with t.1p occurring later on the time axis is considered further;<br /> : - Only those candidates that belong to the interval between the last price level intersection of t.1p and t.1p itself are retained as t.2 candidates for the remaining Presupposition.<br /> ::'''8.2.1.''' If only one potential FB remains, the model is confirmed.<br /> ::'''8.2.2.''' If more than one potential FB remains, the program proceeds to Step 9.<br /> <br /> === '''Step IX. Search for Embedded Models in EAM''' ===<br /> <br /> :'''9.1.''' If EAM is constructed through t.3', then the interval from EAM's t.3 is checked for the presence of models according to Algorithm I, for which the following conditions are simultaneously satisfied. In the paragraph below, the numbers I and II in parentheses next to the model points denote the algorithm to which the model with this point belongs:<br /> <br /> : - If the model according to Algorithm I contains t.5, then its t.5 should precede or coincide with the t.5 of the analyzed EAM.<br /> : - t.4 does not lie beyond t.4 of the analyzed EAM; (bar of t.4(I) cannot coincide with bar of t.3(II), but can coincide with bar of t.4(II);<br /> : -t.1 lies before t.3' of the analyzed model (if it coincides with bar of t.3', then it is not suitable anymore) (t.1(I) can coincide with t.3(II), but cannot coincide with t.3'(II)<br /> <br /> If there are more than 5 models, those with the time distance from t.1 to t.4 greater than others are considered embedded models.<br /> <br /> ::'''9.1.1.''' If models are not found, then EAM does not have an embedded primary model.<br /> <br /> ::'''9.1.2.''' If the model/s is/are found, EAM is given the status of &quot;Models described near the Primary model.&quot;<br /> <br /> ::'''9.1.3.''' If EAM has one or more embedded models, models among them built from EAM's t.3 are searched for meeting one of the following criteria:<br /> <br /> ::: A. Having a trendline breakthrough in the interval before t.3' of the analyzed model;<br /> ::: B. Having an intersection of candle bodies at points 2 and 5 (hereinafter 2x5).<br /> ::: C. If the embedded model has a rank 45 greater than the ranks of 12 and 25 of the same model.<br /> ::: '''9.1.3.1.''' In the presence of one of these criteria, the model is Specific based on the 1st criterion.<br /> ::: '''9.1.3.2.''' In the absence of the specified criteria, the model is Normal based on the 1st criterion.<br /> <br /> :: '''9.1.4.''' If there is a model according to Algorithm I on the interval from t.3 to t.3' of the EAM, aligned with the preceding EAM trend, and with points t.1-t.4 lying on the interval 3-3' EAM (inclusive), then this EAM is Specific based on the 2nd criterion. <br /> :: In the absence of the specified criteria, the model is Normal based on the 2nd criterion.<br /> <br /> : Upon completion of all checks in step 9.1., the program proceeds to step 10.<br /> <br /> :'''9.2.''' If EAM is constructed through t.3, the program proceeds to step 10.<br /> <br /> === '''Step X. Search for Preceding Models''' ===<br /> <br /> The program identifies all possible models in accordance with Algorithm I, starting from the initial point of the preceding trend or starting from the presumed initial point of the preceding trend, see step 1.3.).<br /> In these models, the actual t.6 is determined, and if there was no intersection of TL, the Presumed t.6 (P6supp) is used. The algorithm for finding the actual/presumed t.6 is described in the branch of Algorithm I, see substep 5.3.<br /> <br /> Models on the preceding trend, with TL coinciding with t.3 of the EAM, are (directly) preceding for the given TL.<br /> <br /> Models on the preceding trend, for which the following conditions are simultaneously satisfied:<br /> : - actual/presumed t.6 precedes or equals t.3 of the EAM;<br /> : - t.6 is aligned with t.4 of the EAM;<br /> : - the level of t.6 lies between the levels of t.3 and t.4 of the EAM;<br /> are considered preceding corrective for the given EAM.<br /> <br /> From models with the same t.4 and the same t.1, the model with the later t.1 is selected as the priority for choosing t.2.<br /> <br /> From the remaining models with the same t.4, only the very last model is considered as both preceding and preceding corrective (i.e., with a later t.5 or without t.5) – one of each type.<br /> <br /> If there are more than 10 preceding and preceding corrective models (rarely encountered), only the last ones are selected (the last ones are determined as those with t.4 lying later than others).<br /> <br /> ==References==<br /> &lt;references /&gt;</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_II&diff=208 2024-01-04T08:51:19Z

<p>Admin: </p> <hr /> <div>This article is not finished<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with UMG General Concepts.<br /> <br /> ==='''Step I. Search For Point 3 of the External Attraction Model (EAM) and the Sarting Point of the Previous Trend.'''===<br /> : '''1.1.''' The program looks for the first possible extreme, satisfying Single Bar Rule. Such an extreme is a candidate for potential point 3 ( potential t.3).<br /> : '''1.2.''' Next, the program checks the bars from right to left (i.e., in the past) from the bar containing the extreme candidate for point 3 to one of the following events:<br /> :: '''1.2.1.''' Found the last intersection (breakthrough) point by the price level of the candidate for point 3.<br /> ::In this case, the report displays: <br /> :: PREVdata: FullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.2.''' The program reached the starting point of the chart (i.e., the price did not intersect the level of point 3 after the starting point of the chart).<br /> ::In this case, the report displays: <br /> :: PREVdata: NoFullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.3.''' The price checked 300 bars preceding point 3 &lt;ref&gt;The depth of the search for the extreme confirming point 3 of EAM model&lt;/ref&gt;, but the level of step 3 did not intersect at this segment. The program looks for an absolute extreme (opposite to step 3) on the segment from the 300th bar before point 3 to point 3. The program proceeds to substep 1.3.<br /> : '''1.3.''' The program looks for an absolute extreme (opposite to point 3 extreme) on the segment:<br /> ::- from the last intersection by the price level of the candidate for point 3 (inclusive) (if came from 1.2.1.), or <br /> :: - from the starting point of the chart (if came from 1.2.2.), or <br /> :: - from 300 bars(if came from 1.2.3.) <br /> :: to point 3 (excluding).<br /> :: '''1.3.1.''' Absolute extreme found. The candidate for point 3 is confirmed; moreover, the found confirming extreme is the assumed (if coming from 1.2.2. or 1.2.3.) starting point of the preceding trend.'''<br /> ::The program checks for the absence of extremes equal to point 3 between the assumed starting point of the previous trend and point 3. <br /> :::'''1.3.1.1.''' If such an extreme is found, this candidate for point 3 is discarded, and this point 3 is discarded. <br /> :::'''1.3.1.2.''' If such an extreme is not found, the program proceeds to step 2.<br /> ::'''1.3.2.''' Absolute extreme not found. This point 3 is discarded.'''<br /> ::Simultaneously with step 1, the program launches the search for the next potential point 3.<br /> <br /> ==='''Step II. Search For Potentioal Points 5 and 4 ''' ===<br /> '''The Orientation rule (N1 requirement) for Algorithm II is as follows:'''<br /> If point 3 is low, then the level of point 5 should be higher than point 3. <br /> If point 3 is high, then the level of point 5 should be lower than point 3.<br /> '''Search for Point 5.''' The bar following the bar of Point 3 (and in repeated applications of this step - the bar specified in this algorithm) is checked for not overcoming the level of point 3 (since N1 requirement for Algorithm II must be observed).<br /> :'''2.1.''' If the price has overcome the level of point 3, the program discards the considered step 3 (due to N1 requirement).<br /> :'''2.2.''' If N1 requirement is met for the analyzed bar, it is checked for compliance with N1 requirement as a potential point 5 (hereafter - point 5 or t.5).<br /> ::'''2.2.1.''' If the analyzed bar is not an extreme according to N1 requirement (as a potential point 5), the program checks the next bar from the beginning of step 2.<br /> ::'''2.2.2.''' If the analyzed bar is determined as an extreme according to N1 requirement (as a potential point 5), then this bar is checked for reaching (but not necessarily overcoming) the level of point 3. There are 2 options:<br /> :::'''2.2.2.1.''' If the level of point 3 is reached, the program analyzes the next bar according to this step (i.e., from the beginning of step 2).<br /> :::'''2.2.2.2.''' If the level of point 3 is not reached, the analyzed bar is a potential point 5, and the program moves to substep 2.3.<br /> :'''2.3. Search for Point 4.''' The program searches for a bar, which was the last to cross the level of the considered potential point 5. Let's denote this bar as lcb5 (line-crossing-bar-5). If lcb5 coincides with the bar of point 3, we denote the bar following lcb5 as look4. Otherwise, look4 = lcb5. The program searches for a bar with the maximum (if point 3 is low) or minimum (if point 3 is high) price in the interval from lcb5 to potential point 5. Then this bar is checked for being an extreme according to N1 requirement as a potential pont 4 (hereafter – point 4 or t.4). There are 2 options:<br /> ::'''2.3.1.''' The bar is an absolute extreme (as a potential point 4). In this case, potential point 4 is found.<br /> :::'''2.3.1.1.''' If step 2 has already been determined (this is possible when this step is triggered during the search for an alternative model), the program checks the line chart for extra points in the section from step 2 to step 4. There are 2 options:<br /> ::::'''2.3.1.1.A.''' If extra points are found, the program processes the next bar after potential point 5 according to step 2.<br /> ::::'''2.3.1.1.B.''' Extra intersections are not found; the program moves to substep 2.4.<br /> :::'''2.3.1.2.''' If substep 2.3.1. is triggered during the search for the basic model, the program moves to substep 2.4.<br /> ::'''2.3.2.''' The bar is not an absolute extreme (as a potential point 4). In this case, the program looks for another candidate for point 5 according to this step (i.e., according to step 2).<br /> If the program has processed 50 bars in a row according to this step (step 2), and the program has not moved to another step of the algorithm, then this potential point 3 is discarded.<br /> If there are 150 or more bars&lt;ref&gt;Continuous search range of t.5 in one iteration for EAM model&lt;/ref&gt; between potential point 3 and the analyzed bar, and potential points 4 and 5 are not found, then this potential point 3 is discarded.<br /> :'''2.4.''' Real-Time Verification of t.5 <br /> :The potential t.5 bar is checked for the presence of bars between the analyzed bar and the potential t.4 bar, which contain price values more distant (or even equally distant) from the potential t.4 than the most distant from t.4 value of the analyzed bar. This is a check of the potential t.5 for beeing the '''potential absolute extreme'''. The following options are possible:<br /> ::'''2.4.1.''' If the extreme is potentially absolute, the program proceeds to step 3.<br /> ::'''2.4.2.''' If the extreme is not potentially absolute, the program checks the next bar starting from this step (i.e., step 2).<br /> <br /> ===''' Step III. Confirmation of Point 4. Searching for Alternative t.5 and t.5&quot; '''===<br /> The program checks whether the bar of potential t.5 has reached the level of t.4. Two scenarios are possible:<br /> :'''3.1.''' The Bar of Potential t.5 Has Reached t.4.<br /> :In this case:<br /> ::The model is built through absolute t.5.<br /> ::The t.5 bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> ::Point 4 is confirmed,<br /> ::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3 (since there is already possible to display the model through t.5 on the chart).<br /> :'''3.2.''' The Bar of Potential t.5 Has Not Reached t.4. <br /> :In this case, the program checks the next bar for reaching the level of t.4. The following options are possible:<br /> ::'''3.2.1. The Considered Bar Reaches the Level of Potential t.4. <br /> ::In this case:<br /> :::The model is built through absolute t.5.<br /> :::The considered bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> :::Point 4 is confirmed,<br /> :::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3.ext, but first goes through sub-step 3.3.<br /> ::'''3.2.2.''' The Considered Bar Does Not Reach the Level of t.4.<br /> ::In this case the program checks the next bar for overcoming the level of potential t.5. Two scenarios are possible:<br /> :::'''3.2.2.1.''' If the t.5 level is overcome, the analyzed bar is considered as a new potential t.5. The program processes this bar according to step 2.<br /> :::'''3.2.2.2.''' If the t.5 level is not overcome, the analyzed bar is checked for reaching the level of t.4 according to sub-step 3.2.<br /> ::In parallel (i.e., an additional branch is created), the program proceeds to sub-step 3.3 (since there is already an option to display the model through t.5 on the chart). The model in this branch receives a &quot;draw_flag&quot; label.<br /> :'''3.3.''' Construction of the Trend Line (TL). <br /> :A Trend Line (TL) is constructed from t.3 to t.5. Each bar between t.3 and t.5 is checked for breaking the TL. Two scenarios are possible:<br /> ::'''3.3.1.'''The Price Crosses the TL. <br /> ::In this case, the TL through t.3 is not constructed. The program searches for a candidate for point 3' (hereafter - t.3'). T.3' is selected in such a way that the TL' (constructed from t.3' to t.5) is not crossed by the price in the 3-5 segment. Rule No.1 for t.3' is not applied. T.3' cannot belong to the same bar as t.4. Two scenarios are possible:<br /> :::'''3.3.1.1.''' T.3' is found, this model is classified as built through t.3'. The program proceeds to step 4, or to sub-step 3.3.extended if coming from 3.2.<br /> :::'''3.3.1.2.''' T.3' is not found. In this case, the program searches for new potential t.5 and t.4 according to step 2.<br /> ::'''3.3.2.''' The Price Does Not Break the TL. <br /> ::In this case, this model is classified as built through t.3 (absolute extreme). The program proceeds to step 4, or to sub-step 3.3.ext. if current algorithm line is coming from 3.2.<br /> <br /> <br /> ::'''3.3.ext. Additional Trend Line Construction Through t.5&quot;.'''<br /> ::If:<br /> ::*The t.5 bar does not exceed the range of t.4;<br /> ::*At the time of model calculation, the level of t.4 is confirmed, then this model is checked for the possibility of constructing an additional Trend Line (TL) through t.5&quot;. Note: If t.4 is not confirmed, this model should be recalculated upon the appearance of a bar that confirms it's t.4.<br /> <br /> ::''' Definition: Point 5&quot; '''<br /> ::Point 5&quot; can lie in the segment between t.5 and the point confirming t.4. On this segment, a point is searched that meets the following requirements:<br /> <br /> ::''' Rule for Selecting Point 5&quot; High '''<br /> ::To the left of the bar containing t.5&quot;, the nearest high should be above the level of t.5.<br /> ::To the right of t.5&quot;, at least one nearest high should be below or equal to t.5. ::If the nearest high is equal to the level of t.5, then the next high should again be below or equal to the level of t.5, until at least one bar is strictly below the level of t.5.<br /> <br /> ::''' Rule for Selecting Point 5&quot; Low '''<br /> ::To the left of the bar containing t.5&quot;, the nearest low should be below the level of the extreme.<br /> ::To the right of t.5&quot;, at least one nearest low should be above or equal to t.5. If the nearest low is equal to the level of t.5, then the next low should again be above or equal to the level of t.5, until at least one bar is strictly above the level of t.5.<br /> <br /> ::''' Special Cases for Point 5&quot; '''<br /> ::Point 5&quot; may belong to a bar that has broken the level of t.4 (but only the first of such bars). If the bar of potential t.5&quot; breaks the level of calculated t.6 from t.5, then it is impossible to construct a TL through t.5&quot; for this model (this model does not contain such a point).<br /> <br /> :::'''3.3.ext.1.''' Additional TL Calculation <br /> :::If a bar is found that fits the rule for selecting 5&quot;, an additional TL is calculated for the potential t.5&quot; (hereafter TL&quot;). This line is checked for the absence of breaks in the segment from t.3/3'' to potential t.5&quot;.<br /> <br /> :::::'''3.3ext.1.a.''' If there is an intersection, the program moves to check the next bar as a potential t.5&quot;.<br /> <br /> :::::'''3.3ext.1.b.''' If there is no intersection, the found bar is compared with the previous candidate for t.5&quot; (if there was one in the previous iteration of the cycle). If the considered bar is closer to the level of t.4 than the candidate for t.5&quot;, then the considered bar becomes the new candidate for t.5&quot;.<br /> :::The check of bars continues in a cycle until a bar confirming t.4 is reached. If a candidate for t.5 is found as a result of the check, the program moves to sub-step 3.3ext.1.1; otherwise, it moves to step 4.<br /> ::::'''3.3ext.1.1.''' If the analyzed model is built through t.3', a candidate for t.3&quot; is sought in the segment t.3-t.3', through which such a line to t.5&quot; can be built that will not have price intersections in the segment t.3-t.3&quot;.<br /> :::::'''3.3ext.1.1.1.''' If a candidate for t.3&quot; is found, where there are no intersections, a check is made for the intersection of TL&quot; by the bar following t.5&quot;.<br /> ::::::'''3.3.ext.1.1.1.A.''' If there are intersections, t.5&quot; is declared canceled, and the next one is sought according to sub-step 3.3.ext.<br /> ::::::'''3.3.ext.1.1.1.B.''' Otherwise, the program moves to step 13.2.<br /> :::::'''3.3.ext.1.1.2.''' If a suitable t.3&quot; is not found, a re-search for a candidate for t.5&quot; is carried out according to sub-steps 3.3.ext., but in this case, if a candidate for t.5&quot; was found, it becomes a canceled candidate for t.5&quot;. The new candidate must already be further from t.4 than the previously discarded ones.<br /> ::::'''3.3ext.1.2.''' If the analyzed model is built through t.3, a check is made for the intersection of TL'' by the bar following t.5&quot;.<br /> :::::'''3.3ext.1.2.A.''' If there are intersections, t.5&quot; is declared as canceled t.5', and the next one is sought according to sub-step 3.3.ext.<br /> :::::'''3.3ext.1.2.B.''' If there are no intersections, the algorithm moves to step 13.2.<br /> :::'''3.3.ext.2.''' TL'' is checked for price intersections in the segment between t.5 (inclusive) and potential t.5&quot; (hereafter segment 5-5&quot;).<br /> ::::'''3.3.ext.2.1.''' If there is an intersection, then this 5&quot; is filtered out. A re-search for a candidate for t.5&quot; is carried out according to sub-steps 3.3.ext., but in this case, the new candidate must already be further from t.4 (in terms of time) than the previously discarded ones.<br /> ::::'''3.3.ext.2.2.''' If there are no intersections of TL&quot; in the segment 5-5&quot;, then t.5&quot; is found.<br /> ::::In this case, the report displays: EAM5&quot; EAM5&quot;<br /> ::::The program moves to step 4.<br /> ::::'''3.3.ext.2.3.''' If t.5&quot; is not found, the program moves to step 4.<br /> <br /> ==='''Step IV: Searching for Potential Foundation Blocks.'''===<br /> <br /> ====Initial Check====<br /> First, it is necessary to check for the presence of a fixed t.2. If it exists, it means we are in a branch for searching for alternative models.<br /> <br /> ::'''4.0.1.''' If t.2 is defined in the model, proceed to step 6.<br /> ::'''4.0.2.''' If t.2 is not defined, the program moves to step 4.1.<br /> ====Examination of Extremes====<br /> On the preceding trend, extremes are checked sequentially from right to left (i.e., into the past) from t.3 (or from another analyzed bar in repeated applications of this step) according to the N1 bar rule (as a candidate for t.2). Each found candidate for t.2 is checked for the presence of a confirming extreme (which also serves as t.1) according to the following algorithm:<br /> <br /> ::'''4.1.0.''' An extreme candidate for t.2 is found.<br /> ::'''4.1.1.''' The point of the last intersection &lt;ref&gt;High or low of a bar, repeating or crossing high or low of t.2 bar – is an intersection&lt;/ref&gt; of the candidate's level with the price is found. In this case, the program looks for the absolute maximum (if t.2 is a minimum, i.e., t.2 is low) or the absolute minimum (if t.2 is a maximum, i.e., t.2 is high) in the segment from the last intersection of the t.2 level with the price to t.2.<br /> :::'''4.1.1.1.''' Maximum/minimum not found. In this case, the program discards this candidate for t.2.<br /> :::'''4.1.1.2.''' Maximum/minimum found. In this case, the potential t.2 is confirmed.<br /> :::'''4.1.2.''' The program reaches the starting point of the chart.<br /> :::'''4.1.3.''' The check reaches the boundary of the Depth of Search for t.1 &lt;ref&gt;&quot;Search depth t.1 for EAM models&quot; is set in the Calculation Parameters. It is calculated in bars from the bar of the considered potential t.2. By default, this value is 50 bars.&lt;/ref&gt; for the model and none of the above events (4.1.1. or 4.1.2.) occurred.<br /> <br /> ::'''4.2.''' The search for Foundation Blocks (i.e., points 1 and 2, a.k.a FB) continues until one of the events in steps 4.2.A, 4.2.B or 4.2.C. occurs.<br /> :::'''4.2.A. The check reaches the bar containing the (presumed) starting point of the preceding trend (from sub-step 1.2.2.1.). This point is not considered as a potential t.2<br /> :::'''4.2.B.''' The check reaches the bar that intersects the level of the presumed point 4 of the considered model.<br /> :::'''4.2.C.''' A bar that is located at a distance (by time) from T.3 greater than or equal to X* (distance from T.3 to t.4), where x is the parameter set in the settings &lt;ref&gt; This is the &quot;Time Ratio of 23 to 24&quot;(by default it is 3)&lt;/ref&gt;.<br /> ::=== Results ===<br /> ::As a result of the search for potential t.2 (i.e., upon the occurrence of4.2.A, 4.2.B or 4.2.C.), two scenarios are possible:<br /> :::'''4.2.1. ''' One or more pairs of potential t.2 and t.1 are found (potential Foundation Blocks). The program moves to step 5.<br /> :::'''4.2.2. ''' No potential Foundation Blocks are found. In this case, the program looks for the next potential t.5 according to step 2.<br /> <br /> === '''Step V. Search for Presupposition''' ===<br /> Presupposition is an optional part of the EAM.<br /> The program attempts to construct Presuppositions from all available candidates for t.2.<br /> <br /> ==== Presupposition Search Algorithm ====<br /> The program takes each potential t.2 of the EAM (as part of a potential FB) as a t.1 of Presupposition (hereinafter t.1p). In other words, the program tries to construct Presuppositions from each of the t.2.<br /> <br /> Initially, the most recent (rightmost) potential t.2 (or the one specified in the algorithm if we have returned to the beginning of the Step V in the cycle) in the EAM is taken as a potential t.1p. If there are no more unconfirmed t.1p, the algorithm proceeds to Step 6.<br /> <br /> : '''5.1.''' The program sequentially checks bars from left to right (into the future) from the potential t.1p to t.3 of EAM model (excluding t.3) for being an extreme according to the N1 rule as point 3 of the Presupposition (hereinafter t.3p).<br /> <br /> : '''N1 rule for the Presupposition points'''<br /> : If t.1p is low, t.3p must be below t.1p.<br /> : If t.1p is high, t.3p must be above t.1p.<br /> <br /> :: '''5.1.1.''' If the potential t.3p is not found, the program considers the next (to the left of the previous) potential t.2 of the EAM (within the FB) as t.1p.<br /> :: If the potential t.3p is not found, and there are no more potential FBs, the algorithm proceeds to Step 6.<br /> :: '''5.1.2.''' Once the potential t.3p is found, the program searches for point 2 of the Presupposition (hereinafter t.2p) as an extreme with the maximum/minimum price on the segment from t.1p to t.3p (hereinafter segment 1p-3p).<br /> :: If a suitable extreme is not found, the algorithm looks for the next potential t.3p for the previously found t.1p.<br /> :: If a maximum/minimum is found, it is checked for for being an extreme (as t.2p).<br /> :: There are two possibilities:<br /> ::: '''5.1.2.1.''' The bar is an absolute extreme. In this case, a potential t.2p is found, and the program proceeds to step 5.2.<br /> ::: '''5.1.2.2.''' The bar is not an extreme. In this case, the program looks for another candidate for t.3p for the previously found t.1p following the instructions in 5.1.<br /> : '''5.2.''' The program constructs a line from t.1p to t.3p and checks it for price crossings on the segment from t.1p to t.3 of the EAM (including t.3 of EAM).<br /> :: '''5.2.1.''' If this lines price crossings are found, the program looks for a new candidate for t.3p for the previously found t.1p following the instructions in sub-step 5.1.<br /> :: '''5.2.2.''' If there are no price crossings, the program proceeds to sub-step 5.3.<br /> <br /> : '''5.3.''' The program searches for a potential point 4 of the Presupposition (t.4p) according to the N1 rule on the segment from t.3p to t.3 in the VMP (including t.3).<br /> <br /> : If t.1p is low, t.4p must be below t.2p. Each subsequent candidate for t.4p must be below the previous candidate for t.4p.<br /> : If t.1p is high, t.4p must be above t.2p. Each subsequent candidate for t.4p must be above the previous candidate for t.4p.<br /> : Possible scenarios:<br /> :: '''5.3.A.''' If the potential t.4p coincides with t.3 in the EAM, t.4p is confirmed (found), and the program proceeds to sub-step 5.3.1.<br /> :: '''5.3.B.''' If the potential t.4p does not coincide with t.3 in the EAM (i.e., it is located before it), the program looks for an opposite-direction potential t.4p extreme on the segment from the potential t.4p (excluding it) to the bar where the price again reached the value of the potential t.4p (excluding it).<br /> <br /> :: There are two possibilities:<br /> ::: '''5.3.B.1.''' If the opposite-direction extreme is found, t.4p is confirmed (found), and the program proceeds to sub-step 5.3.1.<br /> ::: '''5.3.B.2.''' If the opposite-direction extreme is not found, the program looks for a new potential t.4p following the instructions in sub-step 5.3.1.<br /> :: '''5.3.1.''' If t.4p is found, the program constructs a line from t.2p to t.4p and checks it for price crossings on the segment from t.1p (excluding it) to t.3 in the VMP (including t.3).<br /> ::: If unnecessary intersections are found, the program looks for the next potential t.4p on the segment following the instructions in 5.3.<br /> ::: If no unnecessary intersections are found, the algorithm proceeds to sub-step 5.4.<br /> :: '''5.3.2.''' Check for Absolute Level<br /> :: The program checks the bar of the potential t.3p for absoluteness. The level of t.3p should not be exceeded by the price on the segment between t.3p and potential t.4p (excluding it).<br /> ::: '''5.3.2.1.''' If the level of t.3p is exceeded, the potential t.3p is discarded, and the program looks for a new t.3p following the instructions in sub-step 5.1. and further according to the algorithm.<br /> <br /> :::: '''5.3.2.2.''' If the level of t.3p is not exceeded, t.3p is confirmed, t.4p is confirmed, and the algorithm proceeds to sub- step 5.4.<br /> <br /> ==== Presupposition Verification ====<br /> : ''' 5.4.''' Presuppositions undergo the following checks:<br /> :: '''A.''' - Bars t.1p, t.2p, t.3p must follow each other.<br /> :: '''B.''' - The distance in levels between t.1 and t.2 (hereinafter rank 12) must be at least the value of the Minimum Distance between t.1 and t.2 Levels of the Presupposition, which is set in the Calculation Parameters, from the distance between t.4 and t.5 levels of the EAM model(this is rank 45).<br /> <br /> :: If all checks are successful, the Presupposition is found. If there are no unchecked t.1p left, the algorithm proceeds to Step 6.<br /> <br /> :: If there are no unchecked t.1p left, the algorithm proceeds to Step 6.<br /> <br /> === '''Step VI. Check for AL price crossings''' ===<br /> <br /> ==== '''6 alfa.''' ==== <br /> First it is necessary to check for the presence of a fixed t.2. If it exists, it means we are in a branch of searching for alternative models. <br /> <br /> The potential Aims Line (from t.2 to t.4), hereinafter referred to as AL, is calculated, and then:<br /> : '''6 alfa.1.''' AL Crossing Check<br /> <br /> :: '''6 alfa.1. A.''' - If there are no AL price crossings, the algorithm proceeds to step 6 alfa.2.<br /> :: '''6 alfa.1. B.''' - If AL is crossed, the next potential t.5 is determined according to Step 2, starting from bar t.5+2.<br /> : '''6.2. alfa.''' Distance Check for AL and TL Intersection<br /> : If:<br /> :: - TL and AL of the model do not intersect on the right (in the future) or<br /> :: - the ratio of the distance in bars between t.2 and t.4 to the distance between t.4 and the calculated point 6 is less than the default value of the parameter &quot;Minimum ratio of t.2-t.4 to t.4-t.6 EAM,&quot; then the search for alternative models is terminated. Otherwise, the program proceeds to Step 9. <br /> <br /> ====''' In the general case (no precviously fixed t.2)''' ====<br /> The program performs the following checks for each of the potential FBs:<br /> : '''6.1.''' AL Price Crossing Check (not just touching)<br /> : If AL intersects with the price on the segment between t.2 and t.4, this pair of candidates for t.1 and t.2 (this FB) is rejected.<br /> :: '''6.1.A.''' If FBs are found that give AL without intersections, the algorithm proceeds to step 6.2.<br /> :: '''6.1.B.''' If there are no suitable FBs, the algorithm looks for a new t.5 according to Step 2.<br /> <br /> : '''6.2.''' Checking for intersection of AL and TL (hereinafter referred to as calculated point 6) with each other on the right (in the future) along the time axis.<br /> : If the ratio of the distance in bars between t.2 and t.4 to the distance between t.4 and the calculated t.6 is less than the default value of the parameter &quot;Minimum ratio of t.2-t.4 to t.4-t.6 VMP,&quot; then these candidates for t.1 and t.2 are rejected.<br /> : The following scenarios are possible:<br /> :: '''6.2.A.''' One or several potential FBs remain - in this case, the program proceeds to Step 7.<br /> :: '''6.2.B.''' There are no potential FBs left - in this case, the program looks for a new potential t.5, starting from Step 2 and onwards.<br /> <br /> === '''Step VII. Dtermintaion of FB's with and without 2X5''' ===<br /> <br /> The program checks for the intersection of the bodies of candles at t.2 and t.5 (hereinafter referred to as 2x5). If there is only one potential FB, determining FB with 2x5 is not required, and the program proceeds to Step 8.<br /> <br /> :'''7.1.''' If there are multiple potential BOs, some of which have 2x5 and some do not, those potential BOs that have 2x5 are filtered out, and the program proceeds to Step 8.<br /> <br /> :'''7.2.''' If all potential FBs have 2x5, then all are filtered out except the one whose t.2 level is closer to the t.3 level. The program proceeds to <br /> <br /> === '''Step VIII: Filtering Based on Presupposition''' ===<br /> <br /> The algorithm checks whether Presuppositions have been found for the analyzed model.<br /> <br /> :'''8.0.''' If no Presuppositions are found, the program proceeds to Step 9.<br /> <br /> :'''8.1.''' The model has one or more Presuppositions. For each Presupposition program checks if the available candidates for t.2 belong to the interval between the last price level intersection of t.1p and t.1p itself (t.1p can also be used as t.2 EAM).<br /> <br /> ::'''8.1.1.''' There are candidates for t.2 that belong to the interval between the last price level intersection of t.1p and t.1p itself. Such a Presupposition is retained.<br /> ::'''8.1.2.''' There are no candidates for t.2 within the specified interval. In this case, such a Presupposition is discarded and not further considered (meaning the model has no Presupposition).<br /> :'''8.2.''' If after checking all Presuppositions according to sub-step 8.1., there are one or more Presuppositions with candidates in t.2 within the interval between the last price level intersection of t.1p and t.1p itself (inclusive), then:<br /> <br /> : - Among such Presuppositions, only the one with t.1p occurring later on the time axis is considered further;<br /> : - Only those candidates that belong to the interval between the last price level intersection of t.1p and t.1p itself are retained as t.2 candidates for the remaining Presupposition.<br /> ::'''8.2.1.''' If only one potential FB remains, the model is confirmed.<br /> ::'''8.2.2.''' If more than one potential FB remains, the program proceeds to Step 9.<br /> <br /> === '''Step IX. Search for Embedded Models in EAM''' ===<br /> <br /> :'''9.1.''' If EAM is constructed through t.3', then the interval from EAM's t.3 is checked for the presence of models according to Algorithm I, for which the following conditions are simultaneously satisfied. In the paragraph below, the numbers I and II in parentheses next to the model points denote the algorithm to which the model with this point belongs:<br /> <br /> : - If the model according to Algorithm I contains t.5, then its t.5 should precede or coincide with the t.5 of the analyzed EAM.<br /> : - t.4 does not lie beyond t.4 of the analyzed EAM; (bar of t.4(I) cannot coincide with bar of t.3(II), but can coincide with bar of t.4(II);<br /> : -t.1 lies before t.3' of the analyzed model (if it coincides with bar of t.3', then it is not suitable anymore) (t.1(I) can coincide with t.3(II), but cannot coincide with t.3'(II)<br /> <br /> If there are more than 5 models, those with the time distance from t.1 to t.4 greater than others are considered embedded models.<br /> <br /> ::'''9.1.1.''' If models are not found, then EAM does not have an embedded primary model.<br /> <br /> ::'''9.1.2.''' If the model/s is/are found, EAM is given the status of &quot;Models described near the Primary model.&quot;<br /> <br /> ::'''9.1.3.''' If EAM has one or more embedded models, models among them built from EAM's t.3 are searched for meeting one of the following criteria:<br /> <br /> ::: A. Having a trendline breakthrough in the interval before t.3' of the analyzed model;<br /> ::: B. Having an intersection of candle bodies at points 2 and 5 (hereinafter 2x5).<br /> ::: C. If the embedded model has a rank 45 greater than the ranks of 12 and 25 of the same model.<br /> ::: '''9.1.3.1.''' In the presence of one of these criteria, the model is Specific based on the 1st criterion.<br /> ::: '''9.1.3.2.''' In the absence of the specified criteria, the model is Normal based on the 1st criterion.<br /> <br /> :: '''9.1.4.''' If there is a model according to Algorithm I on the interval from t.3 to t.3' of the EAM, aligned with the preceding EAM trend, and with points t.1-t.4 lying on the interval 3-3' EAM (inclusive), then this EAM is Specific based on the 2nd criterion. <br /> :: In the absence of the specified criteria, the model is Normal based on the 2nd criterion.<br /> <br /> : Upon completion of all checks in step 9.1., the program proceeds to step 10.<br /> <br /> :'''9.2.''' If EAM is constructed through t.3, the program proceeds to step 10.<br /> <br /> === '''Step X. Search for Preceding Models (EAM)''' ===<br /> <br /> The program identifies all possible models in accordance with Algorithm I, starting from the initial point of the preceding trend or starting from the presumed initial point of the preceding trend, see step 1.3.).<br /> In these models, the actual t.6 is determined, and if there was no intersection of TL, the Presumed t.6 (P6supp) is used. The algorithm for finding the actual/presumed t.6 is described in the branch of Algorithm I, see substep 5.3.<br /> <br /> Models on the preceding trend, with TL coinciding with t.3 of the EAM, are (directly) preceding for the given TL.<br /> <br /> Models on the preceding trend, for which the following conditions are simultaneously satisfied:<br /> : - actual/presumed t.6 precedes or equals t.3 of the EAM;<br /> : - t.6 is aligned with t.4 of the EAM;<br /> : - the level of t.6 lies between the levels of t.3 and t.4 of the EAM;<br /> are considered preceding corrective for the given EAM.<br /> <br /> From models with the same t.4 and the same t.1, the model with the later t.1 is selected as the priority for choosing t.2.<br /> <br /> From the remaining models with the same t.4, only the very last model is considered as both preceding and preceding corrective (i.e., with a later t.5 or without t.5) – one of each type.<br /> <br /> If there are more than 10 preceding and preceding corrective models (rarely encountered), only the last ones are selected (the last ones are determined as those with t.4 lying later than others).<br /> <br /> ==References==<br /> &lt;references /&gt;</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_II&diff=207 2024-01-04T08:19:06Z

<p>Admin: /* Step I. Search For Point 3 of the External Attraction Model (EAM) and the Sarting Point of the Previous Trend. */</p> <hr /> <div>This article is not finished<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with UMG General Concepts.<br /> <br /> ==='''Step I. Search For Point 3 of the External Attraction Model (EAM) and the Sarting Point of the Previous Trend.'''===<br /> : '''1.1.''' The program looks for the first possible extreme, satisfying Single Bar Rule. Such an extreme is a candidate for potential point 3 ( potential t.3).<br /> : '''1.2.''' Next, the program checks the bars from right to left (i.e., in the past) from the bar containing the extreme candidate for point 3 to one of the following events:<br /> :: '''1.2.1.''' Found the last intersection (breakthrough) point by the price level of the candidate for point 3.<br /> ::In this case, the report displays: <br /> :: PREVdata: FullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.2.''' The program reached the starting point of the chart (i.e., the price did not intersect the level of point 3 after the starting point of the chart).<br /> ::In this case, the report displays: <br /> :: PREVdata: NoFullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.3.''' The price checked 300 bars preceding point 3 &lt;ref&gt;The depth of the search for the extreme confirming point 3 of EAM model&lt;/ref&gt;, but the level of step 3 did not intersect at this segment. The program looks for an absolute extreme (opposite to step 3) on the segment from the 300th bar before point 3 to point 3. The program proceeds to substep 1.3.<br /> : '''1.3.''' The program looks for an absolute extreme (opposite to point 3 extreme) on the segment:<br /> ::- from the last intersection by the price level of the candidate for point 3 (inclusive) (if came from 1.2.1.), or <br /> :: - from the starting point of the chart (if came from 1.2.2.), or <br /> :: - from 300 bars(if came from 1.2.3.) <br /> :: to point 3 (excluding).<br /> :: '''1.3.1.''' Absolute extreme found. The candidate for point 3 is confirmed; moreover, the found confirming extreme is the assumed (if coming from 1.2.2. or 1.2.3.) starting point of the preceding trend.'''<br /> ::The program checks for the absence of extremes equal to point 3 between the assumed starting point of the previous trend and point 3. <br /> :::'''1.3.1.1.''' If such an extreme is found, this candidate for point 3 is discarded, and this point 3 is discarded. <br /> :::'''1.3.1.2.''' If such an extreme is not found, the program proceeds to step 2.<br /> ::'''1.3.2.''' Absolute extreme not found. This point 3 is discarded.'''<br /> ::Simultaneously with step 1, the program launches the search for the next potential point 3.<br /> <br /> ==='''Step II. Search For Potentioal Points 5 and 4 ''' ===<br /> '''The Orientation rule (N1 requirement) for Algorithm II is as follows:'''<br /> If point 3 is low, then the level of point 5 should be higher than point 3. <br /> If point 3 is high, then the level of point 5 should be lower than point 3.<br /> '''Search for Point 5.''' The bar following the bar of Point 3 (and in repeated applications of this step - the bar specified in this algorithm) is checked for not overcoming the level of point 3 (since N1 requirement for Algorithm II must be observed).<br /> :'''2.1.''' If the price has overcome the level of point 3, the program discards the considered step 3 (due to N1 requirement).<br /> :'''2.2.''' If N1 requirement is met for the analyzed bar, it is checked for compliance with N1 requirement as a potential point 5 (hereafter - point 5 or t.5).<br /> ::'''2.2.1.''' If the analyzed bar is not an extreme according to N1 requirement (as a potential point 5), the program checks the next bar from the beginning of step 2.<br /> ::'''2.2.2.''' If the analyzed bar is determined as an extreme according to N1 requirement (as a potential point 5), then this bar is checked for reaching (but not necessarily overcoming) the level of point 3. There are 2 options:<br /> :::'''2.2.2.1.''' If the level of point 3 is reached, the program analyzes the next bar according to this step (i.e., from the beginning of step 2).<br /> :::'''2.2.2.2.''' If the level of point 3 is not reached, the analyzed bar is a potential point 5, and the program moves to substep 2.3.<br /> :'''2.3. Search for Point 4.''' The program searches for a bar, which was the last to cross the level of the considered potential point 5. Let's denote this bar as lcb5 (line-crossing-bar-5). If lcb5 coincides with the bar of point 3, we denote the bar following lcb5 as look4. Otherwise, look4 = lcb5. The program searches for a bar with the maximum (if point 3 is low) or minimum (if point 3 is high) price in the interval from lcb5 to potential point 5. Then this bar is checked for being an extreme according to N1 requirement as a potential pont 4 (hereafter – point 4 or t.4). There are 2 options:<br /> ::'''2.3.1.''' The bar is an absolute extreme (as a potential point 4). In this case, potential point 4 is found.<br /> :::'''2.3.1.1.''' If step 2 has already been determined (this is possible when this step is triggered during the search for an alternative model), the program checks the line chart for extra points in the section from step 2 to step 4. There are 2 options:<br /> ::::'''2.3.1.1.A.''' If extra points are found, the program processes the next bar after potential point 5 according to step 2.<br /> ::::'''2.3.1.1.B.''' Extra intersections are not found; the program moves to substep 2.4.<br /> :::'''2.3.1.2.''' If substep 2.3.1. is triggered during the search for the basic model, the program moves to substep 2.4.<br /> ::'''2.3.2.''' The bar is not an absolute extreme (as a potential point 4). In this case, the program looks for another candidate for point 5 according to this step (i.e., according to step 2).<br /> If the program has processed 50 bars in a row according to this step (step 2), and the program has not moved to another step of the algorithm, then this potential point 3 is discarded.<br /> If there are 150 or more bars&lt;ref&gt;Continuous search range of t.5 in one iteration for EAM model&lt;/ref&gt; between potential point 3 and the analyzed bar, and potential points 4 and 5 are not found, then this potential point 3 is discarded.<br /> :'''2.4.''' Real-Time Verification of t.5 <br /> :The potential t.5 bar is checked for the presence of bars between the analyzed bar and the potential t.4 bar, which contain price values more distant (or even equally distant) from the potential t.4 than the most distant from t.4 value of the analyzed bar. This is a check of the potential t.5 for beeing the '''potential absolute extreme'''. The following options are possible:<br /> ::'''2.4.1.''' If the extreme is potentially absolute, the program proceeds to step 3.<br /> ::'''2.4.2.''' If the extreme is not potentially absolute, the program checks the next bar starting from this step (i.e., step 2).<br /> <br /> ===''' Step III. Confirmation of Point 4. Searching for Alternative t.5 and t.5&quot; '''===<br /> The program checks whether the bar of potential t.5 has reached the level of t.4. Two scenarios are possible:<br /> :'''3.1.''' The Bar of Potential t.5 Has Reached t.4.<br /> :In this case:<br /> ::The model is built through absolute t.5.<br /> ::The t.5 bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> ::Point 4 is confirmed,<br /> ::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3 (since there is already possible to display the model through t.5 on the chart).<br /> :'''3.2.''' The Bar of Potential t.5 Has Not Reached t.4. <br /> :In this case, the program checks the next bar for reaching the level of t.4. The following options are possible:<br /> ::'''3.2.1. The Considered Bar Reaches the Level of Potential t.4. <br /> ::In this case:<br /> :::The model is built through absolute t.5.<br /> :::The considered bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> :::Point 4 is confirmed,<br /> :::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3.ext, but first goes through sub-step 3.3.<br /> ::'''3.2.2.''' The Considered Bar Does Not Reach the Level of t.4.<br /> ::In this case the program checks the next bar for overcoming the level of potential t.5. Two scenarios are possible:<br /> :::'''3.2.2.1.''' If the t.5 level is overcome, the analyzed bar is considered as a new potential t.5. The program processes this bar according to step 2.<br /> :::'''3.2.2.2.''' If the t.5 level is not overcome, the analyzed bar is checked for reaching the level of t.4 according to sub-step 3.2.<br /> ::In parallel (i.e., an additional branch is created), the program proceeds to sub-step 3.3 (since there is already an option to display the model through t.5 on the chart). The model in this branch receives a &quot;draw_flag&quot; label.<br /> :'''3.3.''' Construction of the Trend Line (TL). <br /> :A Trend Line (TL) is constructed from t.3 to t.5. Each bar between t.3 and t.5 is checked for breaking the TL. Two scenarios are possible:<br /> ::'''3.3.1.'''The Price Crosses the TL. <br /> ::In this case, the TL through t.3 is not constructed. The program searches for a candidate for point 3' (hereafter - t.3'). T.3' is selected in such a way that the TL' (constructed from t.3' to t.5) is not crossed by the price in the 3-5 segment. Rule No.1 for t.3' is not applied. T.3' cannot belong to the same bar as t.4. Two scenarios are possible:<br /> :::'''3.3.1.1.''' T.3' is found, this model is classified as built through t.3'. The program proceeds to step 4, or to sub-step 3.3.extended if coming from 3.2.<br /> :::'''3.3.1.2.''' T.3' is not found. In this case, the program searches for new potential t.5 and t.4 according to step 2.<br /> ::'''3.3.2.''' The Price Does Not Break the TL. <br /> ::In this case, this model is classified as built through t.3 (absolute extreme). The program proceeds to step 4, or to sub-step 3.3.ext. if current algorithm line is coming from 3.2.<br /> <br /> <br /> ::'''3.3.ext. Additional Trend Line Construction Through t.5&quot;.'''<br /> ::If:<br /> ::*The t.5 bar does not exceed the range of t.4;<br /> ::*At the time of model calculation, the level of t.4 is confirmed, then this model is checked for the possibility of constructing an additional Trend Line (TL) through t.5&quot;. Note: If t.4 is not confirmed, this model should be recalculated upon the appearance of a bar that confirms it's t.4.<br /> <br /> ::''' Definition: Point 5&quot; '''<br /> ::Point 5&quot; can lie in the segment between t.5 and the point confirming t.4. On this segment, a point is searched that meets the following requirements:<br /> <br /> ::''' Rule for Selecting Point 5&quot; High '''<br /> ::To the left of the bar containing t.5&quot;, the nearest high should be above the level of t.5.<br /> ::To the right of t.5&quot;, at least one nearest high should be below or equal to t.5. ::If the nearest high is equal to the level of t.5, then the next high should again be below or equal to the level of t.5, until at least one bar is strictly below the level of t.5.<br /> <br /> ::''' Rule for Selecting Point 5&quot; Low '''<br /> ::To the left of the bar containing t.5&quot;, the nearest low should be below the level of the extreme.<br /> ::To the right of t.5&quot;, at least one nearest low should be above or equal to t.5. If the nearest low is equal to the level of t.5, then the next low should again be above or equal to the level of t.5, until at least one bar is strictly above the level of t.5.<br /> <br /> ::''' Special Cases for Point 5&quot; '''<br /> ::Point 5&quot; may belong to a bar that has broken the level of t.4 (but only the first of such bars). If the bar of potential t.5&quot; breaks the level of calculated t.6 from t.5, then it is impossible to construct a TL through t.5&quot; for this model (this model does not contain such a point).<br /> <br /> :::'''3.3.ext.1.''' Additional TL Calculation <br /> :::If a bar is found that fits the rule for selecting 5&quot;, an additional TL is calculated for the potential t.5&quot; (hereafter TL&quot;). This line is checked for the absence of breaks in the segment from t.3/3'' to potential t.5&quot;.<br /> <br /> :::::'''3.3ext.1.a.''' If there is an intersection, the program moves to check the next bar as a potential t.5&quot;.<br /> <br /> :::::'''3.3ext.1.b.''' If there is no intersection, the found bar is compared with the previous candidate for t.5&quot; (if there was one in the previous iteration of the cycle). If the considered bar is closer to the level of t.4 than the candidate for t.5&quot;, then the considered bar becomes the new candidate for t.5&quot;.<br /> :::The check of bars continues in a cycle until a bar confirming t.4 is reached. If a candidate for t.5 is found as a result of the check, the program moves to sub-step 3.3ext.1.1; otherwise, it moves to step 4.<br /> ::::'''3.3ext.1.1.''' If the analyzed model is built through t.3', a candidate for t.3&quot; is sought in the segment t.3-t.3', through which such a line to t.5&quot; can be built that will not have price intersections in the segment t.3-t.3&quot;.<br /> :::::'''3.3ext.1.1.1.''' If a candidate for t.3&quot; is found, where there are no intersections, a check is made for the intersection of TL&quot; by the bar following t.5&quot;.<br /> ::::::'''3.3.ext.1.1.1.A.''' If there are intersections, t.5&quot; is declared canceled, and the next one is sought according to sub-step 3.3.ext.<br /> ::::::'''3.3.ext.1.1.1.B.''' Otherwise, the program moves to step 13.2.<br /> :::::'''3.3.ext.1.1.2.''' If a suitable t.3&quot; is not found, a re-search for a candidate for t.5&quot; is carried out according to sub-steps 3.3.ext., but in this case, if a candidate for t.5&quot; was found, it becomes a canceled candidate for t.5&quot;. The new candidate must already be further from t.4 than the previously discarded ones.<br /> ::::'''3.3ext.1.2.''' If the analyzed model is built through t.3, a check is made for the intersection of TL'' by the bar following t.5&quot;.<br /> :::::'''3.3ext.1.2.A.''' If there are intersections, t.5&quot; is declared as canceled t.5', and the next one is sought according to sub-step 3.3.ext.<br /> :::::'''3.3ext.1.2.B.''' If there are no intersections, the algorithm moves to step 13.2.<br /> :::'''3.3.ext.2.''' TL'' is checked for price intersections in the segment between t.5 (inclusive) and potential t.5&quot; (hereafter segment 5-5&quot;).<br /> ::::'''3.3.ext.2.1.''' If there is an intersection, then this 5&quot; is filtered out. A re-search for a candidate for t.5&quot; is carried out according to sub-steps 3.3.ext., but in this case, the new candidate must already be further from t.4 (in terms of time) than the previously discarded ones.<br /> ::::'''3.3.ext.2.2.''' If there are no intersections of TL&quot; in the segment 5-5&quot;, then t.5&quot; is found.<br /> ::::In this case, the report displays: EAM5&quot; EAM5&quot;<br /> ::::The program moves to step 4.<br /> ::::'''3.3.ext.2.3.''' If t.5&quot; is not found, the program moves to step 4.<br /> <br /> ==='''Step IV: Searching for Potential Foundation Blocks.'''===<br /> <br /> ====Initial Check====<br /> First, it is necessary to check for the presence of a fixed t.2. If it exists, it means we are in a branch for searching for alternative models.<br /> <br /> ::'''4.0.1.''' If t.2 is defined in the model, proceed to step 6.<br /> ::'''4.0.2.''' If t.2 is not defined, the program moves to step 4.1.<br /> ====Examination of Extremes====<br /> On the preceding trend, extremes are checked sequentially from right to left (i.e., into the past) from t.3 (or from another analyzed bar in repeated applications of this step) according to the N1 bar rule (as a candidate for t.2). Each found candidate for t.2 is checked for the presence of a confirming extreme (which also serves as t.1) according to the following algorithm:<br /> <br /> ::'''4.1.0.''' An extreme candidate for t.2 is found.<br /> ::'''4.1.1.''' The point of the last intersection &lt;ref&gt;High or low of a bar, repeating or crossing high or low of t.2 bar – is an intersection&lt;/ref&gt; of the candidate's level with the price is found. In this case, the program looks for the absolute maximum (if t.2 is a minimum, i.e., t.2 is low) or the absolute minimum (if t.2 is a maximum, i.e., t.2 is high) in the segment from the last intersection of the t.2 level with the price to t.2.<br /> :::'''4.1.1.1.''' Maximum/minimum not found. In this case, the program discards this candidate for t.2.<br /> :::'''4.1.1.2.''' Maximum/minimum found. In this case, the potential t.2 is confirmed.<br /> :::'''4.1.2.''' The program reaches the starting point of the chart.<br /> :::'''4.1.3.''' The check reaches the boundary of the Depth of Search for t.1 &lt;ref&gt;&quot;Search depth t.1 for EAM models&quot; is set in the Calculation Parameters. It is calculated in bars from the bar of the considered potential t.2. By default, this value is 50 bars.&lt;/ref&gt; for the model and none of the above events (4.1.1. or 4.1.2.) occurred.<br /> <br /> ::'''4.2.''' The search for Foundation Blocks (i.e., points 1 and 2, a.k.a FB) continues until one of the events in steps 4.2.A, 4.2.B or 4.2.C. occurs.<br /> :::'''4.2.A. The check reaches the bar containing the (presumed) starting point of the preceding trend (from sub-step 1.2.2.1.). This point is not considered as a potential t.2<br /> :::'''4.2.B.''' The check reaches the bar that intersects the level of the presumed point 4 of the considered model.<br /> :::'''4.2.C.''' A bar that is located at a distance (by time) from T.3 greater than or equal to X* (distance from T.3 to t.4), where x is the parameter set in the settings &lt;ref&gt; This is the &quot;Time Ratio of 23 to 24&quot;(by default it is 3)&lt;/ref&gt;.<br /> ::=== Results ===<br /> ::As a result of the search for potential t.2 (i.e., upon the occurrence of4.2.A, 4.2.B or 4.2.C.), two scenarios are possible:<br /> :::'''4.2.1. ''' One or more pairs of potential t.2 and t.1 are found (potential Foundation Blocks). The program moves to step 5.<br /> :::'''4.2.2. ''' No potential Foundation Blocks are found. In this case, the program looks for the next potential t.5 according to step 2.<br /> <br /> === '''Step V. Search for Presupposition''' ===<br /> Presupposition is an optional part of the EAM.<br /> The program attempts to construct Presuppositions from all available candidates for t.2.<br /> <br /> ==== Presupposition Search Algorithm ====<br /> The program takes each potential t.2 of the EAM (as part of a potential FB) as a t.1 of Presupposition (hereinafter t.1p). In other words, the program tries to construct Presuppositions from each of the t.2.<br /> <br /> Initially, the most recent (rightmost) potential t.2 (or the one specified in the algorithm if we have returned to the beginning of the Step V in the cycle) in the EAM is taken as a potential t.1p. If there are no more unconfirmed t.1p, the algorithm proceeds to Step 6.<br /> <br /> : '''5.1.''' The program sequentially checks bars from left to right (into the future) from the potential t.1p to t.3 of EAM model (excluding t.3) for being an extreme according to the N1 rule as point 3 of the Presupposition (hereinafter t.3p).<br /> <br /> : '''N1 rule for the Presupposition points'''<br /> : If t.1p is low, t.3p must be below t.1p.<br /> : If t.1p is high, t.3p must be above t.1p.<br /> <br /> :: '''5.1.1.''' If the potential t.3p is not found, the program considers the next (to the left of the previous) potential t.2 of the EAM (within the FB) as t.1p.<br /> :: If the potential t.3p is not found, and there are no more potential FBs, the algorithm proceeds to Step 6.<br /> :: '''5.1.2.''' Once the potential t.3p is found, the program searches for point 2 of the Presupposition (hereinafter t.2p) as an extreme with the maximum/minimum price on the segment from t.1p to t.3p (hereinafter segment 1p-3p).<br /> :: If a suitable extreme is not found, the algorithm looks for the next potential t.3p for the previously found t.1p.<br /> :: If a maximum/minimum is found, it is checked for for being an extreme (as t.2p).<br /> :: There are two possibilities:<br /> ::: '''5.1.2.1.''' The bar is an absolute extreme. In this case, a potential t.2p is found, and the program proceeds to step 5.2.<br /> ::: '''5.1.2.2.''' The bar is not an extreme. In this case, the program looks for another candidate for t.3p for the previously found t.1p following the instructions in 5.1.<br /> : '''5.2.''' The program constructs a line from t.1p to t.3p and checks it for price crossings on the segment from t.1p to t.3 of the EAM (including t.3 of EAM).<br /> :: '''5.2.1.''' If this lines price crossings are found, the program looks for a new candidate for t.3p for the previously found t.1p following the instructions in sub-step 5.1.<br /> :: '''5.2.2.''' If there are no price crossings, the program proceeds to sub-step 5.3.<br /> <br /> : '''5.3.''' The program searches for a potential point 4 of the Presupposition (t.4p) according to the N1 rule on the segment from t.3p to t.3 in the VMP (including t.3).<br /> <br /> : If t.1p is low, t.4p must be below t.2p. Each subsequent candidate for t.4p must be below the previous candidate for t.4p.<br /> : If t.1p is high, t.4p must be above t.2p. Each subsequent candidate for t.4p must be above the previous candidate for t.4p.<br /> : Possible scenarios:<br /> :: '''5.3.A.''' If the potential t.4p coincides with t.3 in the EAM, t.4p is confirmed (found), and the program proceeds to sub-step 5.3.1.<br /> :: '''5.3.B.''' If the potential t.4p does not coincide with t.3 in the EAM (i.e., it is located before it), the program looks for an opposite-direction potential t.4p extreme on the segment from the potential t.4p (excluding it) to the bar where the price again reached the value of the potential t.4p (excluding it).<br /> <br /> :: There are two possibilities:<br /> ::: '''5.3.B.1.''' If the opposite-direction extreme is found, t.4p is confirmed (found), and the program proceeds to sub-step 5.3.1.<br /> ::: '''5.3.B.2.''' If the opposite-direction extreme is not found, the program looks for a new potential t.4p following the instructions in sub-step 5.3.1.<br /> :: '''5.3.1.''' If t.4p is found, the program constructs a line from t.2p to t.4p and checks it for price crossings on the segment from t.1p (excluding it) to t.3 in the VMP (including t.3).<br /> ::: If unnecessary intersections are found, the program looks for the next potential t.4p on the segment following the instructions in 5.3.<br /> ::: If no unnecessary intersections are found, the algorithm proceeds to sub-step 5.4.<br /> :: '''5.3.2.''' Check for Absolute Level<br /> :: The program checks the bar of the potential t.3p for absoluteness. The level of t.3p should not be exceeded by the price on the segment between t.3p and potential t.4p (excluding it).<br /> ::: '''5.3.2.1.''' If the level of t.3p is exceeded, the potential t.3p is discarded, and the program looks for a new t.3p following the instructions in sub-step 5.1. and further according to the algorithm.<br /> <br /> :::: '''5.3.2.2.''' If the level of t.3p is not exceeded, t.3p is confirmed, t.4p is confirmed, and the algorithm proceeds to sub- step 5.4.<br /> <br /> ==== Presupposition Verification ====<br /> : ''' 5.4.''' Presuppositions undergo the following checks:<br /> :: '''A.''' - Bars t.1p, t.2p, t.3p must follow each other.<br /> :: '''B.''' - The distance in levels between t.1 and t.2 (hereinafter rank 12) must be at least the value of the Minimum Distance between t.1 and t.2 Levels of the Presupposition, which is set in the Calculation Parameters, from the distance between t.4 and t.5 levels of the EAM model(this is rank 45).<br /> <br /> :: If all checks are successful, the Presupposition is found. If there are no unchecked t.1p left, the algorithm proceeds to Step 6.<br /> <br /> :: If there are no unchecked t.1p left, the algorithm proceeds to Step 6.<br /> <br /> === '''Step VI. Check for AL price crossings''' ===<br /> <br /> ==== '''6 alfa.''' ==== <br /> First it is necessary to check for the presence of a fixed t.2. If it exists, it means we are in a branch of searching for alternative models. <br /> <br /> The potential Aims Line (from t.2 to t.4), hereinafter referred to as AL, is calculated, and then:<br /> : '''6 alfa.1.''' AL Crossing Check<br /> <br /> :: '''6 alfa.1. A.''' - If there are no AL price crossings, the algorithm proceeds to step 6 alfa.2.<br /> :: '''6 alfa.1. B.''' - If AL is crossed, the next potential t.5 is determined according to Step 2, starting from bar t.5+2.<br /> : '''6.2. alfa.''' Distance Check for AL and TL Intersection<br /> : If:<br /> :: - TL and AL of the model do not intersect on the right (in the future) or<br /> :: - the ratio of the distance in bars between t.2 and t.4 to the distance between t.4 and the calculated point 6 is less than the default value of the parameter &quot;Minimum ratio of t.2-t.4 to t.4-t.6 EAM,&quot; then the search for alternative models is terminated. Otherwise, the program proceeds to Step 9. <br /> <br /> ====''' In the general case (no precviously fixed t.2)''' ====<br /> The program performs the following checks for each of the potential FBs:<br /> : '''6.1.''' AL Price Crossing Check (not just touching)<br /> : If AL intersects with the price on the segment between t.2 and t.4, this pair of candidates for t.1 and t.2 (this FB) is rejected.<br /> :: '''6.1.A.''' If FBs are found that give AL without intersections, the algorithm proceeds to step 6.2.<br /> :: '''6.1.B.''' If there are no suitable FBs, the algorithm looks for a new t.5 according to Step 2.<br /> <br /> : '''6.2.''' Checking for intersection of AL and TL (hereinafter referred to as calculated point 6) with each other on the right (in the future) along the time axis.<br /> : If the ratio of the distance in bars between t.2 and t.4 to the distance between t.4 and the calculated t.6 is less than the default value of the parameter &quot;Minimum ratio of t.2-t.4 to t.4-t.6 VMP,&quot; then these candidates for t.1 and t.2 are rejected.<br /> : The following scenarios are possible:<br /> :: '''6.2.A.''' One or several potential FBs remain - in this case, the program proceeds to Step 7.<br /> :: '''6.2.B.''' There are no potential FBs left - in this case, the program looks for a new potential t.5, starting from Step 2 and onwards.<br /> <br /> === '''Step VII. Dtermintaion of FB's with and without 2X5''' ===<br /> <br /> The program checks for the intersection of the bodies of candles at t.2 and t.5 (hereinafter referred to as 2x5). If there is only one potential FB, determining FB with 2x5 is not required, and the program proceeds to Step 8.<br /> <br /> :'''7.1.''' If there are multiple potential BOs, some of which have 2x5 and some do not, those potential BOs that have 2x5 are filtered out, and the program proceeds to Step 8.<br /> <br /> :'''7.2.''' If all potential FBs have 2x5, then all are filtered out except the one whose t.2 level is closer to the t.3 level. The program proceeds to <br /> <br /> === '''Step VIII: Filtering Based on Presupposition''' ===<br /> <br /> The algorithm checks whether Presuppositions have been found for the analyzed model.<br /> <br /> :'''8.0.''' If no Presuppositions are found, the program proceeds to Step 9.<br /> <br /> :'''8.1.''' The model has one or more Presuppositions. For each Presupposition program checks if the available candidates for t.2 belong to the interval between the last price level intersection of t.1p and t.1p itself (t.1p can also be used as t.2 EAM).<br /> <br /> ::'''8.1.1.''' There are candidates for t.2 that belong to the interval between the last price level intersection of t.1p and t.1p itself. Such a Presupposition is retained.<br /> ::'''8.1.2.''' There are no candidates for t.2 within the specified interval. In this case, such a Presupposition is discarded and not further considered (meaning the model has no Presupposition).<br /> :'''8.2.''' If after checking all Presuppositions according to sub-step 8.1., there are one or more Presuppositions with candidates in t.2 within the interval between the last price level intersection of t.1p and t.1p itself (inclusive), then:<br /> <br /> : - Among such Presuppositions, only the one with t.1p occurring later on the time axis is considered further;<br /> : - Only those candidates that belong to the interval between the last price level intersection of t.1p and t.1p itself are retained as t.2 candidates for the remaining Presupposition.<br /> ::'''8.2.1.''' If only one potential FB remains, the model is confirmed.<br /> ::'''8.2.2.''' If more than one potential FB remains, the program proceeds to Step 9.<br /> <br /> === '''Step IX. Search for Embedded Models in EAM''' ===<br /> <br /> :'''9.1.''' If EAM is constructed through t.3', then the interval from EAM's t.3 is checked for the presence of models according to Algorithm I, for which the following conditions are simultaneously satisfied. In the paragraph below, the numbers I and II in parentheses next to the model points denote the algorithm to which the model with this point belongs:<br /> <br /> : - If the model according to Algorithm I contains t.5, then its t.5 should precede or coincide with the t.5 of the analyzed EAM.<br /> : - t.4 does not lie beyond t.4 of the analyzed EAM; (bar of t.4(I) cannot coincide with bar of t.3(II), but can coincide with bar of t.4(II);<br /> : -t.1 lies before t.3' of the analyzed model (if it coincides with bar of t.3', then it is not suitable anymore) (t.1(I) can coincide with t.3(II), but cannot coincide with t.3'(II)<br /> <br /> If there are more than 5 models, those with the time distance from t.1 to t.4 greater than others are considered embedded models.<br /> <br /> ::'''9.1.1.''' If models are not found, then EAM does not have an embedded primary model.<br /> <br /> ::'''9.1.2.''' If the model/s is/are found, EAM is given the status of &quot;Models described near the Primary model.&quot;<br /> <br /> ::'''9.1.3.''' If EAM has one or more embedded models, models among them built from EAM's t.3 are searched for meeting one of the following criteria:<br /> <br /> ::: A. Having a trendline breakthrough in the interval before t.3' of the analyzed model;<br /> ::: B. Having an intersection of candle bodies at points 2 and 5 (hereinafter 2x5).<br /> ::: C. If the embedded model has a rank 45 greater than the ranks of 12 and 25 of the same model.<br /> ::: '''9.1.3.1.''' In the presence of one of these criteria, the model is Specific based on the 1st criterion.<br /> ::: '''9.1.3.2.''' In the absence of the specified criteria, the model is Normal based on the 1st criterion.<br /> <br /> :: '''9.1.4.''' If there is a model according to Algorithm I on the interval from t.3 to t.3' of the EAM, aligned with the preceding EAM trend, and with points t.1-t.4 lying on the interval 3-3' EAM (inclusive), then this EAM is Specific based on the 2nd criterion. <br /> :: In the absence of the specified criteria, the model is Normal based on the 2nd criterion.<br /> <br /> : Upon completion of all checks in step 9.1., the program proceeds to step 10.<br /> <br /> :'''9.2.''' If EAM is constructed through t.3, the program proceeds to step 10.<br /> <br /> ==References==<br /> &lt;references /&gt;</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_II&diff=206 2024-01-03T22:59:04Z

<p>Admin: /* Step IX. Search for Embedded Models in EAM */</p> <hr /> <div>This article is not finished<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with UMG General Concepts.<br /> <br /> ==='''Step I. Search For Point 3 of the External Attraction Model (EAM) and the Sarting Point of the Previous Trend.'''===<br /> : '''1.1.''' The program looks for the first possible extreme, satisfying Single Bar Rule. Such an extreme is a candidate for potential point 3 ( potential t.3).<br /> : '''1.2.''' Next, the program checks the bars from right to left (i.e., in the past) from the bar containing the extreme candidate for point 3 to one of the following events:<br /> :: '''1.2.1.''' Found the last intersection (breakthrough) point by the price level of the candidate for point 3.<br /> ::In this case, the report displays: <br /> :: PREVdata: FullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.2.''' The program reached the starting point of the chart (i.e., the price did not intersect the level of point 3 after the starting point of the chart).<br /> ::In this case, the report displays: <br /> :: PREVdata: NoFullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.3.''' The price checked 300 bars preceding point 3 &lt;ref&gt;The depth of the search for the extreme confirming point 3 of EAM model&lt;/ref&gt;, but the level of step 3 did not intersect at this segment. The program looks for an absolute extreme (opposite to step 3) on the segment from the 300th bar before point 3 to point 3. The program proceeds to substep 1.3.<br /> : '''1.3.''' The program looks for an absolute extreme (opposite to point 3 extreme) on the segment:<br /> ::- from the last intersection by the price level of the candidate for point 3 (inclusive) (if came from 1.2.1.), or :: - from the starting point of the chart (if came from 1.2.2.), or <br /> :: - from 300 bars(if came from 1.2.3.) <br /> :: to point 3 (excluding).<br /> :: '''1.3.1.''' Absolute extreme found. The candidate for point 3 is confirmed; moreover, the found confirming extreme is the assumed (if coming from 1.2.2. or 1.2.3.) starting point of the preceding trend.'''<br /> ::The program checks for the absence of extremes equal to point 3 between the assumed starting point of the previous trend and point 3. <br /> :::'''1.3.1.1.''' If such an extreme is found, this candidate for point 3 is discarded, and this point 3 is discarded. <br /> :::'''1.3.1.2.''' If such an extreme is not found, the program proceeds to step 2.<br /> ::'''1.3.2.''' Absolute extreme not found. This point 3 is discarded.'''<br /> ::Simultaneously with step 1, the program launches the search for the next potential point 3.<br /> <br /> ==='''Step II. Search For Potentioal Points 5 and 4 ''' ===<br /> '''The Orientation rule (N1 requirement) for Algorithm II is as follows:'''<br /> If point 3 is low, then the level of point 5 should be higher than point 3. <br /> If point 3 is high, then the level of point 5 should be lower than point 3.<br /> '''Search for Point 5.''' The bar following the bar of Point 3 (and in repeated applications of this step - the bar specified in this algorithm) is checked for not overcoming the level of point 3 (since N1 requirement for Algorithm II must be observed).<br /> :'''2.1.''' If the price has overcome the level of point 3, the program discards the considered step 3 (due to N1 requirement).<br /> :'''2.2.''' If N1 requirement is met for the analyzed bar, it is checked for compliance with N1 requirement as a potential point 5 (hereafter - point 5 or t.5).<br /> ::'''2.2.1.''' If the analyzed bar is not an extreme according to N1 requirement (as a potential point 5), the program checks the next bar from the beginning of step 2.<br /> ::'''2.2.2.''' If the analyzed bar is determined as an extreme according to N1 requirement (as a potential point 5), then this bar is checked for reaching (but not necessarily overcoming) the level of point 3. There are 2 options:<br /> :::'''2.2.2.1.''' If the level of point 3 is reached, the program analyzes the next bar according to this step (i.e., from the beginning of step 2).<br /> :::'''2.2.2.2.''' If the level of point 3 is not reached, the analyzed bar is a potential point 5, and the program moves to substep 2.3.<br /> :'''2.3. Search for Point 4.''' The program searches for a bar, which was the last to cross the level of the considered potential point 5. Let's denote this bar as lcb5 (line-crossing-bar-5). If lcb5 coincides with the bar of point 3, we denote the bar following lcb5 as look4. Otherwise, look4 = lcb5. The program searches for a bar with the maximum (if point 3 is low) or minimum (if point 3 is high) price in the interval from lcb5 to potential point 5. Then this bar is checked for being an extreme according to N1 requirement as a potential pont 4 (hereafter – point 4 or t.4). There are 2 options:<br /> ::'''2.3.1.''' The bar is an absolute extreme (as a potential point 4). In this case, potential point 4 is found.<br /> :::'''2.3.1.1.''' If step 2 has already been determined (this is possible when this step is triggered during the search for an alternative model), the program checks the line chart for extra points in the section from step 2 to step 4. There are 2 options:<br /> ::::'''2.3.1.1.A.''' If extra points are found, the program processes the next bar after potential point 5 according to step 2.<br /> ::::'''2.3.1.1.B.''' Extra intersections are not found; the program moves to substep 2.4.<br /> :::'''2.3.1.2.''' If substep 2.3.1. is triggered during the search for the basic model, the program moves to substep 2.4.<br /> ::'''2.3.2.''' The bar is not an absolute extreme (as a potential point 4). In this case, the program looks for another candidate for point 5 according to this step (i.e., according to step 2).<br /> If the program has processed 50 bars in a row according to this step (step 2), and the program has not moved to another step of the algorithm, then this potential point 3 is discarded.<br /> If there are 150 or more bars&lt;ref&gt;Continuous search range of t.5 in one iteration for EAM model&lt;/ref&gt; between potential point 3 and the analyzed bar, and potential points 4 and 5 are not found, then this potential point 3 is discarded.<br /> :'''2.4.''' Real-Time Verification of t.5 <br /> :The potential t.5 bar is checked for the presence of bars between the analyzed bar and the potential t.4 bar, which contain price values more distant (or even equally distant) from the potential t.4 than the most distant from t.4 value of the analyzed bar. This is a check of the potential t.5 for beeing the '''potential absolute extreme'''. The following options are possible:<br /> ::'''2.4.1.''' If the extreme is potentially absolute, the program proceeds to step 3.<br /> ::'''2.4.2.''' If the extreme is not potentially absolute, the program checks the next bar starting from this step (i.e., step 2).<br /> <br /> ===''' Step III. Confirmation of Point 4. Searching for Alternative t.5 and t.5&quot; '''===<br /> The program checks whether the bar of potential t.5 has reached the level of t.4. Two scenarios are possible:<br /> :'''3.1.''' The Bar of Potential t.5 Has Reached t.4.<br /> :In this case:<br /> ::The model is built through absolute t.5.<br /> ::The t.5 bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> ::Point 4 is confirmed,<br /> ::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3 (since there is already possible to display the model through t.5 on the chart).<br /> :'''3.2.''' The Bar of Potential t.5 Has Not Reached t.4. <br /> :In this case, the program checks the next bar for reaching the level of t.4. The following options are possible:<br /> ::'''3.2.1. The Considered Bar Reaches the Level of Potential t.4. <br /> ::In this case:<br /> :::The model is built through absolute t.5.<br /> :::The considered bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> :::Point 4 is confirmed,<br /> :::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3.ext, but first goes through sub-step 3.3.<br /> ::'''3.2.2.''' The Considered Bar Does Not Reach the Level of t.4.<br /> ::In this case the program checks the next bar for overcoming the level of potential t.5. Two scenarios are possible:<br /> :::'''3.2.2.1.''' If the t.5 level is overcome, the analyzed bar is considered as a new potential t.5. The program processes this bar according to step 2.<br /> :::'''3.2.2.2.''' If the t.5 level is not overcome, the analyzed bar is checked for reaching the level of t.4 according to sub-step 3.2.<br /> ::In parallel (i.e., an additional branch is created), the program proceeds to sub-step 3.3 (since there is already an option to display the model through t.5 on the chart). The model in this branch receives a &quot;draw_flag&quot; label.<br /> :'''3.3.''' Construction of the Trend Line (TL). <br /> :A Trend Line (TL) is constructed from t.3 to t.5. Each bar between t.3 and t.5 is checked for breaking the TL. Two scenarios are possible:<br /> ::'''3.3.1.'''The Price Crosses the TL. <br /> ::In this case, the TL through t.3 is not constructed. The program searches for a candidate for point 3' (hereafter - t.3'). T.3' is selected in such a way that the TL' (constructed from t.3' to t.5) is not crossed by the price in the 3-5 segment. Rule No.1 for t.3' is not applied. T.3' cannot belong to the same bar as t.4. Two scenarios are possible:<br /> :::'''3.3.1.1.''' T.3' is found, this model is classified as built through t.3'. The program proceeds to step 4, or to sub-step 3.3.extended if coming from 3.2.<br /> :::'''3.3.1.2.''' T.3' is not found. In this case, the program searches for new potential t.5 and t.4 according to step 2.<br /> ::'''3.3.2.''' The Price Does Not Break the TL. <br /> ::In this case, this model is classified as built through t.3 (absolute extreme). The program proceeds to step 4, or to sub-step 3.3.ext. if current algorithm line is coming from 3.2.<br /> <br /> <br /> ::'''3.3.ext. Additional Trend Line Construction Through t.5&quot;.'''<br /> ::If:<br /> ::*The t.5 bar does not exceed the range of t.4;<br /> ::*At the time of model calculation, the level of t.4 is confirmed, then this model is checked for the possibility of constructing an additional Trend Line (TL) through t.5&quot;. Note: If t.4 is not confirmed, this model should be recalculated upon the appearance of a bar that confirms it's t.4.<br /> <br /> ::''' Definition: Point 5&quot; '''<br /> ::Point 5&quot; can lie in the segment between t.5 and the point confirming t.4. On this segment, a point is searched that meets the following requirements:<br /> <br /> ::''' Rule for Selecting Point 5&quot; High '''<br /> ::To the left of the bar containing t.5&quot;, the nearest high should be above the level of t.5.<br /> ::To the right of t.5&quot;, at least one nearest high should be below or equal to t.5. ::If the nearest high is equal to the level of t.5, then the next high should again be below or equal to the level of t.5, until at least one bar is strictly below the level of t.5.<br /> <br /> ::''' Rule for Selecting Point 5&quot; Low '''<br /> ::To the left of the bar containing t.5&quot;, the nearest low should be below the level of the extreme.<br /> ::To the right of t.5&quot;, at least one nearest low should be above or equal to t.5. If the nearest low is equal to the level of t.5, then the next low should again be above or equal to the level of t.5, until at least one bar is strictly above the level of t.5.<br /> <br /> ::''' Special Cases for Point 5&quot; '''<br /> ::Point 5&quot; may belong to a bar that has broken the level of t.4 (but only the first of such bars). If the bar of potential t.5&quot; breaks the level of calculated t.6 from t.5, then it is impossible to construct a TL through t.5&quot; for this model (this model does not contain such a point).<br /> <br /> :::'''3.3.ext.1.''' Additional TL Calculation <br /> :::If a bar is found that fits the rule for selecting 5&quot;, an additional TL is calculated for the potential t.5&quot; (hereafter TL&quot;). This line is checked for the absence of breaks in the segment from t.3/3'' to potential t.5&quot;.<br /> <br /> :::::'''3.3ext.1.a.''' If there is an intersection, the program moves to check the next bar as a potential t.5&quot;.<br /> <br /> :::::'''3.3ext.1.b.''' If there is no intersection, the found bar is compared with the previous candidate for t.5&quot; (if there was one in the previous iteration of the cycle). If the considered bar is closer to the level of t.4 than the candidate for t.5&quot;, then the considered bar becomes the new candidate for t.5&quot;.<br /> :::The check of bars continues in a cycle until a bar confirming t.4 is reached. If a candidate for t.5 is found as a result of the check, the program moves to sub-step 3.3ext.1.1; otherwise, it moves to step 4.<br /> ::::'''3.3ext.1.1.''' If the analyzed model is built through t.3', a candidate for t.3&quot; is sought in the segment t.3-t.3', through which such a line to t.5&quot; can be built that will not have price intersections in the segment t.3-t.3&quot;.<br /> :::::'''3.3ext.1.1.1.''' If a candidate for t.3&quot; is found, where there are no intersections, a check is made for the intersection of TL&quot; by the bar following t.5&quot;.<br /> ::::::'''3.3.ext.1.1.1.A.''' If there are intersections, t.5&quot; is declared canceled, and the next one is sought according to sub-step 3.3.ext.<br /> ::::::'''3.3.ext.1.1.1.B.''' Otherwise, the program moves to step 13.2.<br /> :::::'''3.3.ext.1.1.2.''' If a suitable t.3&quot; is not found, a re-search for a candidate for t.5&quot; is carried out according to sub-steps 3.3.ext., but in this case, if a candidate for t.5&quot; was found, it becomes a canceled candidate for t.5&quot;. The new candidate must already be further from t.4 than the previously discarded ones.<br /> ::::'''3.3ext.1.2.''' If the analyzed model is built through t.3, a check is made for the intersection of TL'' by the bar following t.5&quot;.<br /> :::::'''3.3ext.1.2.A.''' If there are intersections, t.5&quot; is declared as canceled t.5', and the next one is sought according to sub-step 3.3.ext.<br /> :::::'''3.3ext.1.2.B.''' If there are no intersections, the algorithm moves to step 13.2.<br /> :::'''3.3.ext.2.''' TL'' is checked for price intersections in the segment between t.5 (inclusive) and potential t.5&quot; (hereafter segment 5-5&quot;).<br /> ::::'''3.3.ext.2.1.''' If there is an intersection, then this 5&quot; is filtered out. A re-search for a candidate for t.5&quot; is carried out according to sub-steps 3.3.ext., but in this case, the new candidate must already be further from t.4 (in terms of time) than the previously discarded ones.<br /> ::::'''3.3.ext.2.2.''' If there are no intersections of TL&quot; in the segment 5-5&quot;, then t.5&quot; is found.<br /> ::::In this case, the report displays: EAM5&quot; EAM5&quot;<br /> ::::The program moves to step 4.<br /> ::::'''3.3.ext.2.3.''' If t.5&quot; is not found, the program moves to step 4.<br /> <br /> ==='''Step IV: Searching for Potential Foundation Blocks.'''===<br /> <br /> ====Initial Check====<br /> First, it is necessary to check for the presence of a fixed t.2. If it exists, it means we are in a branch for searching for alternative models.<br /> <br /> ::'''4.0.1.''' If t.2 is defined in the model, proceed to step 6.<br /> ::'''4.0.2.''' If t.2 is not defined, the program moves to step 4.1.<br /> ====Examination of Extremes====<br /> On the preceding trend, extremes are checked sequentially from right to left (i.e., into the past) from t.3 (or from another analyzed bar in repeated applications of this step) according to the N1 bar rule (as a candidate for t.2). Each found candidate for t.2 is checked for the presence of a confirming extreme (which also serves as t.1) according to the following algorithm:<br /> <br /> ::'''4.1.0.''' An extreme candidate for t.2 is found.<br /> ::'''4.1.1.''' The point of the last intersection &lt;ref&gt;High or low of a bar, repeating or crossing high or low of t.2 bar – is an intersection&lt;/ref&gt; of the candidate's level with the price is found. In this case, the program looks for the absolute maximum (if t.2 is a minimum, i.e., t.2 is low) or the absolute minimum (if t.2 is a maximum, i.e., t.2 is high) in the segment from the last intersection of the t.2 level with the price to t.2.<br /> :::'''4.1.1.1.''' Maximum/minimum not found. In this case, the program discards this candidate for t.2.<br /> :::'''4.1.1.2.''' Maximum/minimum found. In this case, the potential t.2 is confirmed.<br /> :::'''4.1.2.''' The program reaches the starting point of the chart.<br /> :::'''4.1.3.''' The check reaches the boundary of the Depth of Search for t.1 &lt;ref&gt;&quot;Search depth t.1 for EAM models&quot; is set in the Calculation Parameters. It is calculated in bars from the bar of the considered potential t.2. By default, this value is 50 bars.&lt;/ref&gt; for the model and none of the above events (4.1.1. or 4.1.2.) occurred.<br /> <br /> ::'''4.2.''' The search for Foundation Blocks (i.e., points 1 and 2, a.k.a FB) continues until one of the events in steps 4.2.A, 4.2.B or 4.2.C. occurs.<br /> :::'''4.2.A. The check reaches the bar containing the (presumed) starting point of the preceding trend (from sub-step 1.2.2.1.). This point is not considered as a potential t.2<br /> :::'''4.2.B.''' The check reaches the bar that intersects the level of the presumed point 4 of the considered model.<br /> :::'''4.2.C.''' A bar that is located at a distance (by time) from T.3 greater than or equal to X* (distance from T.3 to t.4), where x is the parameter set in the settings &lt;ref&gt; This is the &quot;Time Ratio of 23 to 24&quot;(by default it is 3)&lt;/ref&gt;.<br /> ::=== Results ===<br /> ::As a result of the search for potential t.2 (i.e., upon the occurrence of4.2.A, 4.2.B or 4.2.C.), two scenarios are possible:<br /> :::'''4.2.1. ''' One or more pairs of potential t.2 and t.1 are found (potential Foundation Blocks). The program moves to step 5.<br /> :::'''4.2.2. ''' No potential Foundation Blocks are found. In this case, the program looks for the next potential t.5 according to step 2.<br /> <br /> === '''Step V. Search for Presupposition''' ===<br /> Presupposition is an optional part of the EAM.<br /> The program attempts to construct Presuppositions from all available candidates for t.2.<br /> <br /> ==== Presupposition Search Algorithm ====<br /> The program takes each potential t.2 of the EAM (as part of a potential FB) as a t.1 of Presupposition (hereinafter t.1p). In other words, the program tries to construct Presuppositions from each of the t.2.<br /> <br /> Initially, the most recent (rightmost) potential t.2 (or the one specified in the algorithm if we have returned to the beginning of the Step V in the cycle) in the EAM is taken as a potential t.1p. If there are no more unconfirmed t.1p, the algorithm proceeds to Step 6.<br /> <br /> : '''5.1.''' The program sequentially checks bars from left to right (into the future) from the potential t.1p to t.3 of EAM model (excluding t.3) for being an extreme according to the N1 rule as point 3 of the Presupposition (hereinafter t.3p).<br /> <br /> : '''N1 rule for the Presupposition points'''<br /> : If t.1p is low, t.3p must be below t.1p.<br /> : If t.1p is high, t.3p must be above t.1p.<br /> <br /> :: '''5.1.1.''' If the potential t.3p is not found, the program considers the next (to the left of the previous) potential t.2 of the EAM (within the FB) as t.1p.<br /> :: If the potential t.3p is not found, and there are no more potential FBs, the algorithm proceeds to Step 6.<br /> :: '''5.1.2.''' Once the potential t.3p is found, the program searches for point 2 of the Presupposition (hereinafter t.2p) as an extreme with the maximum/minimum price on the segment from t.1p to t.3p (hereinafter segment 1p-3p).<br /> :: If a suitable extreme is not found, the algorithm looks for the next potential t.3p for the previously found t.1p.<br /> :: If a maximum/minimum is found, it is checked for for being an extreme (as t.2p).<br /> :: There are two possibilities:<br /> ::: '''5.1.2.1.''' The bar is an absolute extreme. In this case, a potential t.2p is found, and the program proceeds to step 5.2.<br /> ::: '''5.1.2.2.''' The bar is not an extreme. In this case, the program looks for another candidate for t.3p for the previously found t.1p following the instructions in 5.1.<br /> : '''5.2.''' The program constructs a line from t.1p to t.3p and checks it for price crossings on the segment from t.1p to t.3 of the EAM (including t.3 of EAM).<br /> :: '''5.2.1.''' If this lines price crossings are found, the program looks for a new candidate for t.3p for the previously found t.1p following the instructions in sub-step 5.1.<br /> :: '''5.2.2.''' If there are no price crossings, the program proceeds to sub-step 5.3.<br /> <br /> : '''5.3.''' The program searches for a potential point 4 of the Presupposition (t.4p) according to the N1 rule on the segment from t.3p to t.3 in the VMP (including t.3).<br /> <br /> : If t.1p is low, t.4p must be below t.2p. Each subsequent candidate for t.4p must be below the previous candidate for t.4p.<br /> : If t.1p is high, t.4p must be above t.2p. Each subsequent candidate for t.4p must be above the previous candidate for t.4p.<br /> : Possible scenarios:<br /> :: '''5.3.A.''' If the potential t.4p coincides with t.3 in the EAM, t.4p is confirmed (found), and the program proceeds to sub-step 5.3.1.<br /> :: '''5.3.B.''' If the potential t.4p does not coincide with t.3 in the EAM (i.e., it is located before it), the program looks for an opposite-direction potential t.4p extreme on the segment from the potential t.4p (excluding it) to the bar where the price again reached the value of the potential t.4p (excluding it).<br /> <br /> :: There are two possibilities:<br /> ::: '''5.3.B.1.''' If the opposite-direction extreme is found, t.4p is confirmed (found), and the program proceeds to sub-step 5.3.1.<br /> ::: '''5.3.B.2.''' If the opposite-direction extreme is not found, the program looks for a new potential t.4p following the instructions in sub-step 5.3.1.<br /> :: '''5.3.1.''' If t.4p is found, the program constructs a line from t.2p to t.4p and checks it for price crossings on the segment from t.1p (excluding it) to t.3 in the VMP (including t.3).<br /> ::: If unnecessary intersections are found, the program looks for the next potential t.4p on the segment following the instructions in 5.3.<br /> ::: If no unnecessary intersections are found, the algorithm proceeds to sub-step 5.4.<br /> :: '''5.3.2.''' Check for Absolute Level<br /> :: The program checks the bar of the potential t.3p for absoluteness. The level of t.3p should not be exceeded by the price on the segment between t.3p and potential t.4p (excluding it).<br /> ::: '''5.3.2.1.''' If the level of t.3p is exceeded, the potential t.3p is discarded, and the program looks for a new t.3p following the instructions in sub-step 5.1. and further according to the algorithm.<br /> <br /> :::: '''5.3.2.2.''' If the level of t.3p is not exceeded, t.3p is confirmed, t.4p is confirmed, and the algorithm proceeds to sub- step 5.4.<br /> <br /> ==== Presupposition Verification ====<br /> : ''' 5.4.''' Presuppositions undergo the following checks:<br /> :: '''A.''' - Bars t.1p, t.2p, t.3p must follow each other.<br /> :: '''B.''' - The distance in levels between t.1 and t.2 (hereinafter rank 12) must be at least the value of the Minimum Distance between t.1 and t.2 Levels of the Presupposition, which is set in the Calculation Parameters, from the distance between t.4 and t.5 levels of the EAM model(this is rank 45).<br /> <br /> :: If all checks are successful, the Presupposition is found. If there are no unchecked t.1p left, the algorithm proceeds to Step 6.<br /> <br /> :: If there are no unchecked t.1p left, the algorithm proceeds to Step 6.<br /> <br /> === '''Step VI. Check for AL price crossings''' ===<br /> <br /> ==== '''6 alfa.''' ==== <br /> First it is necessary to check for the presence of a fixed t.2. If it exists, it means we are in a branch of searching for alternative models. <br /> <br /> The potential Aims Line (from t.2 to t.4), hereinafter referred to as AL, is calculated, and then:<br /> : '''6 alfa.1.''' AL Crossing Check<br /> <br /> :: '''6 alfa.1. A.''' - If there are no AL price crossings, the algorithm proceeds to step 6 alfa.2.<br /> :: '''6 alfa.1. B.''' - If AL is crossed, the next potential t.5 is determined according to Step 2, starting from bar t.5+2.<br /> : '''6.2. alfa.''' Distance Check for AL and TL Intersection<br /> : If:<br /> :: - TL and AL of the model do not intersect on the right (in the future) or<br /> :: - the ratio of the distance in bars between t.2 and t.4 to the distance between t.4 and the calculated point 6 is less than the default value of the parameter &quot;Minimum ratio of t.2-t.4 to t.4-t.6 EAM,&quot; then the search for alternative models is terminated. Otherwise, the program proceeds to Step 9. <br /> <br /> ====''' In the general case (no precviously fixed t.2)''' ====<br /> The program performs the following checks for each of the potential FBs:<br /> : '''6.1.''' AL Price Crossing Check (not just touching)<br /> : If AL intersects with the price on the segment between t.2 and t.4, this pair of candidates for t.1 and t.2 (this FB) is rejected.<br /> :: '''6.1.A.''' If FBs are found that give AL without intersections, the algorithm proceeds to step 6.2.<br /> :: '''6.1.B.''' If there are no suitable FBs, the algorithm looks for a new t.5 according to Step 2.<br /> <br /> : '''6.2.''' Checking for intersection of AL and TL (hereinafter referred to as calculated point 6) with each other on the right (in the future) along the time axis.<br /> : If the ratio of the distance in bars between t.2 and t.4 to the distance between t.4 and the calculated t.6 is less than the default value of the parameter &quot;Minimum ratio of t.2-t.4 to t.4-t.6 VMP,&quot; then these candidates for t.1 and t.2 are rejected.<br /> : The following scenarios are possible:<br /> :: '''6.2.A.''' One or several potential FBs remain - in this case, the program proceeds to Step 7.<br /> :: '''6.2.B.''' There are no potential FBs left - in this case, the program looks for a new potential t.5, starting from Step 2 and onwards.<br /> <br /> === '''Step VII. Dtermintaion of FB's with and without 2X5''' ===<br /> <br /> The program checks for the intersection of the bodies of candles at t.2 and t.5 (hereinafter referred to as 2x5). If there is only one potential FB, determining FB with 2x5 is not required, and the program proceeds to Step 8.<br /> <br /> :'''7.1.''' If there are multiple potential BOs, some of which have 2x5 and some do not, those potential BOs that have 2x5 are filtered out, and the program proceeds to Step 8.<br /> <br /> :'''7.2.''' If all potential FBs have 2x5, then all are filtered out except the one whose t.2 level is closer to the t.3 level. The program proceeds to <br /> <br /> === '''Step VIII: Filtering Based on Presupposition''' ===<br /> <br /> The algorithm checks whether Presuppositions have been found for the analyzed model.<br /> <br /> :'''8.0.''' If no Presuppositions are found, the program proceeds to Step 9.<br /> <br /> :'''8.1.''' The model has one or more Presuppositions. For each Presupposition program checks if the available candidates for t.2 belong to the interval between the last price level intersection of t.1p and t.1p itself (t.1p can also be used as t.2 EAM).<br /> <br /> ::'''8.1.1.''' There are candidates for t.2 that belong to the interval between the last price level intersection of t.1p and t.1p itself. Such a Presupposition is retained.<br /> ::'''8.1.2.''' There are no candidates for t.2 within the specified interval. In this case, such a Presupposition is discarded and not further considered (meaning the model has no Presupposition).<br /> :'''8.2.''' If after checking all Presuppositions according to sub-step 8.1., there are one or more Presuppositions with candidates in t.2 within the interval between the last price level intersection of t.1p and t.1p itself (inclusive), then:<br /> <br /> : - Among such Presuppositions, only the one with t.1p occurring later on the time axis is considered further;<br /> : - Only those candidates that belong to the interval between the last price level intersection of t.1p and t.1p itself are retained as t.2 candidates for the remaining Presupposition.<br /> ::'''8.2.1.''' If only one potential FB remains, the model is confirmed.<br /> ::'''8.2.2.''' If more than one potential FB remains, the program proceeds to Step 9.<br /> <br /> === '''Step IX. Search for Embedded Models in EAM''' ===<br /> <br /> :'''9.1.''' If EAM is constructed through t.3', then the interval from EAM's t.3 is checked for the presence of models according to Algorithm I, for which the following conditions are simultaneously satisfied. In the paragraph below, the numbers I and II in parentheses next to the model points denote the algorithm to which the model with this point belongs:<br /> <br /> : - If the model according to Algorithm I contains t.5, then its t.5 should precede or coincide with the t.5 of the analyzed EAM.<br /> : - t.4 does not lie beyond t.4 of the analyzed EAM; (bar of t.4(I) cannot coincide with bar of t.3(II), but can coincide with bar of t.4(II);<br /> : -t.1 lies before t.3' of the analyzed model (if it coincides with bar of t.3', then it is not suitable anymore) (t.1(I) can coincide with t.3(II), but cannot coincide with t.3'(II)<br /> <br /> If there are more than 5 models, those with the time distance from t.1 to t.4 greater than others are considered embedded models.<br /> <br /> ::'''9.1.1.''' If models are not found, then EAM does not have an embedded primary model.<br /> <br /> ::'''9.1.2.''' If the model/s is/are found, EAM is given the status of &quot;Models described near the Primary model.&quot;<br /> <br /> ::'''9.1.3.''' If EAM has one or more embedded models, models among them built from EAM's t.3 are searched for meeting one of the following criteria:<br /> <br /> ::: A. Having a trendline breakthrough in the interval before t.3' of the analyzed model;<br /> ::: B. Having an intersection of candle bodies at points 2 and 5 (hereinafter 2x5).<br /> ::: C. If the embedded model has a rank 45 greater than the ranks of 12 and 25 of the same model.<br /> ::: '''9.1.3.1.''' In the presence of one of these criteria, the model is Specific based on the 1st criterion.<br /> ::: '''9.1.3.2.''' In the absence of the specified criteria, the model is Normal based on the 1st criterion.<br /> <br /> :: '''9.1.4.''' If there is a model according to Algorithm I on the interval from t.3 to t.3' of the EAM, aligned with the preceding EAM trend, and with points t.1-t.4 lying on the interval 3-3' EAM (inclusive), then this EAM is Specific based on the 2nd criterion. <br /> :: In the absence of the specified criteria, the model is Normal based on the 2nd criterion.<br /> <br /> : Upon completion of all checks in step 9.1., the program proceeds to step 10.<br /> <br /> :'''9.2.''' If EAM is constructed through t.3, the program proceeds to step 10.<br /> <br /> ==References==<br /> &lt;references /&gt;</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_II&diff=205 2024-01-03T22:58:13Z

<p>Admin: /* Step IX. Search for Embedded Models in VMP */</p> <hr /> <div>This article is not finished<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with UMG General Concepts.<br /> <br /> ==='''Step I. Search For Point 3 of the External Attraction Model (EAM) and the Sarting Point of the Previous Trend.'''===<br /> : '''1.1.''' The program looks for the first possible extreme, satisfying Single Bar Rule. Such an extreme is a candidate for potential point 3 ( potential t.3).<br /> : '''1.2.''' Next, the program checks the bars from right to left (i.e., in the past) from the bar containing the extreme candidate for point 3 to one of the following events:<br /> :: '''1.2.1.''' Found the last intersection (breakthrough) point by the price level of the candidate for point 3.<br /> ::In this case, the report displays: <br /> :: PREVdata: FullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.2.''' The program reached the starting point of the chart (i.e., the price did not intersect the level of point 3 after the starting point of the chart).<br /> ::In this case, the report displays: <br /> :: PREVdata: NoFullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.3.''' The price checked 300 bars preceding point 3 &lt;ref&gt;The depth of the search for the extreme confirming point 3 of EAM model&lt;/ref&gt;, but the level of step 3 did not intersect at this segment. The program looks for an absolute extreme (opposite to step 3) on the segment from the 300th bar before point 3 to point 3. The program proceeds to substep 1.3.<br /> : '''1.3.''' The program looks for an absolute extreme (opposite to point 3 extreme) on the segment:<br /> ::- from the last intersection by the price level of the candidate for point 3 (inclusive) (if came from 1.2.1.), or :: - from the starting point of the chart (if came from 1.2.2.), or <br /> :: - from 300 bars(if came from 1.2.3.) <br /> :: to point 3 (excluding).<br /> :: '''1.3.1.''' Absolute extreme found. The candidate for point 3 is confirmed; moreover, the found confirming extreme is the assumed (if coming from 1.2.2. or 1.2.3.) starting point of the preceding trend.'''<br /> ::The program checks for the absence of extremes equal to point 3 between the assumed starting point of the previous trend and point 3. <br /> :::'''1.3.1.1.''' If such an extreme is found, this candidate for point 3 is discarded, and this point 3 is discarded. <br /> :::'''1.3.1.2.''' If such an extreme is not found, the program proceeds to step 2.<br /> ::'''1.3.2.''' Absolute extreme not found. This point 3 is discarded.'''<br /> ::Simultaneously with step 1, the program launches the search for the next potential point 3.<br /> <br /> ==='''Step II. Search For Potentioal Points 5 and 4 ''' ===<br /> '''The Orientation rule (N1 requirement) for Algorithm II is as follows:'''<br /> If point 3 is low, then the level of point 5 should be higher than point 3. <br /> If point 3 is high, then the level of point 5 should be lower than point 3.<br /> '''Search for Point 5.''' The bar following the bar of Point 3 (and in repeated applications of this step - the bar specified in this algorithm) is checked for not overcoming the level of point 3 (since N1 requirement for Algorithm II must be observed).<br /> :'''2.1.''' If the price has overcome the level of point 3, the program discards the considered step 3 (due to N1 requirement).<br /> :'''2.2.''' If N1 requirement is met for the analyzed bar, it is checked for compliance with N1 requirement as a potential point 5 (hereafter - point 5 or t.5).<br /> ::'''2.2.1.''' If the analyzed bar is not an extreme according to N1 requirement (as a potential point 5), the program checks the next bar from the beginning of step 2.<br /> ::'''2.2.2.''' If the analyzed bar is determined as an extreme according to N1 requirement (as a potential point 5), then this bar is checked for reaching (but not necessarily overcoming) the level of point 3. There are 2 options:<br /> :::'''2.2.2.1.''' If the level of point 3 is reached, the program analyzes the next bar according to this step (i.e., from the beginning of step 2).<br /> :::'''2.2.2.2.''' If the level of point 3 is not reached, the analyzed bar is a potential point 5, and the program moves to substep 2.3.<br /> :'''2.3. Search for Point 4.''' The program searches for a bar, which was the last to cross the level of the considered potential point 5. Let's denote this bar as lcb5 (line-crossing-bar-5). If lcb5 coincides with the bar of point 3, we denote the bar following lcb5 as look4. Otherwise, look4 = lcb5. The program searches for a bar with the maximum (if point 3 is low) or minimum (if point 3 is high) price in the interval from lcb5 to potential point 5. Then this bar is checked for being an extreme according to N1 requirement as a potential pont 4 (hereafter – point 4 or t.4). There are 2 options:<br /> ::'''2.3.1.''' The bar is an absolute extreme (as a potential point 4). In this case, potential point 4 is found.<br /> :::'''2.3.1.1.''' If step 2 has already been determined (this is possible when this step is triggered during the search for an alternative model), the program checks the line chart for extra points in the section from step 2 to step 4. There are 2 options:<br /> ::::'''2.3.1.1.A.''' If extra points are found, the program processes the next bar after potential point 5 according to step 2.<br /> ::::'''2.3.1.1.B.''' Extra intersections are not found; the program moves to substep 2.4.<br /> :::'''2.3.1.2.''' If substep 2.3.1. is triggered during the search for the basic model, the program moves to substep 2.4.<br /> ::'''2.3.2.''' The bar is not an absolute extreme (as a potential point 4). In this case, the program looks for another candidate for point 5 according to this step (i.e., according to step 2).<br /> If the program has processed 50 bars in a row according to this step (step 2), and the program has not moved to another step of the algorithm, then this potential point 3 is discarded.<br /> If there are 150 or more bars&lt;ref&gt;Continuous search range of t.5 in one iteration for EAM model&lt;/ref&gt; between potential point 3 and the analyzed bar, and potential points 4 and 5 are not found, then this potential point 3 is discarded.<br /> :'''2.4.''' Real-Time Verification of t.5 <br /> :The potential t.5 bar is checked for the presence of bars between the analyzed bar and the potential t.4 bar, which contain price values more distant (or even equally distant) from the potential t.4 than the most distant from t.4 value of the analyzed bar. This is a check of the potential t.5 for beeing the '''potential absolute extreme'''. The following options are possible:<br /> ::'''2.4.1.''' If the extreme is potentially absolute, the program proceeds to step 3.<br /> ::'''2.4.2.''' If the extreme is not potentially absolute, the program checks the next bar starting from this step (i.e., step 2).<br /> <br /> ===''' Step III. Confirmation of Point 4. Searching for Alternative t.5 and t.5&quot; '''===<br /> The program checks whether the bar of potential t.5 has reached the level of t.4. Two scenarios are possible:<br /> :'''3.1.''' The Bar of Potential t.5 Has Reached t.4.<br /> :In this case:<br /> ::The model is built through absolute t.5.<br /> ::The t.5 bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> ::Point 4 is confirmed,<br /> ::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3 (since there is already possible to display the model through t.5 on the chart).<br /> :'''3.2.''' The Bar of Potential t.5 Has Not Reached t.4. <br /> :In this case, the program checks the next bar for reaching the level of t.4. The following options are possible:<br /> ::'''3.2.1. The Considered Bar Reaches the Level of Potential t.4. <br /> ::In this case:<br /> :::The model is built through absolute t.5.<br /> :::The considered bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> :::Point 4 is confirmed,<br /> :::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3.ext, but first goes through sub-step 3.3.<br /> ::'''3.2.2.''' The Considered Bar Does Not Reach the Level of t.4.<br /> ::In this case the program checks the next bar for overcoming the level of potential t.5. Two scenarios are possible:<br /> :::'''3.2.2.1.''' If the t.5 level is overcome, the analyzed bar is considered as a new potential t.5. The program processes this bar according to step 2.<br /> :::'''3.2.2.2.''' If the t.5 level is not overcome, the analyzed bar is checked for reaching the level of t.4 according to sub-step 3.2.<br /> ::In parallel (i.e., an additional branch is created), the program proceeds to sub-step 3.3 (since there is already an option to display the model through t.5 on the chart). The model in this branch receives a &quot;draw_flag&quot; label.<br /> :'''3.3.''' Construction of the Trend Line (TL). <br /> :A Trend Line (TL) is constructed from t.3 to t.5. Each bar between t.3 and t.5 is checked for breaking the TL. Two scenarios are possible:<br /> ::'''3.3.1.'''The Price Crosses the TL. <br /> ::In this case, the TL through t.3 is not constructed. The program searches for a candidate for point 3' (hereafter - t.3'). T.3' is selected in such a way that the TL' (constructed from t.3' to t.5) is not crossed by the price in the 3-5 segment. Rule No.1 for t.3' is not applied. T.3' cannot belong to the same bar as t.4. Two scenarios are possible:<br /> :::'''3.3.1.1.''' T.3' is found, this model is classified as built through t.3'. The program proceeds to step 4, or to sub-step 3.3.extended if coming from 3.2.<br /> :::'''3.3.1.2.''' T.3' is not found. In this case, the program searches for new potential t.5 and t.4 according to step 2.<br /> ::'''3.3.2.''' The Price Does Not Break the TL. <br /> ::In this case, this model is classified as built through t.3 (absolute extreme). The program proceeds to step 4, or to sub-step 3.3.ext. if current algorithm line is coming from 3.2.<br /> <br /> <br /> ::'''3.3.ext. Additional Trend Line Construction Through t.5&quot;.'''<br /> ::If:<br /> ::*The t.5 bar does not exceed the range of t.4;<br /> ::*At the time of model calculation, the level of t.4 is confirmed, then this model is checked for the possibility of constructing an additional Trend Line (TL) through t.5&quot;. Note: If t.4 is not confirmed, this model should be recalculated upon the appearance of a bar that confirms it's t.4.<br /> <br /> ::''' Definition: Point 5&quot; '''<br /> ::Point 5&quot; can lie in the segment between t.5 and the point confirming t.4. On this segment, a point is searched that meets the following requirements:<br /> <br /> ::''' Rule for Selecting Point 5&quot; High '''<br /> ::To the left of the bar containing t.5&quot;, the nearest high should be above the level of t.5.<br /> ::To the right of t.5&quot;, at least one nearest high should be below or equal to t.5. ::If the nearest high is equal to the level of t.5, then the next high should again be below or equal to the level of t.5, until at least one bar is strictly below the level of t.5.<br /> <br /> ::''' Rule for Selecting Point 5&quot; Low '''<br /> ::To the left of the bar containing t.5&quot;, the nearest low should be below the level of the extreme.<br /> ::To the right of t.5&quot;, at least one nearest low should be above or equal to t.5. If the nearest low is equal to the level of t.5, then the next low should again be above or equal to the level of t.5, until at least one bar is strictly above the level of t.5.<br /> <br /> ::''' Special Cases for Point 5&quot; '''<br /> ::Point 5&quot; may belong to a bar that has broken the level of t.4 (but only the first of such bars). If the bar of potential t.5&quot; breaks the level of calculated t.6 from t.5, then it is impossible to construct a TL through t.5&quot; for this model (this model does not contain such a point).<br /> <br /> :::'''3.3.ext.1.''' Additional TL Calculation <br /> :::If a bar is found that fits the rule for selecting 5&quot;, an additional TL is calculated for the potential t.5&quot; (hereafter TL&quot;). This line is checked for the absence of breaks in the segment from t.3/3'' to potential t.5&quot;.<br /> <br /> :::::'''3.3ext.1.a.''' If there is an intersection, the program moves to check the next bar as a potential t.5&quot;.<br /> <br /> :::::'''3.3ext.1.b.''' If there is no intersection, the found bar is compared with the previous candidate for t.5&quot; (if there was one in the previous iteration of the cycle). If the considered bar is closer to the level of t.4 than the candidate for t.5&quot;, then the considered bar becomes the new candidate for t.5&quot;.<br /> :::The check of bars continues in a cycle until a bar confirming t.4 is reached. If a candidate for t.5 is found as a result of the check, the program moves to sub-step 3.3ext.1.1; otherwise, it moves to step 4.<br /> ::::'''3.3ext.1.1.''' If the analyzed model is built through t.3', a candidate for t.3&quot; is sought in the segment t.3-t.3', through which such a line to t.5&quot; can be built that will not have price intersections in the segment t.3-t.3&quot;.<br /> :::::'''3.3ext.1.1.1.''' If a candidate for t.3&quot; is found, where there are no intersections, a check is made for the intersection of TL&quot; by the bar following t.5&quot;.<br /> ::::::'''3.3.ext.1.1.1.A.''' If there are intersections, t.5&quot; is declared canceled, and the next one is sought according to sub-step 3.3.ext.<br /> ::::::'''3.3.ext.1.1.1.B.''' Otherwise, the program moves to step 13.2.<br /> :::::'''3.3.ext.1.1.2.''' If a suitable t.3&quot; is not found, a re-search for a candidate for t.5&quot; is carried out according to sub-steps 3.3.ext., but in this case, if a candidate for t.5&quot; was found, it becomes a canceled candidate for t.5&quot;. The new candidate must already be further from t.4 than the previously discarded ones.<br /> ::::'''3.3ext.1.2.''' If the analyzed model is built through t.3, a check is made for the intersection of TL'' by the bar following t.5&quot;.<br /> :::::'''3.3ext.1.2.A.''' If there are intersections, t.5&quot; is declared as canceled t.5', and the next one is sought according to sub-step 3.3.ext.<br /> :::::'''3.3ext.1.2.B.''' If there are no intersections, the algorithm moves to step 13.2.<br /> :::'''3.3.ext.2.''' TL'' is checked for price intersections in the segment between t.5 (inclusive) and potential t.5&quot; (hereafter segment 5-5&quot;).<br /> ::::'''3.3.ext.2.1.''' If there is an intersection, then this 5&quot; is filtered out. A re-search for a candidate for t.5&quot; is carried out according to sub-steps 3.3.ext., but in this case, the new candidate must already be further from t.4 (in terms of time) than the previously discarded ones.<br /> ::::'''3.3.ext.2.2.''' If there are no intersections of TL&quot; in the segment 5-5&quot;, then t.5&quot; is found.<br /> ::::In this case, the report displays: EAM5&quot; EAM5&quot;<br /> ::::The program moves to step 4.<br /> ::::'''3.3.ext.2.3.''' If t.5&quot; is not found, the program moves to step 4.<br /> <br /> ==='''Step IV: Searching for Potential Foundation Blocks.'''===<br /> <br /> ====Initial Check====<br /> First, it is necessary to check for the presence of a fixed t.2. If it exists, it means we are in a branch for searching for alternative models.<br /> <br /> ::'''4.0.1.''' If t.2 is defined in the model, proceed to step 6.<br /> ::'''4.0.2.''' If t.2 is not defined, the program moves to step 4.1.<br /> ====Examination of Extremes====<br /> On the preceding trend, extremes are checked sequentially from right to left (i.e., into the past) from t.3 (or from another analyzed bar in repeated applications of this step) according to the N1 bar rule (as a candidate for t.2). Each found candidate for t.2 is checked for the presence of a confirming extreme (which also serves as t.1) according to the following algorithm:<br /> <br /> ::'''4.1.0.''' An extreme candidate for t.2 is found.<br /> ::'''4.1.1.''' The point of the last intersection &lt;ref&gt;High or low of a bar, repeating or crossing high or low of t.2 bar – is an intersection&lt;/ref&gt; of the candidate's level with the price is found. In this case, the program looks for the absolute maximum (if t.2 is a minimum, i.e., t.2 is low) or the absolute minimum (if t.2 is a maximum, i.e., t.2 is high) in the segment from the last intersection of the t.2 level with the price to t.2.<br /> :::'''4.1.1.1.''' Maximum/minimum not found. In this case, the program discards this candidate for t.2.<br /> :::'''4.1.1.2.''' Maximum/minimum found. In this case, the potential t.2 is confirmed.<br /> :::'''4.1.2.''' The program reaches the starting point of the chart.<br /> :::'''4.1.3.''' The check reaches the boundary of the Depth of Search for t.1 &lt;ref&gt;&quot;Search depth t.1 for EAM models&quot; is set in the Calculation Parameters. It is calculated in bars from the bar of the considered potential t.2. By default, this value is 50 bars.&lt;/ref&gt; for the model and none of the above events (4.1.1. or 4.1.2.) occurred.<br /> <br /> ::'''4.2.''' The search for Foundation Blocks (i.e., points 1 and 2, a.k.a FB) continues until one of the events in steps 4.2.A, 4.2.B or 4.2.C. occurs.<br /> :::'''4.2.A. The check reaches the bar containing the (presumed) starting point of the preceding trend (from sub-step 1.2.2.1.). This point is not considered as a potential t.2<br /> :::'''4.2.B.''' The check reaches the bar that intersects the level of the presumed point 4 of the considered model.<br /> :::'''4.2.C.''' A bar that is located at a distance (by time) from T.3 greater than or equal to X* (distance from T.3 to t.4), where x is the parameter set in the settings &lt;ref&gt; This is the &quot;Time Ratio of 23 to 24&quot;(by default it is 3)&lt;/ref&gt;.<br /> ::=== Results ===<br /> ::As a result of the search for potential t.2 (i.e., upon the occurrence of4.2.A, 4.2.B or 4.2.C.), two scenarios are possible:<br /> :::'''4.2.1. ''' One or more pairs of potential t.2 and t.1 are found (potential Foundation Blocks). The program moves to step 5.<br /> :::'''4.2.2. ''' No potential Foundation Blocks are found. In this case, the program looks for the next potential t.5 according to step 2.<br /> <br /> === '''Step V. Search for Presupposition''' ===<br /> Presupposition is an optional part of the EAM.<br /> The program attempts to construct Presuppositions from all available candidates for t.2.<br /> <br /> ==== Presupposition Search Algorithm ====<br /> The program takes each potential t.2 of the EAM (as part of a potential FB) as a t.1 of Presupposition (hereinafter t.1p). In other words, the program tries to construct Presuppositions from each of the t.2.<br /> <br /> Initially, the most recent (rightmost) potential t.2 (or the one specified in the algorithm if we have returned to the beginning of the Step V in the cycle) in the EAM is taken as a potential t.1p. If there are no more unconfirmed t.1p, the algorithm proceeds to Step 6.<br /> <br /> : '''5.1.''' The program sequentially checks bars from left to right (into the future) from the potential t.1p to t.3 of EAM model (excluding t.3) for being an extreme according to the N1 rule as point 3 of the Presupposition (hereinafter t.3p).<br /> <br /> : '''N1 rule for the Presupposition points'''<br /> : If t.1p is low, t.3p must be below t.1p.<br /> : If t.1p is high, t.3p must be above t.1p.<br /> <br /> :: '''5.1.1.''' If the potential t.3p is not found, the program considers the next (to the left of the previous) potential t.2 of the EAM (within the FB) as t.1p.<br /> :: If the potential t.3p is not found, and there are no more potential FBs, the algorithm proceeds to Step 6.<br /> :: '''5.1.2.''' Once the potential t.3p is found, the program searches for point 2 of the Presupposition (hereinafter t.2p) as an extreme with the maximum/minimum price on the segment from t.1p to t.3p (hereinafter segment 1p-3p).<br /> :: If a suitable extreme is not found, the algorithm looks for the next potential t.3p for the previously found t.1p.<br /> :: If a maximum/minimum is found, it is checked for for being an extreme (as t.2p).<br /> :: There are two possibilities:<br /> ::: '''5.1.2.1.''' The bar is an absolute extreme. In this case, a potential t.2p is found, and the program proceeds to step 5.2.<br /> ::: '''5.1.2.2.''' The bar is not an extreme. In this case, the program looks for another candidate for t.3p for the previously found t.1p following the instructions in 5.1.<br /> : '''5.2.''' The program constructs a line from t.1p to t.3p and checks it for price crossings on the segment from t.1p to t.3 of the EAM (including t.3 of EAM).<br /> :: '''5.2.1.''' If this lines price crossings are found, the program looks for a new candidate for t.3p for the previously found t.1p following the instructions in sub-step 5.1.<br /> :: '''5.2.2.''' If there are no price crossings, the program proceeds to sub-step 5.3.<br /> <br /> : '''5.3.''' The program searches for a potential point 4 of the Presupposition (t.4p) according to the N1 rule on the segment from t.3p to t.3 in the VMP (including t.3).<br /> <br /> : If t.1p is low, t.4p must be below t.2p. Each subsequent candidate for t.4p must be below the previous candidate for t.4p.<br /> : If t.1p is high, t.4p must be above t.2p. Each subsequent candidate for t.4p must be above the previous candidate for t.4p.<br /> : Possible scenarios:<br /> :: '''5.3.A.''' If the potential t.4p coincides with t.3 in the EAM, t.4p is confirmed (found), and the program proceeds to sub-step 5.3.1.<br /> :: '''5.3.B.''' If the potential t.4p does not coincide with t.3 in the EAM (i.e., it is located before it), the program looks for an opposite-direction potential t.4p extreme on the segment from the potential t.4p (excluding it) to the bar where the price again reached the value of the potential t.4p (excluding it).<br /> <br /> :: There are two possibilities:<br /> ::: '''5.3.B.1.''' If the opposite-direction extreme is found, t.4p is confirmed (found), and the program proceeds to sub-step 5.3.1.<br /> ::: '''5.3.B.2.''' If the opposite-direction extreme is not found, the program looks for a new potential t.4p following the instructions in sub-step 5.3.1.<br /> :: '''5.3.1.''' If t.4p is found, the program constructs a line from t.2p to t.4p and checks it for price crossings on the segment from t.1p (excluding it) to t.3 in the VMP (including t.3).<br /> ::: If unnecessary intersections are found, the program looks for the next potential t.4p on the segment following the instructions in 5.3.<br /> ::: If no unnecessary intersections are found, the algorithm proceeds to sub-step 5.4.<br /> :: '''5.3.2.''' Check for Absolute Level<br /> :: The program checks the bar of the potential t.3p for absoluteness. The level of t.3p should not be exceeded by the price on the segment between t.3p and potential t.4p (excluding it).<br /> ::: '''5.3.2.1.''' If the level of t.3p is exceeded, the potential t.3p is discarded, and the program looks for a new t.3p following the instructions in sub-step 5.1. and further according to the algorithm.<br /> <br /> :::: '''5.3.2.2.''' If the level of t.3p is not exceeded, t.3p is confirmed, t.4p is confirmed, and the algorithm proceeds to sub- step 5.4.<br /> <br /> ==== Presupposition Verification ====<br /> : ''' 5.4.''' Presuppositions undergo the following checks:<br /> :: '''A.''' - Bars t.1p, t.2p, t.3p must follow each other.<br /> :: '''B.''' - The distance in levels between t.1 and t.2 (hereinafter rank 12) must be at least the value of the Minimum Distance between t.1 and t.2 Levels of the Presupposition, which is set in the Calculation Parameters, from the distance between t.4 and t.5 levels of the EAM model(this is rank 45).<br /> <br /> :: If all checks are successful, the Presupposition is found. If there are no unchecked t.1p left, the algorithm proceeds to Step 6.<br /> <br /> :: If there are no unchecked t.1p left, the algorithm proceeds to Step 6.<br /> <br /> === '''Step VI. Check for AL price crossings''' ===<br /> <br /> ==== '''6 alfa.''' ==== <br /> First it is necessary to check for the presence of a fixed t.2. If it exists, it means we are in a branch of searching for alternative models. <br /> <br /> The potential Aims Line (from t.2 to t.4), hereinafter referred to as AL, is calculated, and then:<br /> : '''6 alfa.1.''' AL Crossing Check<br /> <br /> :: '''6 alfa.1. A.''' - If there are no AL price crossings, the algorithm proceeds to step 6 alfa.2.<br /> :: '''6 alfa.1. B.''' - If AL is crossed, the next potential t.5 is determined according to Step 2, starting from bar t.5+2.<br /> : '''6.2. alfa.''' Distance Check for AL and TL Intersection<br /> : If:<br /> :: - TL and AL of the model do not intersect on the right (in the future) or<br /> :: - the ratio of the distance in bars between t.2 and t.4 to the distance between t.4 and the calculated point 6 is less than the default value of the parameter &quot;Minimum ratio of t.2-t.4 to t.4-t.6 EAM,&quot; then the search for alternative models is terminated. Otherwise, the program proceeds to Step 9. <br /> <br /> ====''' In the general case (no precviously fixed t.2)''' ====<br /> The program performs the following checks for each of the potential FBs:<br /> : '''6.1.''' AL Price Crossing Check (not just touching)<br /> : If AL intersects with the price on the segment between t.2 and t.4, this pair of candidates for t.1 and t.2 (this FB) is rejected.<br /> :: '''6.1.A.''' If FBs are found that give AL without intersections, the algorithm proceeds to step 6.2.<br /> :: '''6.1.B.''' If there are no suitable FBs, the algorithm looks for a new t.5 according to Step 2.<br /> <br /> : '''6.2.''' Checking for intersection of AL and TL (hereinafter referred to as calculated point 6) with each other on the right (in the future) along the time axis.<br /> : If the ratio of the distance in bars between t.2 and t.4 to the distance between t.4 and the calculated t.6 is less than the default value of the parameter &quot;Minimum ratio of t.2-t.4 to t.4-t.6 VMP,&quot; then these candidates for t.1 and t.2 are rejected.<br /> : The following scenarios are possible:<br /> :: '''6.2.A.''' One or several potential FBs remain - in this case, the program proceeds to Step 7.<br /> :: '''6.2.B.''' There are no potential FBs left - in this case, the program looks for a new potential t.5, starting from Step 2 and onwards.<br /> <br /> === '''Step VII. Dtermintaion of FB's with and without 2X5''' ===<br /> <br /> The program checks for the intersection of the bodies of candles at t.2 and t.5 (hereinafter referred to as 2x5). If there is only one potential FB, determining FB with 2x5 is not required, and the program proceeds to Step 8.<br /> <br /> :'''7.1.''' If there are multiple potential BOs, some of which have 2x5 and some do not, those potential BOs that have 2x5 are filtered out, and the program proceeds to Step 8.<br /> <br /> :'''7.2.''' If all potential FBs have 2x5, then all are filtered out except the one whose t.2 level is closer to the t.3 level. The program proceeds to <br /> <br /> === '''Step VIII: Filtering Based on Presupposition''' ===<br /> <br /> The algorithm checks whether Presuppositions have been found for the analyzed model.<br /> <br /> :'''8.0.''' If no Presuppositions are found, the program proceeds to Step 9.<br /> <br /> :'''8.1.''' The model has one or more Presuppositions. For each Presupposition program checks if the available candidates for t.2 belong to the interval between the last price level intersection of t.1p and t.1p itself (t.1p can also be used as t.2 EAM).<br /> <br /> ::'''8.1.1.''' There are candidates for t.2 that belong to the interval between the last price level intersection of t.1p and t.1p itself. Such a Presupposition is retained.<br /> ::'''8.1.2.''' There are no candidates for t.2 within the specified interval. In this case, such a Presupposition is discarded and not further considered (meaning the model has no Presupposition).<br /> :'''8.2.''' If after checking all Presuppositions according to sub-step 8.1., there are one or more Presuppositions with candidates in t.2 within the interval between the last price level intersection of t.1p and t.1p itself (inclusive), then:<br /> <br /> : - Among such Presuppositions, only the one with t.1p occurring later on the time axis is considered further;<br /> : - Only those candidates that belong to the interval between the last price level intersection of t.1p and t.1p itself are retained as t.2 candidates for the remaining Presupposition.<br /> ::'''8.2.1.''' If only one potential FB remains, the model is confirmed.<br /> ::'''8.2.2.''' If more than one potential FB remains, the program proceeds to Step 9.<br /> <br /> === '''Step IX. Search for Embedded Models in EAM''' ===<br /> <br /> :'''9.1.''' If EAM is constructed through t.3', then the interval from EAM's t.3 is checked for the presence of models according to Algorithm I, for which the following conditions are simultaneously satisfied. In the paragraph below, the numbers I and II in parentheses next to the model points denote the algorithm to which the model with this point belongs:<br /> <br /> : - If the model according to Algorithm I contains t.5, then its t.5 should precede or coincide with the t.5 of the analyzed EAM.<br /> : - t.4 does not lie beyond t.4 of the analyzed EAM; (bar of t.4(I) cannot coincide with bar of t.3(II), but can coincide with bar of t.4(II);<br /> : -t.1 lies before t.3' of the analyzed model (if it coincides with bar of t.3', then it is not suitable anymore) (t.1(I) can coincide with t.3(II), but cannot coincide with t.3'(II)<br /> <br /> If there are more than 5 models, those with the time distance from t.1 to t.4 greater than others are considered embedded models.<br /> <br /> ::'''9.1.1.''' If models are not found, then EAM does not have an embedded primary model.<br /> <br /> ::'''9.1.2.''' If the model/s is/are found, EAM is given the status of &quot;Models described near the Primary model.&quot;<br /> <br /> ::'''9.1.3.''' If EAM has one or more embedded models, models among them built from EAM's t.3 are searched for meeting one of the following criteria:<br /> <br /> ::: A. Having a trendline breakthrough in the interval before t.3' of the analyzed model;<br /> ::: B. Having an intersection of candle bodies at points 2 and 5 (hereinafter 2x5).<br /> ::: C. If the embedded model has a rank 45 greater than the ranks of 12 and 25 of the same model.<br /> ::: '''9.1.3.1.''' In the presence of one of these criteria, the model is Specific based on the 1st criterion.<br /> ::: '''9.1.3.2.''' In the absence of the specified criteria, the model is Normal based on the 1st criterion.<br /> <br /> :: '''9.1.4.''' If there is a model according to Algorithm I on the interval from t.3 to t.3' of the EAM, aligned with the preceding EAM trend, and with points t.1-t.4 lying on the interval 3-3' <br /> EAM (inclusive), then this EAM is Specific based on the 2nd criterion. <br /> :: In the absence of the specified criteria, the model is Normal based on the 2nd criterion.<br /> <br /> Upon completion of all checks in step 9.1., the program proceeds to step 10.<br /> <br /> :'''9.2.''' If EAM is constructed through t.3, the program proceeds to step 10.<br /> <br /> ==References==<br /> &lt;references /&gt;</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_II&diff=204 2024-01-03T22:57:46Z

<p>Admin: Adding Step 9</p> <hr /> <div>This article is not finished<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with UMG General Concepts.<br /> <br /> ==='''Step I. Search For Point 3 of the External Attraction Model (EAM) and the Sarting Point of the Previous Trend.'''===<br /> : '''1.1.''' The program looks for the first possible extreme, satisfying Single Bar Rule. Such an extreme is a candidate for potential point 3 ( potential t.3).<br /> : '''1.2.''' Next, the program checks the bars from right to left (i.e., in the past) from the bar containing the extreme candidate for point 3 to one of the following events:<br /> :: '''1.2.1.''' Found the last intersection (breakthrough) point by the price level of the candidate for point 3.<br /> ::In this case, the report displays: <br /> :: PREVdata: FullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.2.''' The program reached the starting point of the chart (i.e., the price did not intersect the level of point 3 after the starting point of the chart).<br /> ::In this case, the report displays: <br /> :: PREVdata: NoFullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.3.''' The price checked 300 bars preceding point 3 &lt;ref&gt;The depth of the search for the extreme confirming point 3 of EAM model&lt;/ref&gt;, but the level of step 3 did not intersect at this segment. The program looks for an absolute extreme (opposite to step 3) on the segment from the 300th bar before point 3 to point 3. The program proceeds to substep 1.3.<br /> : '''1.3.''' The program looks for an absolute extreme (opposite to point 3 extreme) on the segment:<br /> ::- from the last intersection by the price level of the candidate for point 3 (inclusive) (if came from 1.2.1.), or :: - from the starting point of the chart (if came from 1.2.2.), or <br /> :: - from 300 bars(if came from 1.2.3.) <br /> :: to point 3 (excluding).<br /> :: '''1.3.1.''' Absolute extreme found. The candidate for point 3 is confirmed; moreover, the found confirming extreme is the assumed (if coming from 1.2.2. or 1.2.3.) starting point of the preceding trend.'''<br /> ::The program checks for the absence of extremes equal to point 3 between the assumed starting point of the previous trend and point 3. <br /> :::'''1.3.1.1.''' If such an extreme is found, this candidate for point 3 is discarded, and this point 3 is discarded. <br /> :::'''1.3.1.2.''' If such an extreme is not found, the program proceeds to step 2.<br /> ::'''1.3.2.''' Absolute extreme not found. This point 3 is discarded.'''<br /> ::Simultaneously with step 1, the program launches the search for the next potential point 3.<br /> <br /> ==='''Step II. Search For Potentioal Points 5 and 4 ''' ===<br /> '''The Orientation rule (N1 requirement) for Algorithm II is as follows:'''<br /> If point 3 is low, then the level of point 5 should be higher than point 3. <br /> If point 3 is high, then the level of point 5 should be lower than point 3.<br /> '''Search for Point 5.''' The bar following the bar of Point 3 (and in repeated applications of this step - the bar specified in this algorithm) is checked for not overcoming the level of point 3 (since N1 requirement for Algorithm II must be observed).<br /> :'''2.1.''' If the price has overcome the level of point 3, the program discards the considered step 3 (due to N1 requirement).<br /> :'''2.2.''' If N1 requirement is met for the analyzed bar, it is checked for compliance with N1 requirement as a potential point 5 (hereafter - point 5 or t.5).<br /> ::'''2.2.1.''' If the analyzed bar is not an extreme according to N1 requirement (as a potential point 5), the program checks the next bar from the beginning of step 2.<br /> ::'''2.2.2.''' If the analyzed bar is determined as an extreme according to N1 requirement (as a potential point 5), then this bar is checked for reaching (but not necessarily overcoming) the level of point 3. There are 2 options:<br /> :::'''2.2.2.1.''' If the level of point 3 is reached, the program analyzes the next bar according to this step (i.e., from the beginning of step 2).<br /> :::'''2.2.2.2.''' If the level of point 3 is not reached, the analyzed bar is a potential point 5, and the program moves to substep 2.3.<br /> :'''2.3. Search for Point 4.''' The program searches for a bar, which was the last to cross the level of the considered potential point 5. Let's denote this bar as lcb5 (line-crossing-bar-5). If lcb5 coincides with the bar of point 3, we denote the bar following lcb5 as look4. Otherwise, look4 = lcb5. The program searches for a bar with the maximum (if point 3 is low) or minimum (if point 3 is high) price in the interval from lcb5 to potential point 5. Then this bar is checked for being an extreme according to N1 requirement as a potential pont 4 (hereafter – point 4 or t.4). There are 2 options:<br /> ::'''2.3.1.''' The bar is an absolute extreme (as a potential point 4). In this case, potential point 4 is found.<br /> :::'''2.3.1.1.''' If step 2 has already been determined (this is possible when this step is triggered during the search for an alternative model), the program checks the line chart for extra points in the section from step 2 to step 4. There are 2 options:<br /> ::::'''2.3.1.1.A.''' If extra points are found, the program processes the next bar after potential point 5 according to step 2.<br /> ::::'''2.3.1.1.B.''' Extra intersections are not found; the program moves to substep 2.4.<br /> :::'''2.3.1.2.''' If substep 2.3.1. is triggered during the search for the basic model, the program moves to substep 2.4.<br /> ::'''2.3.2.''' The bar is not an absolute extreme (as a potential point 4). In this case, the program looks for another candidate for point 5 according to this step (i.e., according to step 2).<br /> If the program has processed 50 bars in a row according to this step (step 2), and the program has not moved to another step of the algorithm, then this potential point 3 is discarded.<br /> If there are 150 or more bars&lt;ref&gt;Continuous search range of t.5 in one iteration for EAM model&lt;/ref&gt; between potential point 3 and the analyzed bar, and potential points 4 and 5 are not found, then this potential point 3 is discarded.<br /> :'''2.4.''' Real-Time Verification of t.5 <br /> :The potential t.5 bar is checked for the presence of bars between the analyzed bar and the potential t.4 bar, which contain price values more distant (or even equally distant) from the potential t.4 than the most distant from t.4 value of the analyzed bar. This is a check of the potential t.5 for beeing the '''potential absolute extreme'''. The following options are possible:<br /> ::'''2.4.1.''' If the extreme is potentially absolute, the program proceeds to step 3.<br /> ::'''2.4.2.''' If the extreme is not potentially absolute, the program checks the next bar starting from this step (i.e., step 2).<br /> <br /> ===''' Step III. Confirmation of Point 4. Searching for Alternative t.5 and t.5&quot; '''===<br /> The program checks whether the bar of potential t.5 has reached the level of t.4. Two scenarios are possible:<br /> :'''3.1.''' The Bar of Potential t.5 Has Reached t.4.<br /> :In this case:<br /> ::The model is built through absolute t.5.<br /> ::The t.5 bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> ::Point 4 is confirmed,<br /> ::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3 (since there is already possible to display the model through t.5 on the chart).<br /> :'''3.2.''' The Bar of Potential t.5 Has Not Reached t.4. <br /> :In this case, the program checks the next bar for reaching the level of t.4. The following options are possible:<br /> ::'''3.2.1. The Considered Bar Reaches the Level of Potential t.4. <br /> ::In this case:<br /> :::The model is built through absolute t.5.<br /> :::The considered bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> :::Point 4 is confirmed,<br /> :::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3.ext, but first goes through sub-step 3.3.<br /> ::'''3.2.2.''' The Considered Bar Does Not Reach the Level of t.4.<br /> ::In this case the program checks the next bar for overcoming the level of potential t.5. Two scenarios are possible:<br /> :::'''3.2.2.1.''' If the t.5 level is overcome, the analyzed bar is considered as a new potential t.5. The program processes this bar according to step 2.<br /> :::'''3.2.2.2.''' If the t.5 level is not overcome, the analyzed bar is checked for reaching the level of t.4 according to sub-step 3.2.<br /> ::In parallel (i.e., an additional branch is created), the program proceeds to sub-step 3.3 (since there is already an option to display the model through t.5 on the chart). The model in this branch receives a &quot;draw_flag&quot; label.<br /> :'''3.3.''' Construction of the Trend Line (TL). <br /> :A Trend Line (TL) is constructed from t.3 to t.5. Each bar between t.3 and t.5 is checked for breaking the TL. Two scenarios are possible:<br /> ::'''3.3.1.'''The Price Crosses the TL. <br /> ::In this case, the TL through t.3 is not constructed. The program searches for a candidate for point 3' (hereafter - t.3'). T.3' is selected in such a way that the TL' (constructed from t.3' to t.5) is not crossed by the price in the 3-5 segment. Rule No.1 for t.3' is not applied. T.3' cannot belong to the same bar as t.4. Two scenarios are possible:<br /> :::'''3.3.1.1.''' T.3' is found, this model is classified as built through t.3'. The program proceeds to step 4, or to sub-step 3.3.extended if coming from 3.2.<br /> :::'''3.3.1.2.''' T.3' is not found. In this case, the program searches for new potential t.5 and t.4 according to step 2.<br /> ::'''3.3.2.''' The Price Does Not Break the TL. <br /> ::In this case, this model is classified as built through t.3 (absolute extreme). The program proceeds to step 4, or to sub-step 3.3.ext. if current algorithm line is coming from 3.2.<br /> <br /> <br /> ::'''3.3.ext. Additional Trend Line Construction Through t.5&quot;.'''<br /> ::If:<br /> ::*The t.5 bar does not exceed the range of t.4;<br /> ::*At the time of model calculation, the level of t.4 is confirmed, then this model is checked for the possibility of constructing an additional Trend Line (TL) through t.5&quot;. Note: If t.4 is not confirmed, this model should be recalculated upon the appearance of a bar that confirms it's t.4.<br /> <br /> ::''' Definition: Point 5&quot; '''<br /> ::Point 5&quot; can lie in the segment between t.5 and the point confirming t.4. On this segment, a point is searched that meets the following requirements:<br /> <br /> ::''' Rule for Selecting Point 5&quot; High '''<br /> ::To the left of the bar containing t.5&quot;, the nearest high should be above the level of t.5.<br /> ::To the right of t.5&quot;, at least one nearest high should be below or equal to t.5. ::If the nearest high is equal to the level of t.5, then the next high should again be below or equal to the level of t.5, until at least one bar is strictly below the level of t.5.<br /> <br /> ::''' Rule for Selecting Point 5&quot; Low '''<br /> ::To the left of the bar containing t.5&quot;, the nearest low should be below the level of the extreme.<br /> ::To the right of t.5&quot;, at least one nearest low should be above or equal to t.5. If the nearest low is equal to the level of t.5, then the next low should again be above or equal to the level of t.5, until at least one bar is strictly above the level of t.5.<br /> <br /> ::''' Special Cases for Point 5&quot; '''<br /> ::Point 5&quot; may belong to a bar that has broken the level of t.4 (but only the first of such bars). If the bar of potential t.5&quot; breaks the level of calculated t.6 from t.5, then it is impossible to construct a TL through t.5&quot; for this model (this model does not contain such a point).<br /> <br /> :::'''3.3.ext.1.''' Additional TL Calculation <br /> :::If a bar is found that fits the rule for selecting 5&quot;, an additional TL is calculated for the potential t.5&quot; (hereafter TL&quot;). This line is checked for the absence of breaks in the segment from t.3/3'' to potential t.5&quot;.<br /> <br /> :::::'''3.3ext.1.a.''' If there is an intersection, the program moves to check the next bar as a potential t.5&quot;.<br /> <br /> :::::'''3.3ext.1.b.''' If there is no intersection, the found bar is compared with the previous candidate for t.5&quot; (if there was one in the previous iteration of the cycle). If the considered bar is closer to the level of t.4 than the candidate for t.5&quot;, then the considered bar becomes the new candidate for t.5&quot;.<br /> :::The check of bars continues in a cycle until a bar confirming t.4 is reached. If a candidate for t.5 is found as a result of the check, the program moves to sub-step 3.3ext.1.1; otherwise, it moves to step 4.<br /> ::::'''3.3ext.1.1.''' If the analyzed model is built through t.3', a candidate for t.3&quot; is sought in the segment t.3-t.3', through which such a line to t.5&quot; can be built that will not have price intersections in the segment t.3-t.3&quot;.<br /> :::::'''3.3ext.1.1.1.''' If a candidate for t.3&quot; is found, where there are no intersections, a check is made for the intersection of TL&quot; by the bar following t.5&quot;.<br /> ::::::'''3.3.ext.1.1.1.A.''' If there are intersections, t.5&quot; is declared canceled, and the next one is sought according to sub-step 3.3.ext.<br /> ::::::'''3.3.ext.1.1.1.B.''' Otherwise, the program moves to step 13.2.<br /> :::::'''3.3.ext.1.1.2.''' If a suitable t.3&quot; is not found, a re-search for a candidate for t.5&quot; is carried out according to sub-steps 3.3.ext., but in this case, if a candidate for t.5&quot; was found, it becomes a canceled candidate for t.5&quot;. The new candidate must already be further from t.4 than the previously discarded ones.<br /> ::::'''3.3ext.1.2.''' If the analyzed model is built through t.3, a check is made for the intersection of TL'' by the bar following t.5&quot;.<br /> :::::'''3.3ext.1.2.A.''' If there are intersections, t.5&quot; is declared as canceled t.5', and the next one is sought according to sub-step 3.3.ext.<br /> :::::'''3.3ext.1.2.B.''' If there are no intersections, the algorithm moves to step 13.2.<br /> :::'''3.3.ext.2.''' TL'' is checked for price intersections in the segment between t.5 (inclusive) and potential t.5&quot; (hereafter segment 5-5&quot;).<br /> ::::'''3.3.ext.2.1.''' If there is an intersection, then this 5&quot; is filtered out. A re-search for a candidate for t.5&quot; is carried out according to sub-steps 3.3.ext., but in this case, the new candidate must already be further from t.4 (in terms of time) than the previously discarded ones.<br /> ::::'''3.3.ext.2.2.''' If there are no intersections of TL&quot; in the segment 5-5&quot;, then t.5&quot; is found.<br /> ::::In this case, the report displays: EAM5&quot; EAM5&quot;<br /> ::::The program moves to step 4.<br /> ::::'''3.3.ext.2.3.''' If t.5&quot; is not found, the program moves to step 4.<br /> <br /> ==='''Step IV: Searching for Potential Foundation Blocks.'''===<br /> <br /> ====Initial Check====<br /> First, it is necessary to check for the presence of a fixed t.2. If it exists, it means we are in a branch for searching for alternative models.<br /> <br /> ::'''4.0.1.''' If t.2 is defined in the model, proceed to step 6.<br /> ::'''4.0.2.''' If t.2 is not defined, the program moves to step 4.1.<br /> ====Examination of Extremes====<br /> On the preceding trend, extremes are checked sequentially from right to left (i.e., into the past) from t.3 (or from another analyzed bar in repeated applications of this step) according to the N1 bar rule (as a candidate for t.2). Each found candidate for t.2 is checked for the presence of a confirming extreme (which also serves as t.1) according to the following algorithm:<br /> <br /> ::'''4.1.0.''' An extreme candidate for t.2 is found.<br /> ::'''4.1.1.''' The point of the last intersection &lt;ref&gt;High or low of a bar, repeating or crossing high or low of t.2 bar – is an intersection&lt;/ref&gt; of the candidate's level with the price is found. In this case, the program looks for the absolute maximum (if t.2 is a minimum, i.e., t.2 is low) or the absolute minimum (if t.2 is a maximum, i.e., t.2 is high) in the segment from the last intersection of the t.2 level with the price to t.2.<br /> :::'''4.1.1.1.''' Maximum/minimum not found. In this case, the program discards this candidate for t.2.<br /> :::'''4.1.1.2.''' Maximum/minimum found. In this case, the potential t.2 is confirmed.<br /> :::'''4.1.2.''' The program reaches the starting point of the chart.<br /> :::'''4.1.3.''' The check reaches the boundary of the Depth of Search for t.1 &lt;ref&gt;&quot;Search depth t.1 for EAM models&quot; is set in the Calculation Parameters. It is calculated in bars from the bar of the considered potential t.2. By default, this value is 50 bars.&lt;/ref&gt; for the model and none of the above events (4.1.1. or 4.1.2.) occurred.<br /> <br /> ::'''4.2.''' The search for Foundation Blocks (i.e., points 1 and 2, a.k.a FB) continues until one of the events in steps 4.2.A, 4.2.B or 4.2.C. occurs.<br /> :::'''4.2.A. The check reaches the bar containing the (presumed) starting point of the preceding trend (from sub-step 1.2.2.1.). This point is not considered as a potential t.2<br /> :::'''4.2.B.''' The check reaches the bar that intersects the level of the presumed point 4 of the considered model.<br /> :::'''4.2.C.''' A bar that is located at a distance (by time) from T.3 greater than or equal to X* (distance from T.3 to t.4), where x is the parameter set in the settings &lt;ref&gt; This is the &quot;Time Ratio of 23 to 24&quot;(by default it is 3)&lt;/ref&gt;.<br /> ::=== Results ===<br /> ::As a result of the search for potential t.2 (i.e., upon the occurrence of4.2.A, 4.2.B or 4.2.C.), two scenarios are possible:<br /> :::'''4.2.1. ''' One or more pairs of potential t.2 and t.1 are found (potential Foundation Blocks). The program moves to step 5.<br /> :::'''4.2.2. ''' No potential Foundation Blocks are found. In this case, the program looks for the next potential t.5 according to step 2.<br /> <br /> === '''Step V. Search for Presupposition''' ===<br /> Presupposition is an optional part of the EAM.<br /> The program attempts to construct Presuppositions from all available candidates for t.2.<br /> <br /> ==== Presupposition Search Algorithm ====<br /> The program takes each potential t.2 of the EAM (as part of a potential FB) as a t.1 of Presupposition (hereinafter t.1p). In other words, the program tries to construct Presuppositions from each of the t.2.<br /> <br /> Initially, the most recent (rightmost) potential t.2 (or the one specified in the algorithm if we have returned to the beginning of the Step V in the cycle) in the EAM is taken as a potential t.1p. If there are no more unconfirmed t.1p, the algorithm proceeds to Step 6.<br /> <br /> : '''5.1.''' The program sequentially checks bars from left to right (into the future) from the potential t.1p to t.3 of EAM model (excluding t.3) for being an extreme according to the N1 rule as point 3 of the Presupposition (hereinafter t.3p).<br /> <br /> : '''N1 rule for the Presupposition points'''<br /> : If t.1p is low, t.3p must be below t.1p.<br /> : If t.1p is high, t.3p must be above t.1p.<br /> <br /> :: '''5.1.1.''' If the potential t.3p is not found, the program considers the next (to the left of the previous) potential t.2 of the EAM (within the FB) as t.1p.<br /> :: If the potential t.3p is not found, and there are no more potential FBs, the algorithm proceeds to Step 6.<br /> :: '''5.1.2.''' Once the potential t.3p is found, the program searches for point 2 of the Presupposition (hereinafter t.2p) as an extreme with the maximum/minimum price on the segment from t.1p to t.3p (hereinafter segment 1p-3p).<br /> :: If a suitable extreme is not found, the algorithm looks for the next potential t.3p for the previously found t.1p.<br /> :: If a maximum/minimum is found, it is checked for for being an extreme (as t.2p).<br /> :: There are two possibilities:<br /> ::: '''5.1.2.1.''' The bar is an absolute extreme. In this case, a potential t.2p is found, and the program proceeds to step 5.2.<br /> ::: '''5.1.2.2.''' The bar is not an extreme. In this case, the program looks for another candidate for t.3p for the previously found t.1p following the instructions in 5.1.<br /> : '''5.2.''' The program constructs a line from t.1p to t.3p and checks it for price crossings on the segment from t.1p to t.3 of the EAM (including t.3 of EAM).<br /> :: '''5.2.1.''' If this lines price crossings are found, the program looks for a new candidate for t.3p for the previously found t.1p following the instructions in sub-step 5.1.<br /> :: '''5.2.2.''' If there are no price crossings, the program proceeds to sub-step 5.3.<br /> <br /> : '''5.3.''' The program searches for a potential point 4 of the Presupposition (t.4p) according to the N1 rule on the segment from t.3p to t.3 in the VMP (including t.3).<br /> <br /> : If t.1p is low, t.4p must be below t.2p. Each subsequent candidate for t.4p must be below the previous candidate for t.4p.<br /> : If t.1p is high, t.4p must be above t.2p. Each subsequent candidate for t.4p must be above the previous candidate for t.4p.<br /> : Possible scenarios:<br /> :: '''5.3.A.''' If the potential t.4p coincides with t.3 in the EAM, t.4p is confirmed (found), and the program proceeds to sub-step 5.3.1.<br /> :: '''5.3.B.''' If the potential t.4p does not coincide with t.3 in the EAM (i.e., it is located before it), the program looks for an opposite-direction potential t.4p extreme on the segment from the potential t.4p (excluding it) to the bar where the price again reached the value of the potential t.4p (excluding it).<br /> <br /> :: There are two possibilities:<br /> ::: '''5.3.B.1.''' If the opposite-direction extreme is found, t.4p is confirmed (found), and the program proceeds to sub-step 5.3.1.<br /> ::: '''5.3.B.2.''' If the opposite-direction extreme is not found, the program looks for a new potential t.4p following the instructions in sub-step 5.3.1.<br /> :: '''5.3.1.''' If t.4p is found, the program constructs a line from t.2p to t.4p and checks it for price crossings on the segment from t.1p (excluding it) to t.3 in the VMP (including t.3).<br /> ::: If unnecessary intersections are found, the program looks for the next potential t.4p on the segment following the instructions in 5.3.<br /> ::: If no unnecessary intersections are found, the algorithm proceeds to sub-step 5.4.<br /> :: '''5.3.2.''' Check for Absolute Level<br /> :: The program checks the bar of the potential t.3p for absoluteness. The level of t.3p should not be exceeded by the price on the segment between t.3p and potential t.4p (excluding it).<br /> ::: '''5.3.2.1.''' If the level of t.3p is exceeded, the potential t.3p is discarded, and the program looks for a new t.3p following the instructions in sub-step 5.1. and further according to the algorithm.<br /> <br /> :::: '''5.3.2.2.''' If the level of t.3p is not exceeded, t.3p is confirmed, t.4p is confirmed, and the algorithm proceeds to sub- step 5.4.<br /> <br /> ==== Presupposition Verification ====<br /> : ''' 5.4.''' Presuppositions undergo the following checks:<br /> :: '''A.''' - Bars t.1p, t.2p, t.3p must follow each other.<br /> :: '''B.''' - The distance in levels between t.1 and t.2 (hereinafter rank 12) must be at least the value of the Minimum Distance between t.1 and t.2 Levels of the Presupposition, which is set in the Calculation Parameters, from the distance between t.4 and t.5 levels of the EAM model(this is rank 45).<br /> <br /> :: If all checks are successful, the Presupposition is found. If there are no unchecked t.1p left, the algorithm proceeds to Step 6.<br /> <br /> :: If there are no unchecked t.1p left, the algorithm proceeds to Step 6.<br /> <br /> === '''Step VI. Check for AL price crossings''' ===<br /> <br /> ==== '''6 alfa.''' ==== <br /> First it is necessary to check for the presence of a fixed t.2. If it exists, it means we are in a branch of searching for alternative models. <br /> <br /> The potential Aims Line (from t.2 to t.4), hereinafter referred to as AL, is calculated, and then:<br /> : '''6 alfa.1.''' AL Crossing Check<br /> <br /> :: '''6 alfa.1. A.''' - If there are no AL price crossings, the algorithm proceeds to step 6 alfa.2.<br /> :: '''6 alfa.1. B.''' - If AL is crossed, the next potential t.5 is determined according to Step 2, starting from bar t.5+2.<br /> : '''6.2. alfa.''' Distance Check for AL and TL Intersection<br /> : If:<br /> :: - TL and AL of the model do not intersect on the right (in the future) or<br /> :: - the ratio of the distance in bars between t.2 and t.4 to the distance between t.4 and the calculated point 6 is less than the default value of the parameter &quot;Minimum ratio of t.2-t.4 to t.4-t.6 EAM,&quot; then the search for alternative models is terminated. Otherwise, the program proceeds to Step 9. <br /> <br /> ====''' In the general case (no precviously fixed t.2)''' ====<br /> The program performs the following checks for each of the potential FBs:<br /> : '''6.1.''' AL Price Crossing Check (not just touching)<br /> : If AL intersects with the price on the segment between t.2 and t.4, this pair of candidates for t.1 and t.2 (this FB) is rejected.<br /> :: '''6.1.A.''' If FBs are found that give AL without intersections, the algorithm proceeds to step 6.2.<br /> :: '''6.1.B.''' If there are no suitable FBs, the algorithm looks for a new t.5 according to Step 2.<br /> <br /> : '''6.2.''' Checking for intersection of AL and TL (hereinafter referred to as calculated point 6) with each other on the right (in the future) along the time axis.<br /> : If the ratio of the distance in bars between t.2 and t.4 to the distance between t.4 and the calculated t.6 is less than the default value of the parameter &quot;Minimum ratio of t.2-t.4 to t.4-t.6 VMP,&quot; then these candidates for t.1 and t.2 are rejected.<br /> : The following scenarios are possible:<br /> :: '''6.2.A.''' One or several potential FBs remain - in this case, the program proceeds to Step 7.<br /> :: '''6.2.B.''' There are no potential FBs left - in this case, the program looks for a new potential t.5, starting from Step 2 and onwards.<br /> <br /> === '''Step VII. Dtermintaion of FB's with and without 2X5''' ===<br /> <br /> The program checks for the intersection of the bodies of candles at t.2 and t.5 (hereinafter referred to as 2x5). If there is only one potential FB, determining FB with 2x5 is not required, and the program proceeds to Step 8.<br /> <br /> :'''7.1.''' If there are multiple potential BOs, some of which have 2x5 and some do not, those potential BOs that have 2x5 are filtered out, and the program proceeds to Step 8.<br /> <br /> :'''7.2.''' If all potential FBs have 2x5, then all are filtered out except the one whose t.2 level is closer to the t.3 level. The program proceeds to <br /> <br /> === '''Step VIII: Filtering Based on Presupposition''' ===<br /> <br /> The algorithm checks whether Presuppositions have been found for the analyzed model.<br /> <br /> :'''8.0.''' If no Presuppositions are found, the program proceeds to Step 9.<br /> <br /> :'''8.1.''' The model has one or more Presuppositions. For each Presupposition program checks if the available candidates for t.2 belong to the interval between the last price level intersection of t.1p and t.1p itself (t.1p can also be used as t.2 EAM).<br /> <br /> ::'''8.1.1.''' There are candidates for t.2 that belong to the interval between the last price level intersection of t.1p and t.1p itself. Such a Presupposition is retained.<br /> ::'''8.1.2.''' There are no candidates for t.2 within the specified interval. In this case, such a Presupposition is discarded and not further considered (meaning the model has no Presupposition).<br /> :'''8.2.''' If after checking all Presuppositions according to sub-step 8.1., there are one or more Presuppositions with candidates in t.2 within the interval between the last price level intersection of t.1p and t.1p itself (inclusive), then:<br /> <br /> : - Among such Presuppositions, only the one with t.1p occurring later on the time axis is considered further;<br /> : - Only those candidates that belong to the interval between the last price level intersection of t.1p and t.1p itself are retained as t.2 candidates for the remaining Presupposition.<br /> ::'''8.2.1.''' If only one potential FB remains, the model is confirmed.<br /> ::'''8.2.2.''' If more than one potential FB remains, the program proceeds to Step 9.<br /> <br /> === '''Step IX. Search for Embedded Models in VMP''' ===<br /> <br /> :'''9.1.''' If EAM is constructed through t.3', then the interval from EAM's t.3 is checked for the presence of models according to Algorithm I, for which the following conditions are simultaneously satisfied. In the paragraph below, the numbers I and II in parentheses next to the model points denote the algorithm to which the model with this point belongs:<br /> <br /> : - If the model according to Algorithm I contains t.5, then its t.5 should precede or coincide with the t.5 of the analyzed EAM.<br /> : - t.4 does not lie beyond t.4 of the analyzed EAM; (bar of t.4(I) cannot coincide with bar of t.3(II), but can coincide with bar of t.4(II);<br /> : -t.1 lies before t.3' of the analyzed model (if it coincides with bar of t.3', then it is not suitable anymore) (t.1(I) can coincide with t.3(II), but cannot coincide with t.3'(II)<br /> <br /> If there are more than 5 models, those with the time distance from t.1 to t.4 greater than others are considered embedded models.<br /> <br /> ::'''9.1.1.''' If models are not found, then EAM does not have an embedded primary model.<br /> <br /> ::'''9.1.2.''' If the model/s is/are found, EAM is given the status of &quot;Models described near the Primary model.&quot;<br /> <br /> ::'''9.1.3.''' If EAM has one or more embedded models, models among them built from EAM's t.3 are searched for meeting one of the following criteria:<br /> <br /> ::: A. Having a trendline breakthrough in the interval before t.3' of the analyzed model;<br /> ::: B. Having an intersection of candle bodies at points 2 and 5 (hereinafter 2x5).<br /> ::: C. If the embedded model has a rank 45 greater than the ranks of 12 and 25 of the same model.<br /> ::: '''9.1.3.1.''' In the presence of one of these criteria, the model is Specific based on the 1st criterion.<br /> ::: '''9.1.3.2.''' In the absence of the specified criteria, the model is Normal based on the 1st criterion.<br /> <br /> :: '''9.1.4.''' If there is a model according to Algorithm I on the interval from t.3 to t.3' of the EAM, aligned with the preceding EAM trend, and with points t.1-t.4 lying on the interval 3-3' <br /> EAM (inclusive), then this EAM is Specific based on the 2nd criterion. <br /> :: In the absence of the specified criteria, the model is Normal based on the 2nd criterion.<br /> <br /> Upon completion of all checks in step 9.1., the program proceeds to step 10.<br /> <br /> :'''9.2.''' If EAM is constructed through t.3, the program proceeds to step 10.<br /> <br /> ==References==<br /> &lt;references /&gt;</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_II&diff=203 2023-09-14T21:05:32Z

<p>Admin: Adding Step 8</p> <hr /> <div>This article is not finished<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with UMG General Concepts.<br /> <br /> ==='''Step I. Search For Point 3 of the External Attraction Model (EAM) and the Sarting Point of the Previous Trend.'''===<br /> : '''1.1.''' The program looks for the first possible extreme, satisfying Single Bar Rule. Such an extreme is a candidate for potential point 3 ( potential t.3).<br /> : '''1.2.''' Next, the program checks the bars from right to left (i.e., in the past) from the bar containing the extreme candidate for point 3 to one of the following events:<br /> :: '''1.2.1.''' Found the last intersection (breakthrough) point by the price level of the candidate for point 3.<br /> ::In this case, the report displays: <br /> :: PREVdata: FullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.2.''' The program reached the starting point of the chart (i.e., the price did not intersect the level of point 3 after the starting point of the chart).<br /> ::In this case, the report displays: <br /> :: PREVdata: NoFullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.3.''' The price checked 300 bars preceding point 3 &lt;ref&gt;The depth of the search for the extreme confirming point 3 of EAM model&lt;/ref&gt;, but the level of step 3 did not intersect at this segment. The program looks for an absolute extreme (opposite to step 3) on the segment from the 300th bar before point 3 to point 3. The program proceeds to substep 1.3.<br /> : '''1.3.''' The program looks for an absolute extreme (opposite to point 3 extreme) on the segment:<br /> ::- from the last intersection by the price level of the candidate for point 3 (inclusive) (if came from 1.2.1.), or :: - from the starting point of the chart (if came from 1.2.2.), or <br /> :: - from 300 bars(if came from 1.2.3.) <br /> :: to point 3 (excluding).<br /> :: '''1.3.1.''' Absolute extreme found. The candidate for point 3 is confirmed; moreover, the found confirming extreme is the assumed (if coming from 1.2.2. or 1.2.3.) starting point of the preceding trend.'''<br /> ::The program checks for the absence of extremes equal to point 3 between the assumed starting point of the previous trend and point 3. <br /> :::'''1.3.1.1.''' If such an extreme is found, this candidate for point 3 is discarded, and this point 3 is discarded. <br /> :::'''1.3.1.2.''' If such an extreme is not found, the program proceeds to step 2.<br /> ::'''1.3.2.''' Absolute extreme not found. This point 3 is discarded.'''<br /> ::Simultaneously with step 1, the program launches the search for the next potential point 3.<br /> <br /> ==='''Step II. Search For Potentioal Points 5 and 4 ''' ===<br /> '''The Orientation rule (N1 requirement) for Algorithm II is as follows:'''<br /> If point 3 is low, then the level of point 5 should be higher than point 3. <br /> If point 3 is high, then the level of point 5 should be lower than point 3.<br /> '''Search for Point 5.''' The bar following the bar of Point 3 (and in repeated applications of this step - the bar specified in this algorithm) is checked for not overcoming the level of point 3 (since N1 requirement for Algorithm II must be observed).<br /> :'''2.1.''' If the price has overcome the level of point 3, the program discards the considered step 3 (due to N1 requirement).<br /> :'''2.2.''' If N1 requirement is met for the analyzed bar, it is checked for compliance with N1 requirement as a potential point 5 (hereafter - point 5 or t.5).<br /> ::'''2.2.1.''' If the analyzed bar is not an extreme according to N1 requirement (as a potential point 5), the program checks the next bar from the beginning of step 2.<br /> ::'''2.2.2.''' If the analyzed bar is determined as an extreme according to N1 requirement (as a potential point 5), then this bar is checked for reaching (but not necessarily overcoming) the level of point 3. There are 2 options:<br /> :::'''2.2.2.1.''' If the level of point 3 is reached, the program analyzes the next bar according to this step (i.e., from the beginning of step 2).<br /> :::'''2.2.2.2.''' If the level of point 3 is not reached, the analyzed bar is a potential point 5, and the program moves to substep 2.3.<br /> :'''2.3. Search for Point 4.''' The program searches for a bar, which was the last to cross the level of the considered potential point 5. Let's denote this bar as lcb5 (line-crossing-bar-5). If lcb5 coincides with the bar of point 3, we denote the bar following lcb5 as look4. Otherwise, look4 = lcb5. The program searches for a bar with the maximum (if point 3 is low) or minimum (if point 3 is high) price in the interval from lcb5 to potential point 5. Then this bar is checked for being an extreme according to N1 requirement as a potential pont 4 (hereafter – point 4 or t.4). There are 2 options:<br /> ::'''2.3.1.''' The bar is an absolute extreme (as a potential point 4). In this case, potential point 4 is found.<br /> :::'''2.3.1.1.''' If step 2 has already been determined (this is possible when this step is triggered during the search for an alternative model), the program checks the line chart for extra points in the section from step 2 to step 4. There are 2 options:<br /> ::::'''2.3.1.1.A.''' If extra points are found, the program processes the next bar after potential point 5 according to step 2.<br /> ::::'''2.3.1.1.B.''' Extra intersections are not found; the program moves to substep 2.4.<br /> :::'''2.3.1.2.''' If substep 2.3.1. is triggered during the search for the basic model, the program moves to substep 2.4.<br /> ::'''2.3.2.''' The bar is not an absolute extreme (as a potential point 4). In this case, the program looks for another candidate for point 5 according to this step (i.e., according to step 2).<br /> If the program has processed 50 bars in a row according to this step (step 2), and the program has not moved to another step of the algorithm, then this potential point 3 is discarded.<br /> If there are 150 or more bars&lt;ref&gt;Continuous search range of t.5 in one iteration for EAM model&lt;/ref&gt; between potential point 3 and the analyzed bar, and potential points 4 and 5 are not found, then this potential point 3 is discarded.<br /> :'''2.4.''' Real-Time Verification of t.5 <br /> :The potential t.5 bar is checked for the presence of bars between the analyzed bar and the potential t.4 bar, which contain price values more distant (or even equally distant) from the potential t.4 than the most distant from t.4 value of the analyzed bar. This is a check of the potential t.5 for beeing the '''potential absolute extreme'''. The following options are possible:<br /> ::'''2.4.1.''' If the extreme is potentially absolute, the program proceeds to step 3.<br /> ::'''2.4.2.''' If the extreme is not potentially absolute, the program checks the next bar starting from this step (i.e., step 2).<br /> <br /> ===''' Step III. Confirmation of Point 4. Searching for Alternative t.5 and t.5&quot; '''===<br /> The program checks whether the bar of potential t.5 has reached the level of t.4. Two scenarios are possible:<br /> :'''3.1.''' The Bar of Potential t.5 Has Reached t.4.<br /> :In this case:<br /> ::The model is built through absolute t.5.<br /> ::The t.5 bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> ::Point 4 is confirmed,<br /> ::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3 (since there is already possible to display the model through t.5 on the chart).<br /> :'''3.2.''' The Bar of Potential t.5 Has Not Reached t.4. <br /> :In this case, the program checks the next bar for reaching the level of t.4. The following options are possible:<br /> ::'''3.2.1. The Considered Bar Reaches the Level of Potential t.4. <br /> ::In this case:<br /> :::The model is built through absolute t.5.<br /> :::The considered bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> :::Point 4 is confirmed,<br /> :::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3.ext, but first goes through sub-step 3.3.<br /> ::'''3.2.2.''' The Considered Bar Does Not Reach the Level of t.4.<br /> ::In this case the program checks the next bar for overcoming the level of potential t.5. Two scenarios are possible:<br /> :::'''3.2.2.1.''' If the t.5 level is overcome, the analyzed bar is considered as a new potential t.5. The program processes this bar according to step 2.<br /> :::'''3.2.2.2.''' If the t.5 level is not overcome, the analyzed bar is checked for reaching the level of t.4 according to sub-step 3.2.<br /> ::In parallel (i.e., an additional branch is created), the program proceeds to sub-step 3.3 (since there is already an option to display the model through t.5 on the chart). The model in this branch receives a &quot;draw_flag&quot; label.<br /> :'''3.3.''' Construction of the Trend Line (TL). <br /> :A Trend Line (TL) is constructed from t.3 to t.5. Each bar between t.3 and t.5 is checked for breaking the TL. Two scenarios are possible:<br /> ::'''3.3.1.'''The Price Crosses the TL. <br /> ::In this case, the TL through t.3 is not constructed. The program searches for a candidate for point 3' (hereafter - t.3'). T.3' is selected in such a way that the TL' (constructed from t.3' to t.5) is not crossed by the price in the 3-5 segment. Rule No.1 for t.3' is not applied. T.3' cannot belong to the same bar as t.4. Two scenarios are possible:<br /> :::'''3.3.1.1.''' T.3' is found, this model is classified as built through t.3'. The program proceeds to step 4, or to sub-step 3.3.extended if coming from 3.2.<br /> :::'''3.3.1.2.''' T.3' is not found. In this case, the program searches for new potential t.5 and t.4 according to step 2.<br /> ::'''3.3.2.''' The Price Does Not Break the TL. <br /> ::In this case, this model is classified as built through t.3 (absolute extreme). The program proceeds to step 4, or to sub-step 3.3.ext. if current algorithm line is coming from 3.2.<br /> <br /> <br /> ::'''3.3.ext. Additional Trend Line Construction Through t.5&quot;.'''<br /> ::If:<br /> ::*The t.5 bar does not exceed the range of t.4;<br /> ::*At the time of model calculation, the level of t.4 is confirmed, then this model is checked for the possibility of constructing an additional Trend Line (TL) through t.5&quot;. Note: If t.4 is not confirmed, this model should be recalculated upon the appearance of a bar that confirms it's t.4.<br /> <br /> ::''' Definition: Point 5&quot; '''<br /> ::Point 5&quot; can lie in the segment between t.5 and the point confirming t.4. On this segment, a point is searched that meets the following requirements:<br /> <br /> ::''' Rule for Selecting Point 5&quot; High '''<br /> ::To the left of the bar containing t.5&quot;, the nearest high should be above the level of t.5.<br /> ::To the right of t.5&quot;, at least one nearest high should be below or equal to t.5. ::If the nearest high is equal to the level of t.5, then the next high should again be below or equal to the level of t.5, until at least one bar is strictly below the level of t.5.<br /> <br /> ::''' Rule for Selecting Point 5&quot; Low '''<br /> ::To the left of the bar containing t.5&quot;, the nearest low should be below the level of the extreme.<br /> ::To the right of t.5&quot;, at least one nearest low should be above or equal to t.5. If the nearest low is equal to the level of t.5, then the next low should again be above or equal to the level of t.5, until at least one bar is strictly above the level of t.5.<br /> <br /> ::''' Special Cases for Point 5&quot; '''<br /> ::Point 5&quot; may belong to a bar that has broken the level of t.4 (but only the first of such bars). If the bar of potential t.5&quot; breaks the level of calculated t.6 from t.5, then it is impossible to construct a TL through t.5&quot; for this model (this model does not contain such a point).<br /> <br /> :::'''3.3.ext.1.''' Additional TL Calculation <br /> :::If a bar is found that fits the rule for selecting 5&quot;, an additional TL is calculated for the potential t.5&quot; (hereafter TL&quot;). This line is checked for the absence of breaks in the segment from t.3/3'' to potential t.5&quot;.<br /> <br /> :::::'''3.3ext.1.a.''' If there is an intersection, the program moves to check the next bar as a potential t.5&quot;.<br /> <br /> :::::'''3.3ext.1.b.''' If there is no intersection, the found bar is compared with the previous candidate for t.5&quot; (if there was one in the previous iteration of the cycle). If the considered bar is closer to the level of t.4 than the candidate for t.5&quot;, then the considered bar becomes the new candidate for t.5&quot;.<br /> :::The check of bars continues in a cycle until a bar confirming t.4 is reached. If a candidate for t.5 is found as a result of the check, the program moves to sub-step 3.3ext.1.1; otherwise, it moves to step 4.<br /> ::::'''3.3ext.1.1.''' If the analyzed model is built through t.3', a candidate for t.3&quot; is sought in the segment t.3-t.3', through which such a line to t.5&quot; can be built that will not have price intersections in the segment t.3-t.3&quot;.<br /> :::::'''3.3ext.1.1.1.''' If a candidate for t.3&quot; is found, where there are no intersections, a check is made for the intersection of TL&quot; by the bar following t.5&quot;.<br /> ::::::'''3.3.ext.1.1.1.A.''' If there are intersections, t.5&quot; is declared canceled, and the next one is sought according to sub-step 3.3.ext.<br /> ::::::'''3.3.ext.1.1.1.B.''' Otherwise, the program moves to step 13.2.<br /> :::::'''3.3.ext.1.1.2.''' If a suitable t.3&quot; is not found, a re-search for a candidate for t.5&quot; is carried out according to sub-steps 3.3.ext., but in this case, if a candidate for t.5&quot; was found, it becomes a canceled candidate for t.5&quot;. The new candidate must already be further from t.4 than the previously discarded ones.<br /> ::::'''3.3ext.1.2.''' If the analyzed model is built through t.3, a check is made for the intersection of TL'' by the bar following t.5&quot;.<br /> :::::'''3.3ext.1.2.A.''' If there are intersections, t.5&quot; is declared as canceled t.5', and the next one is sought according to sub-step 3.3.ext.<br /> :::::'''3.3ext.1.2.B.''' If there are no intersections, the algorithm moves to step 13.2.<br /> :::'''3.3.ext.2.''' TL'' is checked for price intersections in the segment between t.5 (inclusive) and potential t.5&quot; (hereafter segment 5-5&quot;).<br /> ::::'''3.3.ext.2.1.''' If there is an intersection, then this 5&quot; is filtered out. A re-search for a candidate for t.5&quot; is carried out according to sub-steps 3.3.ext., but in this case, the new candidate must already be further from t.4 (in terms of time) than the previously discarded ones.<br /> ::::'''3.3.ext.2.2.''' If there are no intersections of TL&quot; in the segment 5-5&quot;, then t.5&quot; is found.<br /> ::::In this case, the report displays: EAM5&quot; EAM5&quot;<br /> ::::The program moves to step 4.<br /> ::::'''3.3.ext.2.3.''' If t.5&quot; is not found, the program moves to step 4.<br /> <br /> ==='''Step IV: Searching for Potential Foundation Blocks.'''===<br /> <br /> ====Initial Check====<br /> First, it is necessary to check for the presence of a fixed t.2. If it exists, it means we are in a branch for searching for alternative models.<br /> <br /> ::'''4.0.1.''' If t.2 is defined in the model, proceed to step 6.<br /> ::'''4.0.2.''' If t.2 is not defined, the program moves to step 4.1.<br /> ====Examination of Extremes====<br /> On the preceding trend, extremes are checked sequentially from right to left (i.e., into the past) from t.3 (or from another analyzed bar in repeated applications of this step) according to the N1 bar rule (as a candidate for t.2). Each found candidate for t.2 is checked for the presence of a confirming extreme (which also serves as t.1) according to the following algorithm:<br /> <br /> ::'''4.1.0.''' An extreme candidate for t.2 is found.<br /> ::'''4.1.1.''' The point of the last intersection &lt;ref&gt;High or low of a bar, repeating or crossing high or low of t.2 bar – is an intersection&lt;/ref&gt; of the candidate's level with the price is found. In this case, the program looks for the absolute maximum (if t.2 is a minimum, i.e., t.2 is low) or the absolute minimum (if t.2 is a maximum, i.e., t.2 is high) in the segment from the last intersection of the t.2 level with the price to t.2.<br /> :::'''4.1.1.1.''' Maximum/minimum not found. In this case, the program discards this candidate for t.2.<br /> :::'''4.1.1.2.''' Maximum/minimum found. In this case, the potential t.2 is confirmed.<br /> :::'''4.1.2.''' The program reaches the starting point of the chart.<br /> :::'''4.1.3.''' The check reaches the boundary of the Depth of Search for t.1 &lt;ref&gt;&quot;Search depth t.1 for EAM models&quot; is set in the Calculation Parameters. It is calculated in bars from the bar of the considered potential t.2. By default, this value is 50 bars.&lt;/ref&gt; for the model and none of the above events (4.1.1. or 4.1.2.) occurred.<br /> <br /> ::'''4.2.''' The search for Foundation Blocks (i.e., points 1 and 2, a.k.a FB) continues until one of the events in steps 4.2.A, 4.2.B or 4.2.C. occurs.<br /> :::'''4.2.A. The check reaches the bar containing the (presumed) starting point of the preceding trend (from sub-step 1.2.2.1.). This point is not considered as a potential t.2<br /> :::'''4.2.B.''' The check reaches the bar that intersects the level of the presumed point 4 of the considered model.<br /> :::'''4.2.C.''' A bar that is located at a distance (by time) from T.3 greater than or equal to X* (distance from T.3 to t.4), where x is the parameter set in the settings &lt;ref&gt; This is the &quot;Time Ratio of 23 to 24&quot;(by default it is 3)&lt;/ref&gt;.<br /> ::=== Results ===<br /> ::As a result of the search for potential t.2 (i.e., upon the occurrence of4.2.A, 4.2.B or 4.2.C.), two scenarios are possible:<br /> :::'''4.2.1. ''' One or more pairs of potential t.2 and t.1 are found (potential Foundation Blocks). The program moves to step 5.<br /> :::'''4.2.2. ''' No potential Foundation Blocks are found. In this case, the program looks for the next potential t.5 according to step 2.<br /> <br /> === '''Step V. Search for Presupposition''' ===<br /> Presupposition is an optional part of the EAM.<br /> The program attempts to construct Presuppositions from all available candidates for t.2.<br /> <br /> ==== Presupposition Search Algorithm ====<br /> The program takes each potential t.2 of the EAM (as part of a potential FB) as a t.1 of Presupposition (hereinafter t.1p). In other words, the program tries to construct Presuppositions from each of the t.2.<br /> <br /> Initially, the most recent (rightmost) potential t.2 (or the one specified in the algorithm if we have returned to the beginning of the Step V in the cycle) in the EAM is taken as a potential t.1p. If there are no more unconfirmed t.1p, the algorithm proceeds to Step 6.<br /> <br /> : '''5.1.''' The program sequentially checks bars from left to right (into the future) from the potential t.1p to t.3 of EAM model (excluding t.3) for being an extreme according to the N1 rule as point 3 of the Presupposition (hereinafter t.3p).<br /> <br /> : '''N1 rule for the Presupposition points'''<br /> : If t.1p is low, t.3p must be below t.1p.<br /> : If t.1p is high, t.3p must be above t.1p.<br /> <br /> :: '''5.1.1.''' If the potential t.3p is not found, the program considers the next (to the left of the previous) potential t.2 of the EAM (within the FB) as t.1p.<br /> :: If the potential t.3p is not found, and there are no more potential FBs, the algorithm proceeds to Step 6.<br /> :: '''5.1.2.''' Once the potential t.3p is found, the program searches for point 2 of the Presupposition (hereinafter t.2p) as an extreme with the maximum/minimum price on the segment from t.1p to t.3p (hereinafter segment 1p-3p).<br /> :: If a suitable extreme is not found, the algorithm looks for the next potential t.3p for the previously found t.1p.<br /> :: If a maximum/minimum is found, it is checked for for being an extreme (as t.2p).<br /> :: There are two possibilities:<br /> ::: '''5.1.2.1.''' The bar is an absolute extreme. In this case, a potential t.2p is found, and the program proceeds to step 5.2.<br /> ::: '''5.1.2.2.''' The bar is not an extreme. In this case, the program looks for another candidate for t.3p for the previously found t.1p following the instructions in 5.1.<br /> : '''5.2.''' The program constructs a line from t.1p to t.3p and checks it for price crossings on the segment from t.1p to t.3 of the EAM (including t.3 of EAM).<br /> :: '''5.2.1.''' If this lines price crossings are found, the program looks for a new candidate for t.3p for the previously found t.1p following the instructions in sub-step 5.1.<br /> :: '''5.2.2.''' If there are no price crossings, the program proceeds to sub-step 5.3.<br /> <br /> : '''5.3.''' The program searches for a potential point 4 of the Presupposition (t.4p) according to the N1 rule on the segment from t.3p to t.3 in the VMP (including t.3).<br /> <br /> : If t.1p is low, t.4p must be below t.2p. Each subsequent candidate for t.4p must be below the previous candidate for t.4p.<br /> : If t.1p is high, t.4p must be above t.2p. Each subsequent candidate for t.4p must be above the previous candidate for t.4p.<br /> : Possible scenarios:<br /> :: '''5.3.A.''' If the potential t.4p coincides with t.3 in the EAM, t.4p is confirmed (found), and the program proceeds to sub-step 5.3.1.<br /> :: '''5.3.B.''' If the potential t.4p does not coincide with t.3 in the EAM (i.e., it is located before it), the program looks for an opposite-direction potential t.4p extreme on the segment from the potential t.4p (excluding it) to the bar where the price again reached the value of the potential t.4p (excluding it).<br /> <br /> :: There are two possibilities:<br /> ::: '''5.3.B.1.''' If the opposite-direction extreme is found, t.4p is confirmed (found), and the program proceeds to sub-step 5.3.1.<br /> ::: '''5.3.B.2.''' If the opposite-direction extreme is not found, the program looks for a new potential t.4p following the instructions in sub-step 5.3.1.<br /> :: '''5.3.1.''' If t.4p is found, the program constructs a line from t.2p to t.4p and checks it for price crossings on the segment from t.1p (excluding it) to t.3 in the VMP (including t.3).<br /> ::: If unnecessary intersections are found, the program looks for the next potential t.4p on the segment following the instructions in 5.3.<br /> ::: If no unnecessary intersections are found, the algorithm proceeds to sub-step 5.4.<br /> :: '''5.3.2.''' Check for Absolute Level<br /> :: The program checks the bar of the potential t.3p for absoluteness. The level of t.3p should not be exceeded by the price on the segment between t.3p and potential t.4p (excluding it).<br /> ::: '''5.3.2.1.''' If the level of t.3p is exceeded, the potential t.3p is discarded, and the program looks for a new t.3p following the instructions in sub-step 5.1. and further according to the algorithm.<br /> <br /> :::: '''5.3.2.2.''' If the level of t.3p is not exceeded, t.3p is confirmed, t.4p is confirmed, and the algorithm proceeds to sub- step 5.4.<br /> <br /> ==== Presupposition Verification ====<br /> : ''' 5.4.''' Presuppositions undergo the following checks:<br /> :: '''A.''' - Bars t.1p, t.2p, t.3p must follow each other.<br /> :: '''B.''' - The distance in levels between t.1 and t.2 (hereinafter rank 12) must be at least the value of the Minimum Distance between t.1 and t.2 Levels of the Presupposition, which is set in the Calculation Parameters, from the distance between t.4 and t.5 levels of the EAM model(this is rank 45).<br /> <br /> :: If all checks are successful, the Presupposition is found. If there are no unchecked t.1p left, the algorithm proceeds to Step 6.<br /> <br /> :: If there are no unchecked t.1p left, the algorithm proceeds to Step 6.<br /> <br /> === '''Step VI. Check for AL price crossings''' ===<br /> <br /> ==== '''6 alfa.''' ==== <br /> First it is necessary to check for the presence of a fixed t.2. If it exists, it means we are in a branch of searching for alternative models. <br /> <br /> The potential Aims Line (from t.2 to t.4), hereinafter referred to as AL, is calculated, and then:<br /> : '''6 alfa.1.''' AL Crossing Check<br /> <br /> :: '''6 alfa.1. A.''' - If there are no AL price crossings, the algorithm proceeds to step 6 alfa.2.<br /> :: '''6 alfa.1. B.''' - If AL is crossed, the next potential t.5 is determined according to Step 2, starting from bar t.5+2.<br /> : '''6.2. alfa.''' Distance Check for AL and TL Intersection<br /> : If:<br /> :: - TL and AL of the model do not intersect on the right (in the future) or<br /> :: - the ratio of the distance in bars between t.2 and t.4 to the distance between t.4 and the calculated point 6 is less than the default value of the parameter &quot;Minimum ratio of t.2-t.4 to t.4-t.6 EAM,&quot; then the search for alternative models is terminated. Otherwise, the program proceeds to Step 9. <br /> <br /> ====''' In the general case (no precviously fixed t.2)''' ====<br /> The program performs the following checks for each of the potential FBs:<br /> : '''6.1.''' AL Price Crossing Check (not just touching)<br /> : If AL intersects with the price on the segment between t.2 and t.4, this pair of candidates for t.1 and t.2 (this FB) is rejected.<br /> :: '''6.1.A.''' If FBs are found that give AL without intersections, the algorithm proceeds to step 6.2.<br /> :: '''6.1.B.''' If there are no suitable FBs, the algorithm looks for a new t.5 according to Step 2.<br /> <br /> : '''6.2.''' Checking for intersection of AL and TL (hereinafter referred to as calculated point 6) with each other on the right (in the future) along the time axis.<br /> : If the ratio of the distance in bars between t.2 and t.4 to the distance between t.4 and the calculated t.6 is less than the default value of the parameter &quot;Minimum ratio of t.2-t.4 to t.4-t.6 VMP,&quot; then these candidates for t.1 and t.2 are rejected.<br /> : The following scenarios are possible:<br /> :: '''6.2.A.''' One or several potential FBs remain - in this case, the program proceeds to Step 7.<br /> :: '''6.2.B.''' There are no potential FBs left - in this case, the program looks for a new potential t.5, starting from Step 2 and onwards.<br /> <br /> === '''Step VII. Dtermintaion of FB's with and without 2X5''' ===<br /> <br /> The program checks for the intersection of the bodies of candles at t.2 and t.5 (hereinafter referred to as 2x5). If there is only one potential FB, determining FB with 2x5 is not required, and the program proceeds to Step 8.<br /> <br /> :'''7.1.''' If there are multiple potential BOs, some of which have 2x5 and some do not, those potential BOs that have 2x5 are filtered out, and the program proceeds to Step 8.<br /> <br /> :'''7.2.''' If all potential FBs have 2x5, then all are filtered out except the one whose t.2 level is closer to the t.3 level. The program proceeds to <br /> <br /> === '''Step VIII: Filtering Based on Presupposition''' ===<br /> <br /> The algorithm checks whether Presuppositions have been found for the analyzed model.<br /> <br /> :'''8.0.''' If no Presuppositions are found, the program proceeds to Step 9.<br /> <br /> :'''8.1.''' The model has one or more Presuppositions. For each Presupposition program checks if the available candidates for t.2 belong to the interval between the last price level intersection of t.1p and t.1p itself (t.1p can also be used as t.2 EAM).<br /> <br /> ::'''8.1.1.''' There are candidates for t.2 that belong to the interval between the last price level intersection of t.1p and t.1p itself. Such a Presupposition is retained.<br /> ::'''8.1.2.''' There are no candidates for t.2 within the specified interval. In this case, such a Presupposition is discarded and not further considered (meaning the model has no Presupposition).<br /> :'''8.2.''' If after checking all Presuppositions according to sub-step 8.1., there are one or more Presuppositions with candidates in t.2 within the interval between the last price level intersection of t.1p and t.1p itself (inclusive), then:<br /> <br /> : - Among such Presuppositions, only the one with t.1p occurring later on the time axis is considered further;<br /> : - Only those candidates that belong to the interval between the last price level intersection of t.1p and t.1p itself are retained as t.2 candidates for the remaining Presupposition.<br /> ::'''8.2.1.''' If only one potential FB remains, the model is confirmed.<br /> ::'''8.2.2.''' If more than one potential FB remains, the program proceeds to Step 9.<br /> <br /> ==References==<br /> &lt;references /&gt;</div>

Admin http://wiki.marketpawns.com/index.php?title=Main_Page&diff=202 2023-09-14T20:51:07Z

<p>Admin: /* Welcome to MarketPawns */</p> <hr /> <div>==Welcome to MarketPawns==<br /> [https://marketpawns.com '''MarketPawns''' (MP)] is a dynamic startup that has evolved from a simple technical analysis study into a comprehensive digital portal. Our platform is designed to facilitate interaction between analysts and traders through a variety of innovative tools. Here are some of them: <br /> <br /> *Automatic Chart Marking. At MarketPawns, we've streamlined the process of identifying and marking potential trading opportunities discoverd with the help of '''[[Universal Market Geometry (UMG)|Universal Market Geometry (UMG)]]'''. Our automatic search and chart marking system uses [[UMG models]] to mark financial instruments, saving you time and effort.<br /> *AI. We employ neural networks to estimate the probability of trading scenarios. Our free trading signals based on this technology, provides you with tools for making informed trading decisions.<br /> *Community. The Community Wall, accessible to registered users, cultivates a collaborative environment where users can exchange forecasts, discuss models, and vote on their effectiveness. '''[https://marketpawns.com MarketPawns]''' employ a ranking system, based on the ELO model, to acknowledge the most proficient analysts of the community.<br /> <br /> ==Links==<br /> *[[Key ideas of MarketPawns|MarketPawns Key Ideas]]<br /> *[[MarketPawns User Guide]]<br /> *[[Universal Market Geometry (UMG)]]<br /> *[[ELO rating]]<br /> *[[UMG General Concepts]]<br /> *[[ALGORITHM I]]<br /> *[[ALGORITHM II]]</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_II&diff=201 2023-09-12T21:40:16Z

<p>Admin: /* In the general case (no precviously fixed t.2)&#039; */</p> <hr /> <div>This article is not finished<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with UMG General Concepts.<br /> <br /> ==='''Step I. Search For Point 3 of the External Attraction Model (EAM) and the Sarting Point of the Previous Trend.'''===<br /> : '''1.1.''' The program looks for the first possible extreme, satisfying Single Bar Rule. Such an extreme is a candidate for potential point 3 ( potential t.3).<br /> : '''1.2.''' Next, the program checks the bars from right to left (i.e., in the past) from the bar containing the extreme candidate for point 3 to one of the following events:<br /> :: '''1.2.1.''' Found the last intersection (breakthrough) point by the price level of the candidate for point 3.<br /> ::In this case, the report displays: <br /> :: PREVdata: FullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.2.''' The program reached the starting point of the chart (i.e., the price did not intersect the level of point 3 after the starting point of the chart).<br /> ::In this case, the report displays: <br /> :: PREVdata: NoFullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.3.''' The price checked 300 bars preceding point 3 &lt;ref&gt;The depth of the search for the extreme confirming point 3 of EAM model&lt;/ref&gt;, but the level of step 3 did not intersect at this segment. The program looks for an absolute extreme (opposite to step 3) on the segment from the 300th bar before point 3 to point 3. The program proceeds to substep 1.3.<br /> : '''1.3.''' The program looks for an absolute extreme (opposite to point 3 extreme) on the segment:<br /> ::- from the last intersection by the price level of the candidate for point 3 (inclusive) (if came from 1.2.1.), or :: - from the starting point of the chart (if came from 1.2.2.), or <br /> :: - from 300 bars(if came from 1.2.3.) <br /> :: to point 3 (excluding).<br /> :: '''1.3.1.''' Absolute extreme found. The candidate for point 3 is confirmed; moreover, the found confirming extreme is the assumed (if coming from 1.2.2. or 1.2.3.) starting point of the preceding trend.'''<br /> ::The program checks for the absence of extremes equal to point 3 between the assumed starting point of the previous trend and point 3. <br /> :::'''1.3.1.1.''' If such an extreme is found, this candidate for point 3 is discarded, and this point 3 is discarded. <br /> :::'''1.3.1.2.''' If such an extreme is not found, the program proceeds to step 2.<br /> ::'''1.3.2.''' Absolute extreme not found. This point 3 is discarded.'''<br /> ::Simultaneously with step 1, the program launches the search for the next potential point 3.<br /> <br /> ==='''Step II. Search For Potentioal Points 5 and 4 ''' ===<br /> '''The Orientation rule (N1 requirement) for Algorithm II is as follows:'''<br /> If point 3 is low, then the level of point 5 should be higher than point 3. <br /> If point 3 is high, then the level of point 5 should be lower than point 3.<br /> '''Search for Point 5.''' The bar following the bar of Point 3 (and in repeated applications of this step - the bar specified in this algorithm) is checked for not overcoming the level of point 3 (since N1 requirement for Algorithm II must be observed).<br /> :'''2.1.''' If the price has overcome the level of point 3, the program discards the considered step 3 (due to N1 requirement).<br /> :'''2.2.''' If N1 requirement is met for the analyzed bar, it is checked for compliance with N1 requirement as a potential point 5 (hereafter - point 5 or t.5).<br /> ::'''2.2.1.''' If the analyzed bar is not an extreme according to N1 requirement (as a potential point 5), the program checks the next bar from the beginning of step 2.<br /> ::'''2.2.2.''' If the analyzed bar is determined as an extreme according to N1 requirement (as a potential point 5), then this bar is checked for reaching (but not necessarily overcoming) the level of point 3. There are 2 options:<br /> :::'''2.2.2.1.''' If the level of point 3 is reached, the program analyzes the next bar according to this step (i.e., from the beginning of step 2).<br /> :::'''2.2.2.2.''' If the level of point 3 is not reached, the analyzed bar is a potential point 5, and the program moves to substep 2.3.<br /> :'''2.3. Search for Point 4.''' The program searches for a bar, which was the last to cross the level of the considered potential point 5. Let's denote this bar as lcb5 (line-crossing-bar-5). If lcb5 coincides with the bar of point 3, we denote the bar following lcb5 as look4. Otherwise, look4 = lcb5. The program searches for a bar with the maximum (if point 3 is low) or minimum (if point 3 is high) price in the interval from lcb5 to potential point 5. Then this bar is checked for being an extreme according to N1 requirement as a potential pont 4 (hereafter – point 4 or t.4). There are 2 options:<br /> ::'''2.3.1.''' The bar is an absolute extreme (as a potential point 4). In this case, potential point 4 is found.<br /> :::'''2.3.1.1.''' If step 2 has already been determined (this is possible when this step is triggered during the search for an alternative model), the program checks the line chart for extra points in the section from step 2 to step 4. There are 2 options:<br /> ::::'''2.3.1.1.A.''' If extra points are found, the program processes the next bar after potential point 5 according to step 2.<br /> ::::'''2.3.1.1.B.''' Extra intersections are not found; the program moves to substep 2.4.<br /> :::'''2.3.1.2.''' If substep 2.3.1. is triggered during the search for the basic model, the program moves to substep 2.4.<br /> ::'''2.3.2.''' The bar is not an absolute extreme (as a potential point 4). In this case, the program looks for another candidate for point 5 according to this step (i.e., according to step 2).<br /> If the program has processed 50 bars in a row according to this step (step 2), and the program has not moved to another step of the algorithm, then this potential point 3 is discarded.<br /> If there are 150 or more bars&lt;ref&gt;Continuous search range of t.5 in one iteration for EAM model&lt;/ref&gt; between potential point 3 and the analyzed bar, and potential points 4 and 5 are not found, then this potential point 3 is discarded.<br /> :'''2.4.''' Real-Time Verification of t.5 <br /> :The potential t.5 bar is checked for the presence of bars between the analyzed bar and the potential t.4 bar, which contain price values more distant (or even equally distant) from the potential t.4 than the most distant from t.4 value of the analyzed bar. This is a check of the potential t.5 for beeing the '''potential absolute extreme'''. The following options are possible:<br /> ::'''2.4.1.''' If the extreme is potentially absolute, the program proceeds to step 3.<br /> ::'''2.4.2.''' If the extreme is not potentially absolute, the program checks the next bar starting from this step (i.e., step 2).<br /> <br /> ===''' Step III. Confirmation of Point 4. Searching for Alternative t.5 and t.5&quot; '''===<br /> The program checks whether the bar of potential t.5 has reached the level of t.4. Two scenarios are possible:<br /> :'''3.1.''' The Bar of Potential t.5 Has Reached t.4.<br /> :In this case:<br /> ::The model is built through absolute t.5.<br /> ::The t.5 bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> ::Point 4 is confirmed,<br /> ::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3 (since there is already possible to display the model through t.5 on the chart).<br /> :'''3.2.''' The Bar of Potential t.5 Has Not Reached t.4. <br /> :In this case, the program checks the next bar for reaching the level of t.4. The following options are possible:<br /> ::'''3.2.1. The Considered Bar Reaches the Level of Potential t.4. <br /> ::In this case:<br /> :::The model is built through absolute t.5.<br /> :::The considered bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> :::Point 4 is confirmed,<br /> :::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3.ext, but first goes through sub-step 3.3.<br /> ::'''3.2.2.''' The Considered Bar Does Not Reach the Level of t.4.<br /> ::In this case the program checks the next bar for overcoming the level of potential t.5. Two scenarios are possible:<br /> :::'''3.2.2.1.''' If the t.5 level is overcome, the analyzed bar is considered as a new potential t.5. The program processes this bar according to step 2.<br /> :::'''3.2.2.2.''' If the t.5 level is not overcome, the analyzed bar is checked for reaching the level of t.4 according to sub-step 3.2.<br /> ::In parallel (i.e., an additional branch is created), the program proceeds to sub-step 3.3 (since there is already an option to display the model through t.5 on the chart). The model in this branch receives a &quot;draw_flag&quot; label.<br /> :'''3.3.''' Construction of the Trend Line (TL). <br /> :A Trend Line (TL) is constructed from t.3 to t.5. Each bar between t.3 and t.5 is checked for breaking the TL. Two scenarios are possible:<br /> ::'''3.3.1.'''The Price Crosses the TL. <br /> ::In this case, the TL through t.3 is not constructed. The program searches for a candidate for point 3' (hereafter - t.3'). T.3' is selected in such a way that the TL' (constructed from t.3' to t.5) is not crossed by the price in the 3-5 segment. Rule No.1 for t.3' is not applied. T.3' cannot belong to the same bar as t.4. Two scenarios are possible:<br /> :::'''3.3.1.1.''' T.3' is found, this model is classified as built through t.3'. The program proceeds to step 4, or to sub-step 3.3.extended if coming from 3.2.<br /> :::'''3.3.1.2.''' T.3' is not found. In this case, the program searches for new potential t.5 and t.4 according to step 2.<br /> ::'''3.3.2.''' The Price Does Not Break the TL. <br /> ::In this case, this model is classified as built through t.3 (absolute extreme). The program proceeds to step 4, or to sub-step 3.3.ext. if current algorithm line is coming from 3.2.<br /> <br /> <br /> ::'''3.3.ext. Additional Trend Line Construction Through t.5&quot;.'''<br /> ::If:<br /> ::*The t.5 bar does not exceed the range of t.4;<br /> ::*At the time of model calculation, the level of t.4 is confirmed, then this model is checked for the possibility of constructing an additional Trend Line (TL) through t.5&quot;. Note: If t.4 is not confirmed, this model should be recalculated upon the appearance of a bar that confirms it's t.4.<br /> <br /> ::''' Definition: Point 5&quot; '''<br /> ::Point 5&quot; can lie in the segment between t.5 and the point confirming t.4. On this segment, a point is searched that meets the following requirements:<br /> <br /> ::''' Rule for Selecting Point 5&quot; High '''<br /> ::To the left of the bar containing t.5&quot;, the nearest high should be above the level of t.5.<br /> ::To the right of t.5&quot;, at least one nearest high should be below or equal to t.5. ::If the nearest high is equal to the level of t.5, then the next high should again be below or equal to the level of t.5, until at least one bar is strictly below the level of t.5.<br /> <br /> ::''' Rule for Selecting Point 5&quot; Low '''<br /> ::To the left of the bar containing t.5&quot;, the nearest low should be below the level of the extreme.<br /> ::To the right of t.5&quot;, at least one nearest low should be above or equal to t.5. If the nearest low is equal to the level of t.5, then the next low should again be above or equal to the level of t.5, until at least one bar is strictly above the level of t.5.<br /> <br /> ::''' Special Cases for Point 5&quot; '''<br /> ::Point 5&quot; may belong to a bar that has broken the level of t.4 (but only the first of such bars). If the bar of potential t.5&quot; breaks the level of calculated t.6 from t.5, then it is impossible to construct a TL through t.5&quot; for this model (this model does not contain such a point).<br /> <br /> :::'''3.3.ext.1.''' Additional TL Calculation <br /> :::If a bar is found that fits the rule for selecting 5&quot;, an additional TL is calculated for the potential t.5&quot; (hereafter TL&quot;). This line is checked for the absence of breaks in the segment from t.3/3'' to potential t.5&quot;.<br /> <br /> :::::'''3.3ext.1.a.''' If there is an intersection, the program moves to check the next bar as a potential t.5&quot;.<br /> <br /> :::::'''3.3ext.1.b.''' If there is no intersection, the found bar is compared with the previous candidate for t.5&quot; (if there was one in the previous iteration of the cycle). If the considered bar is closer to the level of t.4 than the candidate for t.5&quot;, then the considered bar becomes the new candidate for t.5&quot;.<br /> :::The check of bars continues in a cycle until a bar confirming t.4 is reached. If a candidate for t.5 is found as a result of the check, the program moves to sub-step 3.3ext.1.1; otherwise, it moves to step 4.<br /> ::::'''3.3ext.1.1.''' If the analyzed model is built through t.3', a candidate for t.3&quot; is sought in the segment t.3-t.3', through which such a line to t.5&quot; can be built that will not have price intersections in the segment t.3-t.3&quot;.<br /> :::::'''3.3ext.1.1.1.''' If a candidate for t.3&quot; is found, where there are no intersections, a check is made for the intersection of TL&quot; by the bar following t.5&quot;.<br /> ::::::'''3.3.ext.1.1.1.A.''' If there are intersections, t.5&quot; is declared canceled, and the next one is sought according to sub-step 3.3.ext.<br /> ::::::'''3.3.ext.1.1.1.B.''' Otherwise, the program moves to step 13.2.<br /> :::::'''3.3.ext.1.1.2.''' If a suitable t.3&quot; is not found, a re-search for a candidate for t.5&quot; is carried out according to sub-steps 3.3.ext., but in this case, if a candidate for t.5&quot; was found, it becomes a canceled candidate for t.5&quot;. The new candidate must already be further from t.4 than the previously discarded ones.<br /> ::::'''3.3ext.1.2.''' If the analyzed model is built through t.3, a check is made for the intersection of TL'' by the bar following t.5&quot;.<br /> :::::'''3.3ext.1.2.A.''' If there are intersections, t.5&quot; is declared as canceled t.5', and the next one is sought according to sub-step 3.3.ext.<br /> :::::'''3.3ext.1.2.B.''' If there are no intersections, the algorithm moves to step 13.2.<br /> :::'''3.3.ext.2.''' TL'' is checked for price intersections in the segment between t.5 (inclusive) and potential t.5&quot; (hereafter segment 5-5&quot;).<br /> ::::'''3.3.ext.2.1.''' If there is an intersection, then this 5&quot; is filtered out. A re-search for a candidate for t.5&quot; is carried out according to sub-steps 3.3.ext., but in this case, the new candidate must already be further from t.4 (in terms of time) than the previously discarded ones.<br /> ::::'''3.3.ext.2.2.''' If there are no intersections of TL&quot; in the segment 5-5&quot;, then t.5&quot; is found.<br /> ::::In this case, the report displays: EAM5&quot; EAM5&quot;<br /> ::::The program moves to step 4.<br /> ::::'''3.3.ext.2.3.''' If t.5&quot; is not found, the program moves to step 4.<br /> <br /> ==='''Step IV: Searching for Potential Foundation Blocks.'''===<br /> <br /> ====Initial Check====<br /> First, it is necessary to check for the presence of a fixed t.2. If it exists, it means we are in a branch for searching for alternative models.<br /> <br /> ::'''4.0.1.''' If t.2 is defined in the model, proceed to step 6.<br /> ::'''4.0.2.''' If t.2 is not defined, the program moves to step 4.1.<br /> ====Examination of Extremes====<br /> On the preceding trend, extremes are checked sequentially from right to left (i.e., into the past) from t.3 (or from another analyzed bar in repeated applications of this step) according to the N1 bar rule (as a candidate for t.2). Each found candidate for t.2 is checked for the presence of a confirming extreme (which also serves as t.1) according to the following algorithm:<br /> <br /> ::'''4.1.0.''' An extreme candidate for t.2 is found.<br /> ::'''4.1.1.''' The point of the last intersection &lt;ref&gt;High or low of a bar, repeating or crossing high or low of t.2 bar – is an intersection&lt;/ref&gt; of the candidate's level with the price is found. In this case, the program looks for the absolute maximum (if t.2 is a minimum, i.e., t.2 is low) or the absolute minimum (if t.2 is a maximum, i.e., t.2 is high) in the segment from the last intersection of the t.2 level with the price to t.2.<br /> :::'''4.1.1.1.''' Maximum/minimum not found. In this case, the program discards this candidate for t.2.<br /> :::'''4.1.1.2.''' Maximum/minimum found. In this case, the potential t.2 is confirmed.<br /> :::'''4.1.2.''' The program reaches the starting point of the chart.<br /> :::'''4.1.3.''' The check reaches the boundary of the Depth of Search for t.1 &lt;ref&gt;&quot;Search depth t.1 for EAM models&quot; is set in the Calculation Parameters. It is calculated in bars from the bar of the considered potential t.2. By default, this value is 50 bars.&lt;/ref&gt; for the model and none of the above events (4.1.1. or 4.1.2.) occurred.<br /> <br /> ::'''4.2.''' The search for Foundation Blocks (i.e., points 1 and 2, a.k.a FB) continues until one of the events in steps 4.2.A, 4.2.B or 4.2.C. occurs.<br /> :::'''4.2.A. The check reaches the bar containing the (presumed) starting point of the preceding trend (from sub-step 1.2.2.1.). This point is not considered as a potential t.2<br /> :::'''4.2.B.''' The check reaches the bar that intersects the level of the presumed point 4 of the considered model.<br /> :::'''4.2.C.''' A bar that is located at a distance (by time) from T.3 greater than or equal to X* (distance from T.3 to t.4), where x is the parameter set in the settings &lt;ref&gt; This is the &quot;Time Ratio of 23 to 24&quot;(by default it is 3)&lt;/ref&gt;.<br /> ::=== Results ===<br /> ::As a result of the search for potential t.2 (i.e., upon the occurrence of4.2.A, 4.2.B or 4.2.C.), two scenarios are possible:<br /> :::'''4.2.1. ''' One or more pairs of potential t.2 and t.1 are found (potential Foundation Blocks). The program moves to step 5.<br /> :::'''4.2.2. ''' No potential Foundation Blocks are found. In this case, the program looks for the next potential t.5 according to step 2.<br /> <br /> === '''Step V. Search for Presupposition''' ===<br /> Presupposition is an optional part of the EAM.<br /> The program attempts to construct Presuppositions from all available candidates for t.2.<br /> <br /> ==== Presupposition Search Algorithm ====<br /> The program takes each potential t.2 of the EAM (as part of a potential FB) as a t.1 of Presupposition (hereinafter t.1p). In other words, the program tries to construct Presuppositions from each of the t.2.<br /> <br /> Initially, the most recent (rightmost) potential t.2 (or the one specified in the algorithm if we have returned to the beginning of the Step V in the cycle) in the EAM is taken as a potential t.1p. If there are no more unconfirmed t.1p, the algorithm proceeds to Step 6.<br /> <br /> : '''5.1.''' The program sequentially checks bars from left to right (into the future) from the potential t.1p to t.3 of EAM model (excluding t.3) for being an extreme according to the N1 rule as point 3 of the Presupposition (hereinafter t.3p).<br /> <br /> : '''N1 rule for the Presupposition points'''<br /> : If t.1p is low, t.3p must be below t.1p.<br /> : If t.1p is high, t.3p must be above t.1p.<br /> <br /> :: '''5.1.1.''' If the potential t.3p is not found, the program considers the next (to the left of the previous) potential t.2 of the EAM (within the FB) as t.1p.<br /> :: If the potential t.3p is not found, and there are no more potential FBs, the algorithm proceeds to Step 6.<br /> :: '''5.1.2.''' Once the potential t.3p is found, the program searches for point 2 of the Presupposition (hereinafter t.2p) as an extreme with the maximum/minimum price on the segment from t.1p to t.3p (hereinafter segment 1p-3p).<br /> :: If a suitable extreme is not found, the algorithm looks for the next potential t.3p for the previously found t.1p.<br /> :: If a maximum/minimum is found, it is checked for for being an extreme (as t.2p).<br /> :: There are two possibilities:<br /> ::: '''5.1.2.1.''' The bar is an absolute extreme. In this case, a potential t.2p is found, and the program proceeds to step 5.2.<br /> ::: '''5.1.2.2.''' The bar is not an extreme. In this case, the program looks for another candidate for t.3p for the previously found t.1p following the instructions in 5.1.<br /> : '''5.2.''' The program constructs a line from t.1p to t.3p and checks it for price crossings on the segment from t.1p to t.3 of the EAM (including t.3 of EAM).<br /> :: '''5.2.1.''' If this lines price crossings are found, the program looks for a new candidate for t.3p for the previously found t.1p following the instructions in sub-step 5.1.<br /> :: '''5.2.2.''' If there are no price crossings, the program proceeds to sub-step 5.3.<br /> <br /> : '''5.3.''' The program searches for a potential point 4 of the Presupposition (t.4p) according to the N1 rule on the segment from t.3p to t.3 in the VMP (including t.3).<br /> <br /> : If t.1p is low, t.4p must be below t.2p. Each subsequent candidate for t.4p must be below the previous candidate for t.4p.<br /> : If t.1p is high, t.4p must be above t.2p. Each subsequent candidate for t.4p must be above the previous candidate for t.4p.<br /> : Possible scenarios:<br /> :: '''5.3.A.''' If the potential t.4p coincides with t.3 in the EAM, t.4p is confirmed (found), and the program proceeds to sub-step 5.3.1.<br /> :: '''5.3.B.''' If the potential t.4p does not coincide with t.3 in the EAM (i.e., it is located before it), the program looks for an opposite-direction potential t.4p extreme on the segment from the potential t.4p (excluding it) to the bar where the price again reached the value of the potential t.4p (excluding it).<br /> <br /> :: There are two possibilities:<br /> ::: '''5.3.B.1.''' If the opposite-direction extreme is found, t.4p is confirmed (found), and the program proceeds to sub-step 5.3.1.<br /> ::: '''5.3.B.2.''' If the opposite-direction extreme is not found, the program looks for a new potential t.4p following the instructions in sub-step 5.3.1.<br /> :: '''5.3.1.''' If t.4p is found, the program constructs a line from t.2p to t.4p and checks it for price crossings on the segment from t.1p (excluding it) to t.3 in the VMP (including t.3).<br /> ::: If unnecessary intersections are found, the program looks for the next potential t.4p on the segment following the instructions in 5.3.<br /> ::: If no unnecessary intersections are found, the algorithm proceeds to sub-step 5.4.<br /> :: '''5.3.2.''' Check for Absolute Level<br /> :: The program checks the bar of the potential t.3p for absoluteness. The level of t.3p should not be exceeded by the price on the segment between t.3p and potential t.4p (excluding it).<br /> ::: '''5.3.2.1.''' If the level of t.3p is exceeded, the potential t.3p is discarded, and the program looks for a new t.3p following the instructions in sub-step 5.1. and further according to the algorithm.<br /> <br /> :::: '''5.3.2.2.''' If the level of t.3p is not exceeded, t.3p is confirmed, t.4p is confirmed, and the algorithm proceeds to sub- step 5.4.<br /> <br /> ==== Presupposition Verification ====<br /> : ''' 5.4.''' Presuppositions undergo the following checks:<br /> :: '''A.''' - Bars t.1p, t.2p, t.3p must follow each other.<br /> :: '''B.''' - The distance in levels between t.1 and t.2 (hereinafter rank 12) must be at least the value of the Minimum Distance between t.1 and t.2 Levels of the Presupposition, which is set in the Calculation Parameters, from the distance between t.4 and t.5 levels of the EAM model(this is rank 45).<br /> <br /> :: If all checks are successful, the Presupposition is found. If there are no unchecked t.1p left, the algorithm proceeds to Step 6.<br /> <br /> :: If there are no unchecked t.1p left, the algorithm proceeds to Step 6.<br /> <br /> === '''Step VI. Check for AL price crossings''' ===<br /> <br /> ==== '''6 alfa.''' ==== <br /> First it is necessary to check for the presence of a fixed t.2. If it exists, it means we are in a branch of searching for alternative models. <br /> <br /> The potential Aims Line (from t.2 to t.4), hereinafter referred to as AL, is calculated, and then:<br /> : '''6 alfa.1.''' AL Crossing Check<br /> <br /> :: '''6 alfa.1. A.''' - If there are no AL price crossings, the algorithm proceeds to step 6 alfa.2.<br /> :: '''6 alfa.1. B.''' - If AL is crossed, the next potential t.5 is determined according to Step 2, starting from bar t.5+2.<br /> : '''6.2. alfa.''' Distance Check for AL and TL Intersection<br /> : If:<br /> :: - TL and AL of the model do not intersect on the right (in the future) or<br /> :: - the ratio of the distance in bars between t.2 and t.4 to the distance between t.4 and the calculated point 6 is less than the default value of the parameter &quot;Minimum ratio of t.2-t.4 to t.4-t.6 EAM,&quot; then the search for alternative models is terminated. Otherwise, the program proceeds to Step 9. <br /> <br /> ====''' In the general case (no precviously fixed t.2)''' ====<br /> The program performs the following checks for each of the potential FBs:<br /> : '''6.1.''' AL Price Crossing Check (not just touching)<br /> : If AL intersects with the price on the segment between t.2 and t.4, this pair of candidates for t.1 and t.2 (this FB) is rejected.<br /> :: '''6.1.A.''' If FBs are found that give AL without intersections, the algorithm proceeds to step 6.2.<br /> :: '''6.1.B.''' If there are no suitable FBs, the algorithm looks for a new t.5 according to Step 2.<br /> <br /> : '''6.2.''' Checking for intersection of AL and TL (hereinafter referred to as calculated point 6) with each other on the right (in the future) along the time axis.<br /> : If the ratio of the distance in bars between t.2 and t.4 to the distance between t.4 and the calculated t.6 is less than the default value of the parameter &quot;Minimum ratio of t.2-t.4 to t.4-t.6 VMP,&quot; then these candidates for t.1 and t.2 are rejected.<br /> : The following scenarios are possible:<br /> :: '''6.2.A.''' One or several potential FBs remain - in this case, the program proceeds to Step 7.<br /> :: '''6.2.B.''' There are no potential FBs left - in this case, the program looks for a new potential t.5, starting from Step 2 and onwards.<br /> <br /> === '''Step VII. Dtermintaion of FB's with and without 2X5''' ===<br /> <br /> The program checks for the intersection of the bodies of candles at t.2 and t.5 (hereinafter referred to as 2x5). If there is only one potential FB, determining FB with 2x5 is not required, and the program proceeds to Step 8.<br /> <br /> :'''7.1.''' If there are multiple potential BOs, some of which have 2x5 and some do not, those potential BOs that have 2x5 are filtered out, and the program proceeds to Step 8.<br /> <br /> :'''7.2.''' If all potential FBs have 2x5, then all are filtered out except the one whose t.2 level is closer to the t.3 level. The program proceeds to Step 8.<br /> <br /> ==References==<br /> &lt;references /&gt;</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_II&diff=200 2023-09-03T21:46:40Z

<p>Admin: Adding Steps 6 and 7</p> <hr /> <div>This article is not finished<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with UMG General Concepts.<br /> <br /> ==='''Step I. Search For Point 3 of the External Attraction Model (EAM) and the Sarting Point of the Previous Trend.'''===<br /> : '''1.1.''' The program looks for the first possible extreme, satisfying Single Bar Rule. Such an extreme is a candidate for potential point 3 ( potential t.3).<br /> : '''1.2.''' Next, the program checks the bars from right to left (i.e., in the past) from the bar containing the extreme candidate for point 3 to one of the following events:<br /> :: '''1.2.1.''' Found the last intersection (breakthrough) point by the price level of the candidate for point 3.<br /> ::In this case, the report displays: <br /> :: PREVdata: FullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.2.''' The program reached the starting point of the chart (i.e., the price did not intersect the level of point 3 after the starting point of the chart).<br /> ::In this case, the report displays: <br /> :: PREVdata: NoFullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.3.''' The price checked 300 bars preceding point 3 &lt;ref&gt;The depth of the search for the extreme confirming point 3 of EAM model&lt;/ref&gt;, but the level of step 3 did not intersect at this segment. The program looks for an absolute extreme (opposite to step 3) on the segment from the 300th bar before point 3 to point 3. The program proceeds to substep 1.3.<br /> : '''1.3.''' The program looks for an absolute extreme (opposite to point 3 extreme) on the segment:<br /> ::- from the last intersection by the price level of the candidate for point 3 (inclusive) (if came from 1.2.1.), or :: - from the starting point of the chart (if came from 1.2.2.), or <br /> :: - from 300 bars(if came from 1.2.3.) <br /> :: to point 3 (excluding).<br /> :: '''1.3.1.''' Absolute extreme found. The candidate for point 3 is confirmed; moreover, the found confirming extreme is the assumed (if coming from 1.2.2. or 1.2.3.) starting point of the preceding trend.'''<br /> ::The program checks for the absence of extremes equal to point 3 between the assumed starting point of the previous trend and point 3. <br /> :::'''1.3.1.1.''' If such an extreme is found, this candidate for point 3 is discarded, and this point 3 is discarded. <br /> :::'''1.3.1.2.''' If such an extreme is not found, the program proceeds to step 2.<br /> ::'''1.3.2.''' Absolute extreme not found. This point 3 is discarded.'''<br /> ::Simultaneously with step 1, the program launches the search for the next potential point 3.<br /> <br /> ==='''Step II. Search For Potentioal Points 5 and 4 ''' ===<br /> '''The Orientation rule (N1 requirement) for Algorithm II is as follows:'''<br /> If point 3 is low, then the level of point 5 should be higher than point 3. <br /> If point 3 is high, then the level of point 5 should be lower than point 3.<br /> '''Search for Point 5.''' The bar following the bar of Point 3 (and in repeated applications of this step - the bar specified in this algorithm) is checked for not overcoming the level of point 3 (since N1 requirement for Algorithm II must be observed).<br /> :'''2.1.''' If the price has overcome the level of point 3, the program discards the considered step 3 (due to N1 requirement).<br /> :'''2.2.''' If N1 requirement is met for the analyzed bar, it is checked for compliance with N1 requirement as a potential point 5 (hereafter - point 5 or t.5).<br /> ::'''2.2.1.''' If the analyzed bar is not an extreme according to N1 requirement (as a potential point 5), the program checks the next bar from the beginning of step 2.<br /> ::'''2.2.2.''' If the analyzed bar is determined as an extreme according to N1 requirement (as a potential point 5), then this bar is checked for reaching (but not necessarily overcoming) the level of point 3. There are 2 options:<br /> :::'''2.2.2.1.''' If the level of point 3 is reached, the program analyzes the next bar according to this step (i.e., from the beginning of step 2).<br /> :::'''2.2.2.2.''' If the level of point 3 is not reached, the analyzed bar is a potential point 5, and the program moves to substep 2.3.<br /> :'''2.3. Search for Point 4.''' The program searches for a bar, which was the last to cross the level of the considered potential point 5. Let's denote this bar as lcb5 (line-crossing-bar-5). If lcb5 coincides with the bar of point 3, we denote the bar following lcb5 as look4. Otherwise, look4 = lcb5. The program searches for a bar with the maximum (if point 3 is low) or minimum (if point 3 is high) price in the interval from lcb5 to potential point 5. Then this bar is checked for being an extreme according to N1 requirement as a potential pont 4 (hereafter – point 4 or t.4). There are 2 options:<br /> ::'''2.3.1.''' The bar is an absolute extreme (as a potential point 4). In this case, potential point 4 is found.<br /> :::'''2.3.1.1.''' If step 2 has already been determined (this is possible when this step is triggered during the search for an alternative model), the program checks the line chart for extra points in the section from step 2 to step 4. There are 2 options:<br /> ::::'''2.3.1.1.A.''' If extra points are found, the program processes the next bar after potential point 5 according to step 2.<br /> ::::'''2.3.1.1.B.''' Extra intersections are not found; the program moves to substep 2.4.<br /> :::'''2.3.1.2.''' If substep 2.3.1. is triggered during the search for the basic model, the program moves to substep 2.4.<br /> ::'''2.3.2.''' The bar is not an absolute extreme (as a potential point 4). In this case, the program looks for another candidate for point 5 according to this step (i.e., according to step 2).<br /> If the program has processed 50 bars in a row according to this step (step 2), and the program has not moved to another step of the algorithm, then this potential point 3 is discarded.<br /> If there are 150 or more bars&lt;ref&gt;Continuous search range of t.5 in one iteration for EAM model&lt;/ref&gt; between potential point 3 and the analyzed bar, and potential points 4 and 5 are not found, then this potential point 3 is discarded.<br /> :'''2.4.''' Real-Time Verification of t.5 <br /> :The potential t.5 bar is checked for the presence of bars between the analyzed bar and the potential t.4 bar, which contain price values more distant (or even equally distant) from the potential t.4 than the most distant from t.4 value of the analyzed bar. This is a check of the potential t.5 for beeing the '''potential absolute extreme'''. The following options are possible:<br /> ::'''2.4.1.''' If the extreme is potentially absolute, the program proceeds to step 3.<br /> ::'''2.4.2.''' If the extreme is not potentially absolute, the program checks the next bar starting from this step (i.e., step 2).<br /> <br /> ===''' Step III. Confirmation of Point 4. Searching for Alternative t.5 and t.5&quot; '''===<br /> The program checks whether the bar of potential t.5 has reached the level of t.4. Two scenarios are possible:<br /> :'''3.1.''' The Bar of Potential t.5 Has Reached t.4.<br /> :In this case:<br /> ::The model is built through absolute t.5.<br /> ::The t.5 bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> ::Point 4 is confirmed,<br /> ::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3 (since there is already possible to display the model through t.5 on the chart).<br /> :'''3.2.''' The Bar of Potential t.5 Has Not Reached t.4. <br /> :In this case, the program checks the next bar for reaching the level of t.4. The following options are possible:<br /> ::'''3.2.1. The Considered Bar Reaches the Level of Potential t.4. <br /> ::In this case:<br /> :::The model is built through absolute t.5.<br /> :::The considered bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> :::Point 4 is confirmed,<br /> :::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3.ext, but first goes through sub-step 3.3.<br /> ::'''3.2.2.''' The Considered Bar Does Not Reach the Level of t.4.<br /> ::In this case the program checks the next bar for overcoming the level of potential t.5. Two scenarios are possible:<br /> :::'''3.2.2.1.''' If the t.5 level is overcome, the analyzed bar is considered as a new potential t.5. The program processes this bar according to step 2.<br /> :::'''3.2.2.2.''' If the t.5 level is not overcome, the analyzed bar is checked for reaching the level of t.4 according to sub-step 3.2.<br /> ::In parallel (i.e., an additional branch is created), the program proceeds to sub-step 3.3 (since there is already an option to display the model through t.5 on the chart). The model in this branch receives a &quot;draw_flag&quot; label.<br /> :'''3.3.''' Construction of the Trend Line (TL). <br /> :A Trend Line (TL) is constructed from t.3 to t.5. Each bar between t.3 and t.5 is checked for breaking the TL. Two scenarios are possible:<br /> ::'''3.3.1.'''The Price Crosses the TL. <br /> ::In this case, the TL through t.3 is not constructed. The program searches for a candidate for point 3' (hereafter - t.3'). T.3' is selected in such a way that the TL' (constructed from t.3' to t.5) is not crossed by the price in the 3-5 segment. Rule No.1 for t.3' is not applied. T.3' cannot belong to the same bar as t.4. Two scenarios are possible:<br /> :::'''3.3.1.1.''' T.3' is found, this model is classified as built through t.3'. The program proceeds to step 4, or to sub-step 3.3.extended if coming from 3.2.<br /> :::'''3.3.1.2.''' T.3' is not found. In this case, the program searches for new potential t.5 and t.4 according to step 2.<br /> ::'''3.3.2.''' The Price Does Not Break the TL. <br /> ::In this case, this model is classified as built through t.3 (absolute extreme). The program proceeds to step 4, or to sub-step 3.3.ext. if current algorithm line is coming from 3.2.<br /> <br /> <br /> ::'''3.3.ext. Additional Trend Line Construction Through t.5&quot;.'''<br /> ::If:<br /> ::*The t.5 bar does not exceed the range of t.4;<br /> ::*At the time of model calculation, the level of t.4 is confirmed, then this model is checked for the possibility of constructing an additional Trend Line (TL) through t.5&quot;. Note: If t.4 is not confirmed, this model should be recalculated upon the appearance of a bar that confirms it's t.4.<br /> <br /> ::''' Definition: Point 5&quot; '''<br /> ::Point 5&quot; can lie in the segment between t.5 and the point confirming t.4. On this segment, a point is searched that meets the following requirements:<br /> <br /> ::''' Rule for Selecting Point 5&quot; High '''<br /> ::To the left of the bar containing t.5&quot;, the nearest high should be above the level of t.5.<br /> ::To the right of t.5&quot;, at least one nearest high should be below or equal to t.5. ::If the nearest high is equal to the level of t.5, then the next high should again be below or equal to the level of t.5, until at least one bar is strictly below the level of t.5.<br /> <br /> ::''' Rule for Selecting Point 5&quot; Low '''<br /> ::To the left of the bar containing t.5&quot;, the nearest low should be below the level of the extreme.<br /> ::To the right of t.5&quot;, at least one nearest low should be above or equal to t.5. If the nearest low is equal to the level of t.5, then the next low should again be above or equal to the level of t.5, until at least one bar is strictly above the level of t.5.<br /> <br /> ::''' Special Cases for Point 5&quot; '''<br /> ::Point 5&quot; may belong to a bar that has broken the level of t.4 (but only the first of such bars). If the bar of potential t.5&quot; breaks the level of calculated t.6 from t.5, then it is impossible to construct a TL through t.5&quot; for this model (this model does not contain such a point).<br /> <br /> :::'''3.3.ext.1.''' Additional TL Calculation <br /> :::If a bar is found that fits the rule for selecting 5&quot;, an additional TL is calculated for the potential t.5&quot; (hereafter TL&quot;). This line is checked for the absence of breaks in the segment from t.3/3'' to potential t.5&quot;.<br /> <br /> :::::'''3.3ext.1.a.''' If there is an intersection, the program moves to check the next bar as a potential t.5&quot;.<br /> <br /> :::::'''3.3ext.1.b.''' If there is no intersection, the found bar is compared with the previous candidate for t.5&quot; (if there was one in the previous iteration of the cycle). If the considered bar is closer to the level of t.4 than the candidate for t.5&quot;, then the considered bar becomes the new candidate for t.5&quot;.<br /> :::The check of bars continues in a cycle until a bar confirming t.4 is reached. If a candidate for t.5 is found as a result of the check, the program moves to sub-step 3.3ext.1.1; otherwise, it moves to step 4.<br /> ::::'''3.3ext.1.1.''' If the analyzed model is built through t.3', a candidate for t.3&quot; is sought in the segment t.3-t.3', through which such a line to t.5&quot; can be built that will not have price intersections in the segment t.3-t.3&quot;.<br /> :::::'''3.3ext.1.1.1.''' If a candidate for t.3&quot; is found, where there are no intersections, a check is made for the intersection of TL&quot; by the bar following t.5&quot;.<br /> ::::::'''3.3.ext.1.1.1.A.''' If there are intersections, t.5&quot; is declared canceled, and the next one is sought according to sub-step 3.3.ext.<br /> ::::::'''3.3.ext.1.1.1.B.''' Otherwise, the program moves to step 13.2.<br /> :::::'''3.3.ext.1.1.2.''' If a suitable t.3&quot; is not found, a re-search for a candidate for t.5&quot; is carried out according to sub-steps 3.3.ext., but in this case, if a candidate for t.5&quot; was found, it becomes a canceled candidate for t.5&quot;. The new candidate must already be further from t.4 than the previously discarded ones.<br /> ::::'''3.3ext.1.2.''' If the analyzed model is built through t.3, a check is made for the intersection of TL'' by the bar following t.5&quot;.<br /> :::::'''3.3ext.1.2.A.''' If there are intersections, t.5&quot; is declared as canceled t.5', and the next one is sought according to sub-step 3.3.ext.<br /> :::::'''3.3ext.1.2.B.''' If there are no intersections, the algorithm moves to step 13.2.<br /> :::'''3.3.ext.2.''' TL'' is checked for price intersections in the segment between t.5 (inclusive) and potential t.5&quot; (hereafter segment 5-5&quot;).<br /> ::::'''3.3.ext.2.1.''' If there is an intersection, then this 5&quot; is filtered out. A re-search for a candidate for t.5&quot; is carried out according to sub-steps 3.3.ext., but in this case, the new candidate must already be further from t.4 (in terms of time) than the previously discarded ones.<br /> ::::'''3.3.ext.2.2.''' If there are no intersections of TL&quot; in the segment 5-5&quot;, then t.5&quot; is found.<br /> ::::In this case, the report displays: EAM5&quot; EAM5&quot;<br /> ::::The program moves to step 4.<br /> ::::'''3.3.ext.2.3.''' If t.5&quot; is not found, the program moves to step 4.<br /> <br /> ==='''Step IV: Searching for Potential Foundation Blocks.'''===<br /> <br /> ====Initial Check====<br /> First, it is necessary to check for the presence of a fixed t.2. If it exists, it means we are in a branch for searching for alternative models.<br /> <br /> ::'''4.0.1.''' If t.2 is defined in the model, proceed to step 6.<br /> ::'''4.0.2.''' If t.2 is not defined, the program moves to step 4.1.<br /> ====Examination of Extremes====<br /> On the preceding trend, extremes are checked sequentially from right to left (i.e., into the past) from t.3 (or from another analyzed bar in repeated applications of this step) according to the N1 bar rule (as a candidate for t.2). Each found candidate for t.2 is checked for the presence of a confirming extreme (which also serves as t.1) according to the following algorithm:<br /> <br /> ::'''4.1.0.''' An extreme candidate for t.2 is found.<br /> ::'''4.1.1.''' The point of the last intersection &lt;ref&gt;High or low of a bar, repeating or crossing high or low of t.2 bar – is an intersection&lt;/ref&gt; of the candidate's level with the price is found. In this case, the program looks for the absolute maximum (if t.2 is a minimum, i.e., t.2 is low) or the absolute minimum (if t.2 is a maximum, i.e., t.2 is high) in the segment from the last intersection of the t.2 level with the price to t.2.<br /> :::'''4.1.1.1.''' Maximum/minimum not found. In this case, the program discards this candidate for t.2.<br /> :::'''4.1.1.2.''' Maximum/minimum found. In this case, the potential t.2 is confirmed.<br /> :::'''4.1.2.''' The program reaches the starting point of the chart.<br /> :::'''4.1.3.''' The check reaches the boundary of the Depth of Search for t.1 &lt;ref&gt;&quot;Search depth t.1 for EAM models&quot; is set in the Calculation Parameters. It is calculated in bars from the bar of the considered potential t.2. By default, this value is 50 bars.&lt;/ref&gt; for the model and none of the above events (4.1.1. or 4.1.2.) occurred.<br /> <br /> ::'''4.2.''' The search for Foundation Blocks (i.e., points 1 and 2, a.k.a FB) continues until one of the events in steps 4.2.A, 4.2.B or 4.2.C. occurs.<br /> :::'''4.2.A. The check reaches the bar containing the (presumed) starting point of the preceding trend (from sub-step 1.2.2.1.). This point is not considered as a potential t.2<br /> :::'''4.2.B.''' The check reaches the bar that intersects the level of the presumed point 4 of the considered model.<br /> :::'''4.2.C.''' A bar that is located at a distance (by time) from T.3 greater than or equal to X* (distance from T.3 to t.4), where x is the parameter set in the settings &lt;ref&gt; This is the &quot;Time Ratio of 23 to 24&quot;(by default it is 3)&lt;/ref&gt;.<br /> ::=== Results ===<br /> ::As a result of the search for potential t.2 (i.e., upon the occurrence of4.2.A, 4.2.B or 4.2.C.), two scenarios are possible:<br /> :::'''4.2.1. ''' One or more pairs of potential t.2 and t.1 are found (potential Foundation Blocks). The program moves to step 5.<br /> :::'''4.2.2. ''' No potential Foundation Blocks are found. In this case, the program looks for the next potential t.5 according to step 2.<br /> <br /> === '''Step V. Search for Presupposition''' ===<br /> Presupposition is an optional part of the EAM.<br /> The program attempts to construct Presuppositions from all available candidates for t.2.<br /> <br /> ==== Presupposition Search Algorithm ====<br /> The program takes each potential t.2 of the EAM (as part of a potential FB) as a t.1 of Presupposition (hereinafter t.1p). In other words, the program tries to construct Presuppositions from each of the t.2.<br /> <br /> Initially, the most recent (rightmost) potential t.2 (or the one specified in the algorithm if we have returned to the beginning of the Step V in the cycle) in the EAM is taken as a potential t.1p. If there are no more unconfirmed t.1p, the algorithm proceeds to Step 6.<br /> <br /> : '''5.1.''' The program sequentially checks bars from left to right (into the future) from the potential t.1p to t.3 of EAM model (excluding t.3) for being an extreme according to the N1 rule as point 3 of the Presupposition (hereinafter t.3p).<br /> <br /> : '''N1 rule for the Presupposition points'''<br /> : If t.1p is low, t.3p must be below t.1p.<br /> : If t.1p is high, t.3p must be above t.1p.<br /> <br /> :: '''5.1.1.''' If the potential t.3p is not found, the program considers the next (to the left of the previous) potential t.2 of the EAM (within the FB) as t.1p.<br /> :: If the potential t.3p is not found, and there are no more potential FBs, the algorithm proceeds to Step 6.<br /> :: '''5.1.2.''' Once the potential t.3p is found, the program searches for point 2 of the Presupposition (hereinafter t.2p) as an extreme with the maximum/minimum price on the segment from t.1p to t.3p (hereinafter segment 1p-3p).<br /> :: If a suitable extreme is not found, the algorithm looks for the next potential t.3p for the previously found t.1p.<br /> :: If a maximum/minimum is found, it is checked for for being an extreme (as t.2p).<br /> :: There are two possibilities:<br /> ::: '''5.1.2.1.''' The bar is an absolute extreme. In this case, a potential t.2p is found, and the program proceeds to step 5.2.<br /> ::: '''5.1.2.2.''' The bar is not an extreme. In this case, the program looks for another candidate for t.3p for the previously found t.1p following the instructions in 5.1.<br /> : '''5.2.''' The program constructs a line from t.1p to t.3p and checks it for price crossings on the segment from t.1p to t.3 of the EAM (including t.3 of EAM).<br /> :: '''5.2.1.''' If this lines price crossings are found, the program looks for a new candidate for t.3p for the previously found t.1p following the instructions in sub-step 5.1.<br /> :: '''5.2.2.''' If there are no price crossings, the program proceeds to sub-step 5.3.<br /> <br /> : '''5.3.''' The program searches for a potential point 4 of the Presupposition (t.4p) according to the N1 rule on the segment from t.3p to t.3 in the VMP (including t.3).<br /> <br /> : If t.1p is low, t.4p must be below t.2p. Each subsequent candidate for t.4p must be below the previous candidate for t.4p.<br /> : If t.1p is high, t.4p must be above t.2p. Each subsequent candidate for t.4p must be above the previous candidate for t.4p.<br /> : Possible scenarios:<br /> :: '''5.3.A.''' If the potential t.4p coincides with t.3 in the EAM, t.4p is confirmed (found), and the program proceeds to sub-step 5.3.1.<br /> :: '''5.3.B.''' If the potential t.4p does not coincide with t.3 in the EAM (i.e., it is located before it), the program looks for an opposite-direction potential t.4p extreme on the segment from the potential t.4p (excluding it) to the bar where the price again reached the value of the potential t.4p (excluding it).<br /> <br /> :: There are two possibilities:<br /> ::: '''5.3.B.1.''' If the opposite-direction extreme is found, t.4p is confirmed (found), and the program proceeds to sub-step 5.3.1.<br /> ::: '''5.3.B.2.''' If the opposite-direction extreme is not found, the program looks for a new potential t.4p following the instructions in sub-step 5.3.1.<br /> :: '''5.3.1.''' If t.4p is found, the program constructs a line from t.2p to t.4p and checks it for price crossings on the segment from t.1p (excluding it) to t.3 in the VMP (including t.3).<br /> ::: If unnecessary intersections are found, the program looks for the next potential t.4p on the segment following the instructions in 5.3.<br /> ::: If no unnecessary intersections are found, the algorithm proceeds to sub-step 5.4.<br /> :: '''5.3.2.''' Check for Absolute Level<br /> :: The program checks the bar of the potential t.3p for absoluteness. The level of t.3p should not be exceeded by the price on the segment between t.3p and potential t.4p (excluding it).<br /> ::: '''5.3.2.1.''' If the level of t.3p is exceeded, the potential t.3p is discarded, and the program looks for a new t.3p following the instructions in sub-step 5.1. and further according to the algorithm.<br /> <br /> :::: '''5.3.2.2.''' If the level of t.3p is not exceeded, t.3p is confirmed, t.4p is confirmed, and the algorithm proceeds to sub- step 5.4.<br /> <br /> ==== Presupposition Verification ====<br /> : ''' 5.4.''' Presuppositions undergo the following checks:<br /> :: '''A.''' - Bars t.1p, t.2p, t.3p must follow each other.<br /> :: '''B.''' - The distance in levels between t.1 and t.2 (hereinafter rank 12) must be at least the value of the Minimum Distance between t.1 and t.2 Levels of the Presupposition, which is set in the Calculation Parameters, from the distance between t.4 and t.5 levels of the EAM model(this is rank 45).<br /> <br /> :: If all checks are successful, the Presupposition is found. If there are no unchecked t.1p left, the algorithm proceeds to Step 6.<br /> <br /> :: If there are no unchecked t.1p left, the algorithm proceeds to Step 6.<br /> <br /> === '''Step VI. Check for AL price crossings''' ===<br /> <br /> ==== '''6 alfa.''' ==== <br /> First it is necessary to check for the presence of a fixed t.2. If it exists, it means we are in a branch of searching for alternative models. <br /> <br /> The potential Aims Line (from t.2 to t.4), hereinafter referred to as AL, is calculated, and then:<br /> : '''6 alfa.1.''' AL Crossing Check<br /> <br /> :: '''6 alfa.1. A.''' - If there are no AL price crossings, the algorithm proceeds to step 6 alfa.2.<br /> :: '''6 alfa.1. B.''' - If AL is crossed, the next potential t.5 is determined according to Step 2, starting from bar t.5+2.<br /> : '''6.2. alfa.''' Distance Check for AL and TL Intersection<br /> : If:<br /> :: - TL and AL of the model do not intersect on the right (in the future) or<br /> :: - the ratio of the distance in bars between t.2 and t.4 to the distance between t.4 and the calculated point 6 is less than the default value of the parameter &quot;Minimum ratio of t.2-t.4 to t.4-t.6 EAM,&quot; then the search for alternative models is terminated. Otherwise, the program proceeds to Step 9. <br /> <br /> ====''' In the general case (no precviously fixed t.2)'''' ====<br /> The program performs the following checks for each of the potential FBs:<br /> : '''6.1.''' AL Price Crossing Check (not just touching)<br /> : If AL intersects with the price on the segment between t.2 and t.4, this pair of candidates for t.1 and t.2 (this FB) is rejected.<br /> :: '''6.1.A.''' If FBs are found that give AL without intersections, the algorithm proceeds to step 6.2.<br /> :: '''6.1.B.''' If there are no suitable FBs, the algorithm looks for a new t.5 according to Step 2.<br /> <br /> : '''6.2.''' Checking for intersection of AL and TL (hereinafter referred to as calculated point 6) with each other on the right (in the future) along the time axis.<br /> : If the ratio of the distance in bars between t.2 and t.4 to the distance between t.4 and the calculated t.6 is less than the default value of the parameter &quot;Minimum ratio of t.2-t.4 to t.4-t.6 VMP,&quot; then these candidates for t.1 and t.2 are rejected.<br /> : The following scenarios are possible:<br /> :: '''6.2.A.''' One or several potential FBs remain - in this case, the program proceeds to Step 7.<br /> :: '''6.2.B.''' There are no potential FBs left - in this case, the program looks for a new potential t.5, starting from Step 2 and onwards.<br /> <br /> === '''Step VII. Dtermintaion of FB's with and without 2X5''' ===<br /> <br /> The program checks for the intersection of the bodies of candles at t.2 and t.5 (hereinafter referred to as 2x5). If there is only one potential FB, determining FB with 2x5 is not required, and the program proceeds to Step 8.<br /> <br /> :'''7.1.''' If there are multiple potential BOs, some of which have 2x5 and some do not, those potential BOs that have 2x5 are filtered out, and the program proceeds to Step 8.<br /> <br /> :'''7.2.''' If all potential FBs have 2x5, then all are filtered out except the one whose t.2 level is closer to the t.3 level. The program proceeds to Step 8.<br /> <br /> ==References==<br /> &lt;references /&gt;</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_II&diff=199 2023-09-02T20:03:16Z

<p>Admin: </p> <hr /> <div>This article is not finished<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with UMG General Concepts.<br /> <br /> ==='''Step I. Search For Point 3 of the External Attraction Model (EAM) and the Sarting Point of the Previous Trend.'''===<br /> : '''1.1.''' The program looks for the first possible extreme, satisfying Single Bar Rule. Such an extreme is a candidate for potential point 3 ( potential t.3).<br /> : '''1.2.''' Next, the program checks the bars from right to left (i.e., in the past) from the bar containing the extreme candidate for point 3 to one of the following events:<br /> :: '''1.2.1.''' Found the last intersection (breakthrough) point by the price level of the candidate for point 3.<br /> ::In this case, the report displays: <br /> :: PREVdata: FullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.2.''' The program reached the starting point of the chart (i.e., the price did not intersect the level of point 3 after the starting point of the chart).<br /> ::In this case, the report displays: <br /> :: PREVdata: NoFullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.3.''' The price checked 300 bars preceding point 3 &lt;ref&gt;The depth of the search for the extreme confirming point 3 of EAM model&lt;/ref&gt;, but the level of step 3 did not intersect at this segment. The program looks for an absolute extreme (opposite to step 3) on the segment from the 300th bar before point 3 to point 3. The program proceeds to substep 1.3.<br /> : '''1.3.''' The program looks for an absolute extreme (opposite to point 3 extreme) on the segment:<br /> ::- from the last intersection by the price level of the candidate for point 3 (inclusive) (if came from 1.2.1.), or :: - from the starting point of the chart (if came from 1.2.2.), or <br /> :: - from 300 bars(if came from 1.2.3.) <br /> :: to point 3 (excluding).<br /> :: '''1.3.1.''' Absolute extreme found. The candidate for point 3 is confirmed; moreover, the found confirming extreme is the assumed (if coming from 1.2.2. or 1.2.3.) starting point of the preceding trend.'''<br /> ::The program checks for the absence of extremes equal to point 3 between the assumed starting point of the previous trend and point 3. <br /> :::'''1.3.1.1.''' If such an extreme is found, this candidate for point 3 is discarded, and this point 3 is discarded. <br /> :::'''1.3.1.2.''' If such an extreme is not found, the program proceeds to step 2.<br /> ::'''1.3.2.''' Absolute extreme not found. This point 3 is discarded.'''<br /> ::Simultaneously with step 1, the program launches the search for the next potential point 3.<br /> <br /> ==='''Step II. Search For Potentioal Points 5 and 4 ''' ===<br /> '''The Orientation rule (N1 requirement) for Algorithm II is as follows:'''<br /> If point 3 is low, then the level of point 5 should be higher than point 3. <br /> If point 3 is high, then the level of point 5 should be lower than point 3.<br /> '''Search for Point 5.''' The bar following the bar of Point 3 (and in repeated applications of this step - the bar specified in this algorithm) is checked for not overcoming the level of point 3 (since N1 requirement for Algorithm II must be observed).<br /> :'''2.1.''' If the price has overcome the level of point 3, the program discards the considered step 3 (due to N1 requirement).<br /> :'''2.2.''' If N1 requirement is met for the analyzed bar, it is checked for compliance with N1 requirement as a potential point 5 (hereafter - point 5 or t.5).<br /> ::'''2.2.1.''' If the analyzed bar is not an extreme according to N1 requirement (as a potential point 5), the program checks the next bar from the beginning of step 2.<br /> ::'''2.2.2.''' If the analyzed bar is determined as an extreme according to N1 requirement (as a potential point 5), then this bar is checked for reaching (but not necessarily overcoming) the level of point 3. There are 2 options:<br /> :::'''2.2.2.1.''' If the level of point 3 is reached, the program analyzes the next bar according to this step (i.e., from the beginning of step 2).<br /> :::'''2.2.2.2.''' If the level of point 3 is not reached, the analyzed bar is a potential point 5, and the program moves to substep 2.3.<br /> :'''2.3. Search for Point 4.''' The program searches for a bar, which was the last to cross the level of the considered potential point 5. Let's denote this bar as lcb5 (line-crossing-bar-5). If lcb5 coincides with the bar of point 3, we denote the bar following lcb5 as look4. Otherwise, look4 = lcb5. The program searches for a bar with the maximum (if point 3 is low) or minimum (if point 3 is high) price in the interval from lcb5 to potential point 5. Then this bar is checked for being an extreme according to N1 requirement as a potential pont 4 (hereafter – point 4 or t.4). There are 2 options:<br /> ::'''2.3.1.''' The bar is an absolute extreme (as a potential point 4). In this case, potential point 4 is found.<br /> :::'''2.3.1.1.''' If step 2 has already been determined (this is possible when this step is triggered during the search for an alternative model), the program checks the line chart for extra points in the section from step 2 to step 4. There are 2 options:<br /> ::::'''2.3.1.1.A.''' If extra points are found, the program processes the next bar after potential point 5 according to step 2.<br /> ::::'''2.3.1.1.B.''' Extra intersections are not found; the program moves to substep 2.4.<br /> :::'''2.3.1.2.''' If substep 2.3.1. is triggered during the search for the basic model, the program moves to substep 2.4.<br /> ::'''2.3.2.''' The bar is not an absolute extreme (as a potential point 4). In this case, the program looks for another candidate for point 5 according to this step (i.e., according to step 2).<br /> If the program has processed 50 bars in a row according to this step (step 2), and the program has not moved to another step of the algorithm, then this potential point 3 is discarded.<br /> If there are 150 or more bars&lt;ref&gt;Continuous search range of t.5 in one iteration for EAM model&lt;/ref&gt; between potential point 3 and the analyzed bar, and potential points 4 and 5 are not found, then this potential point 3 is discarded.<br /> :'''2.4.''' Real-Time Verification of t.5 <br /> :The potential t.5 bar is checked for the presence of bars between the analyzed bar and the potential t.4 bar, which contain price values more distant (or even equally distant) from the potential t.4 than the most distant from t.4 value of the analyzed bar. This is a check of the potential t.5 for beeing the '''potential absolute extreme'''. The following options are possible:<br /> ::'''2.4.1.''' If the extreme is potentially absolute, the program proceeds to step 3.<br /> ::'''2.4.2.''' If the extreme is not potentially absolute, the program checks the next bar starting from this step (i.e., step 2).<br /> <br /> ===''' Step III. Confirmation of Point 4. Searching for Alternative t.5 and t.5&quot; '''===<br /> The program checks whether the bar of potential t.5 has reached the level of t.4. Two scenarios are possible:<br /> :'''3.1.''' The Bar of Potential t.5 Has Reached t.4.<br /> :In this case:<br /> ::The model is built through absolute t.5.<br /> ::The t.5 bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> ::Point 4 is confirmed,<br /> ::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3 (since there is already possible to display the model through t.5 on the chart).<br /> :'''3.2.''' The Bar of Potential t.5 Has Not Reached t.4. <br /> :In this case, the program checks the next bar for reaching the level of t.4. The following options are possible:<br /> ::'''3.2.1. The Considered Bar Reaches the Level of Potential t.4. <br /> ::In this case:<br /> :::The model is built through absolute t.5.<br /> :::The considered bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> :::Point 4 is confirmed,<br /> :::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3.ext, but first goes through sub-step 3.3.<br /> ::'''3.2.2.''' The Considered Bar Does Not Reach the Level of t.4.<br /> ::In this case the program checks the next bar for overcoming the level of potential t.5. Two scenarios are possible:<br /> :::'''3.2.2.1.''' If the t.5 level is overcome, the analyzed bar is considered as a new potential t.5. The program processes this bar according to step 2.<br /> :::'''3.2.2.2.''' If the t.5 level is not overcome, the analyzed bar is checked for reaching the level of t.4 according to sub-step 3.2.<br /> ::In parallel (i.e., an additional branch is created), the program proceeds to sub-step 3.3 (since there is already an option to display the model through t.5 on the chart). The model in this branch receives a &quot;draw_flag&quot; label.<br /> :'''3.3.''' Construction of the Trend Line (TL). <br /> :A Trend Line (TL) is constructed from t.3 to t.5. Each bar between t.3 and t.5 is checked for breaking the TL. Two scenarios are possible:<br /> ::'''3.3.1.'''The Price Crosses the TL. <br /> ::In this case, the TL through t.3 is not constructed. The program searches for a candidate for point 3' (hereafter - t.3'). T.3' is selected in such a way that the TL' (constructed from t.3' to t.5) is not crossed by the price in the 3-5 segment. Rule No.1 for t.3' is not applied. T.3' cannot belong to the same bar as t.4. Two scenarios are possible:<br /> :::'''3.3.1.1.''' T.3' is found, this model is classified as built through t.3'. The program proceeds to step 4, or to sub-step 3.3.extended if coming from 3.2.<br /> :::'''3.3.1.2.''' T.3' is not found. In this case, the program searches for new potential t.5 and t.4 according to step 2.<br /> ::'''3.3.2.''' The Price Does Not Break the TL. <br /> ::In this case, this model is classified as built through t.3 (absolute extreme). The program proceeds to step 4, or to sub-step 3.3.ext. if current algorithm line is coming from 3.2.<br /> <br /> <br /> ::'''3.3.ext. Additional Trend Line Construction Through t.5&quot;.'''<br /> ::If:<br /> ::*The t.5 bar does not exceed the range of t.4;<br /> ::*At the time of model calculation, the level of t.4 is confirmed, then this model is checked for the possibility of constructing an additional Trend Line (TL) through t.5&quot;. Note: If t.4 is not confirmed, this model should be recalculated upon the appearance of a bar that confirms it's t.4.<br /> <br /> ::''' Definition: Point 5&quot; '''<br /> ::Point 5&quot; can lie in the segment between t.5 and the point confirming t.4. On this segment, a point is searched that meets the following requirements:<br /> <br /> ::''' Rule for Selecting Point 5&quot; High '''<br /> ::To the left of the bar containing t.5&quot;, the nearest high should be above the level of t.5.<br /> ::To the right of t.5&quot;, at least one nearest high should be below or equal to t.5. ::If the nearest high is equal to the level of t.5, then the next high should again be below or equal to the level of t.5, until at least one bar is strictly below the level of t.5.<br /> <br /> ::''' Rule for Selecting Point 5&quot; Low '''<br /> ::To the left of the bar containing t.5&quot;, the nearest low should be below the level of the extreme.<br /> ::To the right of t.5&quot;, at least one nearest low should be above or equal to t.5. If the nearest low is equal to the level of t.5, then the next low should again be above or equal to the level of t.5, until at least one bar is strictly above the level of t.5.<br /> <br /> ::''' Special Cases for Point 5&quot; '''<br /> ::Point 5&quot; may belong to a bar that has broken the level of t.4 (but only the first of such bars). If the bar of potential t.5&quot; breaks the level of calculated t.6 from t.5, then it is impossible to construct a TL through t.5&quot; for this model (this model does not contain such a point).<br /> <br /> :::'''3.3.ext.1.''' Additional TL Calculation <br /> :::If a bar is found that fits the rule for selecting 5&quot;, an additional TL is calculated for the potential t.5&quot; (hereafter TL&quot;). This line is checked for the absence of breaks in the segment from t.3/3'' to potential t.5&quot;.<br /> <br /> :::::'''3.3ext.1.a.''' If there is an intersection, the program moves to check the next bar as a potential t.5&quot;.<br /> <br /> :::::'''3.3ext.1.b.''' If there is no intersection, the found bar is compared with the previous candidate for t.5&quot; (if there was one in the previous iteration of the cycle). If the considered bar is closer to the level of t.4 than the candidate for t.5&quot;, then the considered bar becomes the new candidate for t.5&quot;.<br /> :::The check of bars continues in a cycle until a bar confirming t.4 is reached. If a candidate for t.5 is found as a result of the check, the program moves to sub-step 3.3ext.1.1; otherwise, it moves to step 4.<br /> ::::'''3.3ext.1.1.''' If the analyzed model is built through t.3', a candidate for t.3&quot; is sought in the segment t.3-t.3', through which such a line to t.5&quot; can be built that will not have price intersections in the segment t.3-t.3&quot;.<br /> :::::'''3.3ext.1.1.1.''' If a candidate for t.3&quot; is found, where there are no intersections, a check is made for the intersection of TL&quot; by the bar following t.5&quot;.<br /> ::::::'''3.3.ext.1.1.1.A.''' If there are intersections, t.5&quot; is declared canceled, and the next one is sought according to sub-step 3.3.ext.<br /> ::::::'''3.3.ext.1.1.1.B.''' Otherwise, the program moves to step 13.2.<br /> :::::'''3.3.ext.1.1.2.''' If a suitable t.3&quot; is not found, a re-search for a candidate for t.5&quot; is carried out according to sub-steps 3.3.ext., but in this case, if a candidate for t.5&quot; was found, it becomes a canceled candidate for t.5&quot;. The new candidate must already be further from t.4 than the previously discarded ones.<br /> ::::'''3.3ext.1.2.''' If the analyzed model is built through t.3, a check is made for the intersection of TL'' by the bar following t.5&quot;.<br /> :::::'''3.3ext.1.2.A.''' If there are intersections, t.5&quot; is declared as canceled t.5', and the next one is sought according to sub-step 3.3.ext.<br /> :::::'''3.3ext.1.2.B.''' If there are no intersections, the algorithm moves to step 13.2.<br /> :::'''3.3.ext.2.''' TL'' is checked for price intersections in the segment between t.5 (inclusive) and potential t.5&quot; (hereafter segment 5-5&quot;).<br /> ::::'''3.3.ext.2.1.''' If there is an intersection, then this 5&quot; is filtered out. A re-search for a candidate for t.5&quot; is carried out according to sub-steps 3.3.ext., but in this case, the new candidate must already be further from t.4 (in terms of time) than the previously discarded ones.<br /> ::::'''3.3.ext.2.2.''' If there are no intersections of TL&quot; in the segment 5-5&quot;, then t.5&quot; is found.<br /> ::::In this case, the report displays: EAM5&quot; EAM5&quot;<br /> ::::The program moves to step 4.<br /> ::::'''3.3.ext.2.3.''' If t.5&quot; is not found, the program moves to step 4.<br /> <br /> ==='''Step IV: Searching for Potential Foundation Blocks.'''===<br /> <br /> ====Initial Check====<br /> First, it is necessary to check for the presence of a fixed t.2. If it exists, it means we are in a branch for searching for alternative models.<br /> <br /> ::'''4.0.1.''' If t.2 is defined in the model, proceed to step 6.<br /> ::'''4.0.2.''' If t.2 is not defined, the program moves to step 4.1.<br /> ====Examination of Extremes====<br /> On the preceding trend, extremes are checked sequentially from right to left (i.e., into the past) from t.3 (or from another analyzed bar in repeated applications of this step) according to the N1 bar rule (as a candidate for t.2). Each found candidate for t.2 is checked for the presence of a confirming extreme (which also serves as t.1) according to the following algorithm:<br /> <br /> ::'''4.1.0.''' An extreme candidate for t.2 is found.<br /> ::'''4.1.1.''' The point of the last intersection &lt;ref&gt;High or low of a bar, repeating or crossing high or low of t.2 bar – is an intersection&lt;/ref&gt; of the candidate's level with the price is found. In this case, the program looks for the absolute maximum (if t.2 is a minimum, i.e., t.2 is low) or the absolute minimum (if t.2 is a maximum, i.e., t.2 is high) in the segment from the last intersection of the t.2 level with the price to t.2.<br /> :::'''4.1.1.1.''' Maximum/minimum not found. In this case, the program discards this candidate for t.2.<br /> :::'''4.1.1.2.''' Maximum/minimum found. In this case, the potential t.2 is confirmed.<br /> :::'''4.1.2.''' The program reaches the starting point of the chart.<br /> :::'''4.1.3.''' The check reaches the boundary of the Depth of Search for t.1 &lt;ref&gt;&quot;Search depth t.1 for EAM models&quot; is set in the Calculation Parameters. It is calculated in bars from the bar of the considered potential t.2. By default, this value is 50 bars.&lt;/ref&gt; for the model and none of the above events (4.1.1. or 4.1.2.) occurred.<br /> <br /> ::'''4.2.''' The search for Foundation Blocks (i.e., points 1 and 2, a.k.a FB) continues until one of the events in steps 4.2.A, 4.2.B or 4.2.C. occurs.<br /> :::'''4.2.A. The check reaches the bar containing the (presumed) starting point of the preceding trend (from sub-step 1.2.2.1.). This point is not considered as a potential t.2<br /> :::'''4.2.B.''' The check reaches the bar that intersects the level of the presumed point 4 of the considered model.<br /> :::'''4.2.C.''' A bar that is located at a distance (by time) from T.3 greater than or equal to X* (distance from T.3 to t.4), where x is the parameter set in the settings &lt;ref&gt; This is the &quot;Time Ratio of 23 to 24&quot;(by default it is 3)&lt;/ref&gt;.<br /> ::=== Results ===<br /> ::As a result of the search for potential t.2 (i.e., upon the occurrence of4.2.A, 4.2.B or 4.2.C.), two scenarios are possible:<br /> :::'''4.2.1. ''' One or more pairs of potential t.2 and t.1 are found (potential Foundation Blocks). The program moves to step 5.<br /> :::'''4.2.2. ''' No potential Foundation Blocks are found. In this case, the program looks for the next potential t.5 according to step 2.<br /> <br /> === '''Step V. Search for Presupposition''' ===<br /> Presupposition is an optional part of the EAM.<br /> The program attempts to construct Presuppositions from all available candidates for t.2.<br /> <br /> ==== Presupposition Search Algorithm ====<br /> The program takes each potential t.2 of the EAM (as part of a potential FB) as a t.1 of Presupposition (hereinafter t.1p). In other words, the program tries to construct Presuppositions from each of the t.2.<br /> <br /> Initially, the most recent (rightmost) potential t.2 (or the one specified in the algorithm if we have returned to the beginning of the Step V in the cycle) in the EAM is taken as a potential t.1p. If there are no more unconfirmed t.1p, the algorithm proceeds to Step 6.<br /> <br /> : '''5.1.''' The program sequentially checks bars from left to right (into the future) from the potential t.1p to t.3 of EAM model (excluding t.3) for being an extreme according to the N1 rule as point 3 of the Presupposition (hereinafter t.3p).<br /> <br /> : '''N1 rule for the Presupposition points'''<br /> : If t.1p is low, t.3p must be below t.1p.<br /> : If t.1p is high, t.3p must be above t.1p.<br /> <br /> :: '''5.1.1.''' If the potential t.3p is not found, the program considers the next (to the left of the previous) potential t.2 of the EAM (within the FB) as t.1p.<br /> :: If the potential t.3p is not found, and there are no more potential FBs, the algorithm proceeds to Step 6.<br /> :: '''5.1.2.''' Once the potential t.3p is found, the program searches for point 2 of the Presupposition (hereinafter t.2p) as an extreme with the maximum/minimum price on the segment from t.1p to t.3p (hereinafter segment 1p-3p).<br /> :: If a suitable extreme is not found, the algorithm looks for the next potential t.3p for the previously found t.1p.<br /> :: If a maximum/minimum is found, it is checked for for being an extreme (as t.2p).<br /> :: There are two possibilities:<br /> ::: '''5.1.2.1.''' The bar is an absolute extreme. In this case, a potential t.2p is found, and the program proceeds to step 5.2.<br /> ::: '''5.1.2.2.''' The bar is not an extreme. In this case, the program looks for another candidate for t.3p for the previously found t.1p following the instructions in 5.1.<br /> : '''5.2.''' The program constructs a line from t.1p to t.3p and checks it for price crossings on the segment from t.1p to t.3 of the EAM (including t.3 of EAM).<br /> :: '''5.2.1.''' If this lines price crossings are found, the program looks for a new candidate for t.3p for the previously found t.1p following the instructions in sub-step 5.1.<br /> :: '''5.2.2.''' If there are no price crossings, the program proceeds to sub-step 5.3.<br /> <br /> : '''5.3.''' The program searches for a potential point 4 of the Presupposition (t.4p) according to the N1 rule on the segment from t.3p to t.3 in the VMP (including t.3).<br /> <br /> : If t.1p is low, t.4p must be below t.2p. Each subsequent candidate for t.4p must be below the previous candidate for t.4p.<br /> : If t.1p is high, t.4p must be above t.2p. Each subsequent candidate for t.4p must be above the previous candidate for t.4p.<br /> : Possible scenarios:<br /> :: '''5.3.A.''' If the potential t.4p coincides with t.3 in the EAM, t.4p is confirmed (found), and the program proceeds to sub-step 5.3.1.<br /> :: '''5.3.B.''' If the potential t.4p does not coincide with t.3 in the EAM (i.e., it is located before it), the program looks for an opposite-direction potential t.4p extreme on the segment from the potential t.4p (excluding it) to the bar where the price again reached the value of the potential t.4p (excluding it).<br /> <br /> :: There are two possibilities:<br /> ::: '''5.3.B.1.''' If the opposite-direction extreme is found, t.4p is confirmed (found), and the program proceeds to sub-step 5.3.1.<br /> ::: '''5.3.B.2.''' If the opposite-direction extreme is not found, the program looks for a new potential t.4p following the instructions in sub-step 5.3.1.<br /> :: '''5.3.1.''' If t.4p is found, the program constructs a line from t.2p to t.4p and checks it for price crossings on the segment from t.1p (excluding it) to t.3 in the VMP (including t.3).<br /> ::: If unnecessary intersections are found, the program looks for the next potential t.4p on the segment following the instructions in 5.3.<br /> ::: If no unnecessary intersections are found, the algorithm proceeds to sub-step 5.4.<br /> :: '''5.3.2.''' Check for Absolute Level<br /> :: The program checks the bar of the potential t.3p for absoluteness. The level of t.3p should not be exceeded by the price on the segment between t.3p and potential t.4p (excluding it).<br /> ::: '''5.3.2.1.''' If the level of t.3p is exceeded, the potential t.3p is discarded, and the program looks for a new t.3p following the instructions in sub-step 5.1. and further according to the algorithm.<br /> <br /> :::: '''5.3.2.2.''' If the level of t.3p is not exceeded, t.3p is confirmed, t.4p is confirmed, and the algorithm proceeds to sub- step 5.4.<br /> <br /> ==== Presupposition Verification ====<br /> : ''' 5.4.''' Presuppositions undergo the following checks:<br /> :: '''A.''' - Bars t.1p, t.2p, t.3p must follow each other.<br /> :: '''B.''' - The distance in levels between t.1 and t.2 (hereinafter rank 12) must be at least the value of the Minimum Distance between t.1 and t.2 Levels of the Presupposition, which is set in the Calculation Parameters, from the distance between t.4 and t.5 levels of the EAM model(this is rank 45).<br /> <br /> :: If all checks are successful, the Presupposition is found. If there are no unchecked t.1p left, the algorithm proceeds to Step 6.<br /> <br /> :: If there are no unchecked t.1p left, the algorithm proceeds to Step 6.<br /> <br /> ==References==<br /> &lt;references /&gt;</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_II&diff=198 2023-09-02T20:02:04Z

<p>Admin: Adding Step 5</p> <hr /> <div>This article is not finished<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with UMG General Concepts.<br /> <br /> ==='''Step I. Search For Point 3 of the External Attraction Model (EAM) and the Sarting Point of the Previous Trend.'''===<br /> : '''1.1.''' The program looks for the first possible extreme, satisfying Single Bar Rule. Such an extreme is a candidate for potential point 3 ( potential t.3).<br /> : '''1.2.''' Next, the program checks the bars from right to left (i.e., in the past) from the bar containing the extreme candidate for point 3 to one of the following events:<br /> :: '''1.2.1.''' Found the last intersection (breakthrough) point by the price level of the candidate for point 3.<br /> ::In this case, the report displays: <br /> :: PREVdata: FullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.2.''' The program reached the starting point of the chart (i.e., the price did not intersect the level of point 3 after the starting point of the chart).<br /> ::In this case, the report displays: <br /> :: PREVdata: NoFullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.3.''' The price checked 300 bars preceding point 3 &lt;ref&gt;The depth of the search for the extreme confirming point 3 of EAM model&lt;/ref&gt;, but the level of step 3 did not intersect at this segment. The program looks for an absolute extreme (opposite to step 3) on the segment from the 300th bar before point 3 to point 3. The program proceeds to substep 1.3.<br /> : '''1.3.''' The program looks for an absolute extreme (opposite to point 3 extreme) on the segment:<br /> ::- from the last intersection by the price level of the candidate for point 3 (inclusive) (if came from 1.2.1.), or :: - from the starting point of the chart (if came from 1.2.2.), or <br /> :: - from 300 bars(if came from 1.2.3.) <br /> :: to point 3 (excluding).<br /> :: '''1.3.1.''' Absolute extreme found. The candidate for point 3 is confirmed; moreover, the found confirming extreme is the assumed (if coming from 1.2.2. or 1.2.3.) starting point of the preceding trend.'''<br /> ::The program checks for the absence of extremes equal to point 3 between the assumed starting point of the previous trend and point 3. <br /> :::'''1.3.1.1.''' If such an extreme is found, this candidate for point 3 is discarded, and this point 3 is discarded. <br /> :::'''1.3.1.2.''' If such an extreme is not found, the program proceeds to step 2.<br /> ::'''1.3.2.''' Absolute extreme not found. This point 3 is discarded.'''<br /> ::Simultaneously with step 1, the program launches the search for the next potential point 3.<br /> <br /> ==='''Step II. Search For Potentioal Points 5 and 4 ''' ===<br /> '''The Orientation rule (N1 requirement) for Algorithm II is as follows:'''<br /> If point 3 is low, then the level of point 5 should be higher than point 3. <br /> If point 3 is high, then the level of point 5 should be lower than point 3.<br /> '''Search for Point 5.''' The bar following the bar of Point 3 (and in repeated applications of this step - the bar specified in this algorithm) is checked for not overcoming the level of point 3 (since N1 requirement for Algorithm II must be observed).<br /> :'''2.1.''' If the price has overcome the level of point 3, the program discards the considered step 3 (due to N1 requirement).<br /> :'''2.2.''' If N1 requirement is met for the analyzed bar, it is checked for compliance with N1 requirement as a potential point 5 (hereafter - point 5 or t.5).<br /> ::'''2.2.1.''' If the analyzed bar is not an extreme according to N1 requirement (as a potential point 5), the program checks the next bar from the beginning of step 2.<br /> ::'''2.2.2.''' If the analyzed bar is determined as an extreme according to N1 requirement (as a potential point 5), then this bar is checked for reaching (but not necessarily overcoming) the level of point 3. There are 2 options:<br /> :::'''2.2.2.1.''' If the level of point 3 is reached, the program analyzes the next bar according to this step (i.e., from the beginning of step 2).<br /> :::'''2.2.2.2.''' If the level of point 3 is not reached, the analyzed bar is a potential point 5, and the program moves to substep 2.3.<br /> :'''2.3. Search for Point 4.''' The program searches for a bar, which was the last to cross the level of the considered potential point 5. Let's denote this bar as lcb5 (line-crossing-bar-5). If lcb5 coincides with the bar of point 3, we denote the bar following lcb5 as look4. Otherwise, look4 = lcb5. The program searches for a bar with the maximum (if point 3 is low) or minimum (if point 3 is high) price in the interval from lcb5 to potential point 5. Then this bar is checked for being an extreme according to N1 requirement as a potential pont 4 (hereafter – point 4 or t.4). There are 2 options:<br /> ::'''2.3.1.''' The bar is an absolute extreme (as a potential point 4). In this case, potential point 4 is found.<br /> :::'''2.3.1.1.''' If step 2 has already been determined (this is possible when this step is triggered during the search for an alternative model), the program checks the line chart for extra points in the section from step 2 to step 4. There are 2 options:<br /> ::::'''2.3.1.1.A.''' If extra points are found, the program processes the next bar after potential point 5 according to step 2.<br /> ::::'''2.3.1.1.B.''' Extra intersections are not found; the program moves to substep 2.4.<br /> :::'''2.3.1.2.''' If substep 2.3.1. is triggered during the search for the basic model, the program moves to substep 2.4.<br /> ::'''2.3.2.''' The bar is not an absolute extreme (as a potential point 4). In this case, the program looks for another candidate for point 5 according to this step (i.e., according to step 2).<br /> If the program has processed 50 bars in a row according to this step (step 2), and the program has not moved to another step of the algorithm, then this potential point 3 is discarded.<br /> If there are 150 or more bars&lt;ref&gt;Continuous search range of t.5 in one iteration for EAM model&lt;/ref&gt; between potential point 3 and the analyzed bar, and potential points 4 and 5 are not found, then this potential point 3 is discarded.<br /> :'''2.4.''' Real-Time Verification of t.5 <br /> :The potential t.5 bar is checked for the presence of bars between the analyzed bar and the potential t.4 bar, which contain price values more distant (or even equally distant) from the potential t.4 than the most distant from t.4 value of the analyzed bar. This is a check of the potential t.5 for beeing the '''potential absolute extreme'''. The following options are possible:<br /> ::'''2.4.1.''' If the extreme is potentially absolute, the program proceeds to step 3.<br /> ::'''2.4.2.''' If the extreme is not potentially absolute, the program checks the next bar starting from this step (i.e., step 2).<br /> <br /> ===''' Step III. Confirmation of Point 4. Searching for Alternative t.5 and t.5&quot; '''===<br /> The program checks whether the bar of potential t.5 has reached the level of t.4. Two scenarios are possible:<br /> :'''3.1.''' The Bar of Potential t.5 Has Reached t.4.<br /> :In this case:<br /> ::The model is built through absolute t.5.<br /> ::The t.5 bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> ::Point 4 is confirmed,<br /> ::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3 (since there is already possible to display the model through t.5 on the chart).<br /> :'''3.2.''' The Bar of Potential t.5 Has Not Reached t.4. <br /> :In this case, the program checks the next bar for reaching the level of t.4. The following options are possible:<br /> ::'''3.2.1. The Considered Bar Reaches the Level of Potential t.4. <br /> ::In this case:<br /> :::The model is built through absolute t.5.<br /> :::The considered bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> :::Point 4 is confirmed,<br /> :::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3.ext, but first goes through sub-step 3.3.<br /> ::'''3.2.2.''' The Considered Bar Does Not Reach the Level of t.4.<br /> ::In this case the program checks the next bar for overcoming the level of potential t.5. Two scenarios are possible:<br /> :::'''3.2.2.1.''' If the t.5 level is overcome, the analyzed bar is considered as a new potential t.5. The program processes this bar according to step 2.<br /> :::'''3.2.2.2.''' If the t.5 level is not overcome, the analyzed bar is checked for reaching the level of t.4 according to sub-step 3.2.<br /> ::In parallel (i.e., an additional branch is created), the program proceeds to sub-step 3.3 (since there is already an option to display the model through t.5 on the chart). The model in this branch receives a &quot;draw_flag&quot; label.<br /> :'''3.3.''' Construction of the Trend Line (TL). <br /> :A Trend Line (TL) is constructed from t.3 to t.5. Each bar between t.3 and t.5 is checked for breaking the TL. Two scenarios are possible:<br /> ::'''3.3.1.'''The Price Crosses the TL. <br /> ::In this case, the TL through t.3 is not constructed. The program searches for a candidate for point 3' (hereafter - t.3'). T.3' is selected in such a way that the TL' (constructed from t.3' to t.5) is not crossed by the price in the 3-5 segment. Rule No.1 for t.3' is not applied. T.3' cannot belong to the same bar as t.4. Two scenarios are possible:<br /> :::'''3.3.1.1.''' T.3' is found, this model is classified as built through t.3'. The program proceeds to step 4, or to sub-step 3.3.extended if coming from 3.2.<br /> :::'''3.3.1.2.''' T.3' is not found. In this case, the program searches for new potential t.5 and t.4 according to step 2.<br /> ::'''3.3.2.''' The Price Does Not Break the TL. <br /> ::In this case, this model is classified as built through t.3 (absolute extreme). The program proceeds to step 4, or to sub-step 3.3.ext. if current algorithm line is coming from 3.2.<br /> <br /> <br /> ::'''3.3.ext. Additional Trend Line Construction Through t.5&quot;.'''<br /> ::If:<br /> ::*The t.5 bar does not exceed the range of t.4;<br /> ::*At the time of model calculation, the level of t.4 is confirmed, then this model is checked for the possibility of constructing an additional Trend Line (TL) through t.5&quot;. Note: If t.4 is not confirmed, this model should be recalculated upon the appearance of a bar that confirms it's t.4.<br /> <br /> ::''' Definition: Point 5&quot; '''<br /> ::Point 5&quot; can lie in the segment between t.5 and the point confirming t.4. On this segment, a point is searched that meets the following requirements:<br /> <br /> ::''' Rule for Selecting Point 5&quot; High '''<br /> ::To the left of the bar containing t.5&quot;, the nearest high should be above the level of t.5.<br /> ::To the right of t.5&quot;, at least one nearest high should be below or equal to t.5. ::If the nearest high is equal to the level of t.5, then the next high should again be below or equal to the level of t.5, until at least one bar is strictly below the level of t.5.<br /> <br /> ::''' Rule for Selecting Point 5&quot; Low '''<br /> ::To the left of the bar containing t.5&quot;, the nearest low should be below the level of the extreme.<br /> ::To the right of t.5&quot;, at least one nearest low should be above or equal to t.5. If the nearest low is equal to the level of t.5, then the next low should again be above or equal to the level of t.5, until at least one bar is strictly above the level of t.5.<br /> <br /> ::''' Special Cases for Point 5&quot; '''<br /> ::Point 5&quot; may belong to a bar that has broken the level of t.4 (but only the first of such bars). If the bar of potential t.5&quot; breaks the level of calculated t.6 from t.5, then it is impossible to construct a TL through t.5&quot; for this model (this model does not contain such a point).<br /> <br /> :::'''3.3.ext.1.''' Additional TL Calculation <br /> :::If a bar is found that fits the rule for selecting 5&quot;, an additional TL is calculated for the potential t.5&quot; (hereafter TL&quot;). This line is checked for the absence of breaks in the segment from t.3/3'' to potential t.5&quot;.<br /> <br /> :::::'''3.3ext.1.a.''' If there is an intersection, the program moves to check the next bar as a potential t.5&quot;.<br /> <br /> :::::'''3.3ext.1.b.''' If there is no intersection, the found bar is compared with the previous candidate for t.5&quot; (if there was one in the previous iteration of the cycle). If the considered bar is closer to the level of t.4 than the candidate for t.5&quot;, then the considered bar becomes the new candidate for t.5&quot;.<br /> :::The check of bars continues in a cycle until a bar confirming t.4 is reached. If a candidate for t.5 is found as a result of the check, the program moves to sub-step 3.3ext.1.1; otherwise, it moves to step 4.<br /> ::::'''3.3ext.1.1.''' If the analyzed model is built through t.3', a candidate for t.3&quot; is sought in the segment t.3-t.3', through which such a line to t.5&quot; can be built that will not have price intersections in the segment t.3-t.3&quot;.<br /> :::::'''3.3ext.1.1.1.''' If a candidate for t.3&quot; is found, where there are no intersections, a check is made for the intersection of TL&quot; by the bar following t.5&quot;.<br /> ::::::'''3.3.ext.1.1.1.A.''' If there are intersections, t.5&quot; is declared canceled, and the next one is sought according to sub-step 3.3.ext.<br /> ::::::'''3.3.ext.1.1.1.B.''' Otherwise, the program moves to step 13.2.<br /> :::::'''3.3.ext.1.1.2.''' If a suitable t.3&quot; is not found, a re-search for a candidate for t.5&quot; is carried out according to sub-steps 3.3.ext., but in this case, if a candidate for t.5&quot; was found, it becomes a canceled candidate for t.5&quot;. The new candidate must already be further from t.4 than the previously discarded ones.<br /> ::::'''3.3ext.1.2.''' If the analyzed model is built through t.3, a check is made for the intersection of TL'' by the bar following t.5&quot;.<br /> :::::'''3.3ext.1.2.A.''' If there are intersections, t.5&quot; is declared as canceled t.5', and the next one is sought according to sub-step 3.3.ext.<br /> :::::'''3.3ext.1.2.B.''' If there are no intersections, the algorithm moves to step 13.2.<br /> :::'''3.3.ext.2.''' TL'' is checked for price intersections in the segment between t.5 (inclusive) and potential t.5&quot; (hereafter segment 5-5&quot;).<br /> ::::'''3.3.ext.2.1.''' If there is an intersection, then this 5&quot; is filtered out. A re-search for a candidate for t.5&quot; is carried out according to sub-steps 3.3.ext., but in this case, the new candidate must already be further from t.4 (in terms of time) than the previously discarded ones.<br /> ::::'''3.3.ext.2.2.''' If there are no intersections of TL&quot; in the segment 5-5&quot;, then t.5&quot; is found.<br /> ::::In this case, the report displays: EAM5&quot; EAM5&quot;<br /> ::::The program moves to step 4.<br /> ::::'''3.3.ext.2.3.''' If t.5&quot; is not found, the program moves to step 4.<br /> <br /> ==='''Step IV: Searching for Potential Foundation Blocks.'''===<br /> <br /> ====Initial Check====<br /> First, it is necessary to check for the presence of a fixed t.2. If it exists, it means we are in a branch for searching for alternative models.<br /> <br /> ::'''4.0.1.''' If t.2 is defined in the model, proceed to step 6.<br /> ::'''4.0.2.''' If t.2 is not defined, the program moves to step 4.1.<br /> ====Examination of Extremes====<br /> On the preceding trend, extremes are checked sequentially from right to left (i.e., into the past) from t.3 (or from another analyzed bar in repeated applications of this step) according to the N1 bar rule (as a candidate for t.2). Each found candidate for t.2 is checked for the presence of a confirming extreme (which also serves as t.1) according to the following algorithm:<br /> <br /> ::'''4.1.0.''' An extreme candidate for t.2 is found.<br /> ::'''4.1.1.''' The point of the last intersection &lt;ref&gt;High or low of a bar, repeating or crossing high or low of t.2 bar – is an intersection&lt;/ref&gt; of the candidate's level with the price is found. In this case, the program looks for the absolute maximum (if t.2 is a minimum, i.e., t.2 is low) or the absolute minimum (if t.2 is a maximum, i.e., t.2 is high) in the segment from the last intersection of the t.2 level with the price to t.2.<br /> :::'''4.1.1.1.''' Maximum/minimum not found. In this case, the program discards this candidate for t.2.<br /> :::'''4.1.1.2.''' Maximum/minimum found. In this case, the potential t.2 is confirmed.<br /> :::'''4.1.2.''' The program reaches the starting point of the chart.<br /> :::'''4.1.3.''' The check reaches the boundary of the Depth of Search for t.1 &lt;ref&gt;&quot;Search depth t.1 for EAM models&quot; is set in the Calculation Parameters. It is calculated in bars from the bar of the considered potential t.2. By default, this value is 50 bars.&lt;/ref&gt; for the model and none of the above events (4.1.1. or 4.1.2.) occurred.<br /> <br /> ::'''4.2.''' The search for Foundation Blocks (i.e., points 1 and 2, a.k.a FB) continues until one of the events in steps 4.2.A, 4.2.B or 4.2.C. occurs.<br /> :::'''4.2.A. The check reaches the bar containing the (presumed) starting point of the preceding trend (from sub-step 1.2.2.1.). This point is not considered as a potential t.2<br /> :::'''4.2.B.''' The check reaches the bar that intersects the level of the presumed point 4 of the considered model.<br /> :::'''4.2.C.''' A bar that is located at a distance (by time) from T.3 greater than or equal to X* (distance from T.3 to t.4), where x is the parameter set in the settings &lt;ref&gt; This is the &quot;Time Ratio of 23 to 24&quot;(by default it is 3)&lt;/ref&gt;.<br /> ::=== Results ===<br /> ::As a result of the search for potential t.2 (i.e., upon the occurrence of4.2.A, 4.2.B or 4.2.C.), two scenarios are possible:<br /> :::'''4.2.1. ''' One or more pairs of potential t.2 and t.1 are found (potential Foundation Blocks). The program moves to step 5.<br /> :::'''4.2.2. ''' No potential Foundation Blocks are found. In this case, the program looks for the next potential t.5 according to step 2.<br /> <br /> === '''Step V. Search for Presupposition''' ===<br /> Presupposition is an optional part of the EAM.<br /> The program attempts to construct Presuppositions from all available candidates for t.2.<br /> <br /> ==== Presupposition Search Algorithm ====<br /> The program takes each potential t.2 of the EAM (as part of a potential FB) as a t.1 of Presupposition (hereinafter t.1p). In other words, the program tries to construct Presuppositions from each of the t.2.<br /> <br /> Initially, the most recent (rightmost) potential t.2 (or the one specified in the algorithm if we have returned to the beginning of the Step V in the cycle) in the EAM is taken as a potential t.1p. If there are no more unconfirmed t.1p, the algorithm proceeds to Step 6.<br /> <br /> : '''5.1.''' The program sequentially checks bars from left to right (into the future) from the potential t.1p to t.3 of EAM model (excluding t.3) for being an extreme according to the N1 rule as point 3 of the Presupposition (hereinafter t.3p).<br /> <br /> : '''N1 rule for the Presupposition points'''<br /> : If t.1p is low, t.3p must be below t.1p.<br /> : If t.1p is high, t.3p must be above t.1p.<br /> <br /> :: '''5.1.1.''' If the potential t.3p is not found, the program considers the next (to the left of the previous) potential t.2 of the EAM (within the FB) as t.1p.<br /> :: If the potential t.3p is not found, and there are no more potential FBs, the algorithm proceeds to Step 6.<br /> :: '''5.1.2.''' Once the potential t.3p is found, the program searches for point 2 of the Presupposition (hereinafter t.2p) as an extreme with the maximum/minimum price on the segment from t.1p to t.3p (hereinafter segment 1p-3p).<br /> :: If a suitable extreme is not found, the algorithm looks for the next potential t.3p for the previously found t.1p.<br /> :: If a maximum/minimum is found, it is checked for for being an extreme (as t.2p).<br /> :: There are two possibilities:<br /> ::: '''5.1.2.1.''' The bar is an absolute extreme. In this case, a potential t.2p is found, and the program proceeds to step 5.2.<br /> ::: '''5.1.2.2.''' The bar is not an extreme. In this case, the program looks for another candidate for t.3p for the previously found t.1p following the instructions in 5.1.<br /> : '''5.2.''' The program constructs a line from t.1p to t.3p and checks it for price crossings on the segment from t.1p to t.3 of the EAM (including t.3 of EAM).<br /> :: '''5.2.1.''' If this lines price crossings are found, the program looks for a new candidate for t.3p for the previously found t.1p following the instructions in sub-step 5.1.<br /> :: '''5.2.2.''' If there are no price crossings, the program proceeds to sub-step 5.3.<br /> <br /> : '''5.3.''' The program searches for a potential point 4 of the Presupposition (t.4p) according to the N1 rule on the segment from t.3p to t.3 in the VMP (including t.3).<br /> <br /> : If t.1p is low, t.4p must be below t.2p. Each subsequent candidate for t.4p must be below the previous candidate for t.4p.<br /> : If t.1p is high, t.4p must be above t.2p. Each subsequent candidate for t.4p must be above the previous candidate for t.4p.<br /> : Possible scenarios:<br /> :: '''5.3.A.''' If the potential t.4p coincides with t.3 in the EAM, t.4p is confirmed (found), and the program proceeds to sub-step 5.3.1.<br /> :: '''5.3.B.''' If the potential t.4p does not coincide with t.3 in the EAM (i.e., it is located before it), the program looks for an opposite-direction potential t.4p extreme on the segment from the potential t.4p (excluding it) to the bar where the price again reached the value of the potential t.4p (excluding it).<br /> <br /> There are two possibilities:<br /> ::: '''5.3.B.1.''' If the opposite-direction extreme is found, t.4p is confirmed (found), and the program proceeds to sub-step 5.3.1.<br /> ::: '''5.3.B.2.''' If the opposite-direction extreme is not found, the program looks for a new potential t.4p following the instructions in sub-step 5.3.1.<br /> :: '''5.3.1.''' If t.4p is found, the program constructs a line from t.2p to t.4p and checks it for price crossings on the segment from t.1p (excluding it) to t.3 in the VMP (including t.3).<br /> ::: If unnecessary intersections are found, the program looks for the next potential t.4p on the segment following the instructions in 5.3.<br /> ::: If no unnecessary intersections are found, the algorithm proceeds to sub-step 5.4.<br /> :: '''5.3.2.''' Check for Absolute Level<br /> :: The program checks the bar of the potential t.3p for absoluteness. The level of t.3p should not be exceeded by the price on the segment between t.3p and potential t.4p (excluding it).<br /> ::: '''5.3.2.1.''' If the level of t.3p is exceeded, the potential t.3p is discarded, and the program looks for a new t.3p following the instructions in sub-step 5.1. and further according to the algorithm.<br /> <br /> :::: '''5.3.2.2.''' If the level of t.3p is not exceeded, t.3p is confirmed, t.4p is confirmed, and the algorithm proceeds to sub- step 5.4.<br /> <br /> ==== Presupposition Verification ====<br /> : ''' 5.4.''' Presuppositions undergo the following checks:<br /> :: '''A.''' - Bars t.1p, t.2p, t.3p must follow each other.<br /> :: '''B.''' - The distance in levels between t.1 and t.2 (hereinafter rank 12) must be at least the value of the Minimum Distance between t.1 and t.2 Levels of the Presupposition, which is set in the Calculation Parameters, from the distance between t.4 and t.5 levels of the EAM model(this is rank 45).<br /> <br /> :: If all checks are successful, the Presupposition is found. If there are no unchecked t.1p left, the algorithm proceeds to Step 6.<br /> <br /> :: If there are no unchecked t.1p left, the algorithm proceeds to Step 6.<br /> <br /> ==References==<br /> &lt;references /&gt;</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_II&diff=197 2023-08-27T13:41:25Z

<p>Admin: </p> <hr /> <div>This article is not finished<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with UMG General Concepts.<br /> <br /> ==='''Step I. Search For Point 3 of the External Attraction Model (EAM) and the Sarting Point of the Previous Trend.'''===<br /> : '''1.1.''' The program looks for the first possible extreme, satisfying Single Bar Rule. Such an extreme is a candidate for potential point 3 ( potential t.3).<br /> : '''1.2.''' Next, the program checks the bars from right to left (i.e., in the past) from the bar containing the extreme candidate for point 3 to one of the following events:<br /> :: '''1.2.1.''' Found the last intersection (breakthrough) point by the price level of the candidate for point 3.<br /> ::In this case, the report displays: <br /> :: PREVdata: FullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.2.''' The program reached the starting point of the chart (i.e., the price did not intersect the level of point 3 after the starting point of the chart).<br /> ::In this case, the report displays: <br /> :: PREVdata: NoFullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.3.''' The price checked 300 bars preceding point 3 &lt;ref&gt;The depth of the search for the extreme confirming point 3 of EAM model&lt;/ref&gt;, but the level of step 3 did not intersect at this segment. The program looks for an absolute extreme (opposite to step 3) on the segment from the 300th bar before point 3 to point 3. The program proceeds to substep 1.3.<br /> : '''1.3.''' The program looks for an absolute extreme (opposite to point 3 extreme) on the segment:<br /> ::- from the last intersection by the price level of the candidate for point 3 (inclusive) (if came from 1.2.1.), or :: - from the starting point of the chart (if came from 1.2.2.), or <br /> :: - from 300 bars(if came from 1.2.3.) <br /> :: to point 3 (excluding).<br /> :: '''1.3.1.''' Absolute extreme found. The candidate for point 3 is confirmed; moreover, the found confirming extreme is the assumed (if coming from 1.2.2. or 1.2.3.) starting point of the preceding trend.'''<br /> ::The program checks for the absence of extremes equal to point 3 between the assumed starting point of the previous trend and point 3. <br /> :::'''1.3.1.1.''' If such an extreme is found, this candidate for point 3 is discarded, and this point 3 is discarded. <br /> :::'''1.3.1.2.''' If such an extreme is not found, the program proceeds to step 2.<br /> ::'''1.3.2.''' Absolute extreme not found. This point 3 is discarded.'''<br /> ::Simultaneously with step 1, the program launches the search for the next potential point 3.<br /> <br /> ==='''Step II. Search For Potentioal Points 5 and 4 ''' ===<br /> '''The Orientation rule (N1 requirement) for Algorithm II is as follows:'''<br /> If point 3 is low, then the level of point 5 should be higher than point 3. <br /> If point 3 is high, then the level of point 5 should be lower than point 3.<br /> '''Search for Point 5.''' The bar following the bar of Point 3 (and in repeated applications of this step - the bar specified in this algorithm) is checked for not overcoming the level of point 3 (since N1 requirement for Algorithm II must be observed).<br /> :'''2.1.''' If the price has overcome the level of point 3, the program discards the considered step 3 (due to N1 requirement).<br /> :'''2.2.''' If N1 requirement is met for the analyzed bar, it is checked for compliance with N1 requirement as a potential point 5 (hereafter - point 5 or t.5).<br /> ::'''2.2.1.''' If the analyzed bar is not an extreme according to N1 requirement (as a potential point 5), the program checks the next bar from the beginning of step 2.<br /> ::'''2.2.2.''' If the analyzed bar is determined as an extreme according to N1 requirement (as a potential point 5), then this bar is checked for reaching (but not necessarily overcoming) the level of point 3. There are 2 options:<br /> :::'''2.2.2.1.''' If the level of point 3 is reached, the program analyzes the next bar according to this step (i.e., from the beginning of step 2).<br /> :::'''2.2.2.2.''' If the level of point 3 is not reached, the analyzed bar is a potential point 5, and the program moves to substep 2.3.<br /> :'''2.3. Search for Point 4.''' The program searches for a bar, which was the last to cross the level of the considered potential point 5. Let's denote this bar as lcb5 (line-crossing-bar-5). If lcb5 coincides with the bar of point 3, we denote the bar following lcb5 as look4. Otherwise, look4 = lcb5. The program searches for a bar with the maximum (if point 3 is low) or minimum (if point 3 is high) price in the interval from lcb5 to potential point 5. Then this bar is checked for being an extreme according to N1 requirement as a potential pont 4 (hereafter – point 4 or t.4). There are 2 options:<br /> ::'''2.3.1.''' The bar is an absolute extreme (as a potential point 4). In this case, potential point 4 is found.<br /> :::'''2.3.1.1.''' If step 2 has already been determined (this is possible when this step is triggered during the search for an alternative model), the program checks the line chart for extra points in the section from step 2 to step 4. There are 2 options:<br /> ::::'''2.3.1.1.A.''' If extra points are found, the program processes the next bar after potential point 5 according to step 2.<br /> ::::'''2.3.1.1.B.''' Extra intersections are not found; the program moves to substep 2.4.<br /> :::'''2.3.1.2.''' If substep 2.3.1. is triggered during the search for the basic model, the program moves to substep 2.4.<br /> ::'''2.3.2.''' The bar is not an absolute extreme (as a potential point 4). In this case, the program looks for another candidate for point 5 according to this step (i.e., according to step 2).<br /> If the program has processed 50 bars in a row according to this step (step 2), and the program has not moved to another step of the algorithm, then this potential point 3 is discarded.<br /> If there are 150 or more bars&lt;ref&gt;Continuous search range of t.5 in one iteration for EAM model&lt;/ref&gt; between potential point 3 and the analyzed bar, and potential points 4 and 5 are not found, then this potential point 3 is discarded.<br /> :'''2.4.''' Real-Time Verification of t.5 <br /> :The potential t.5 bar is checked for the presence of bars between the analyzed bar and the potential t.4 bar, which contain price values more distant (or even equally distant) from the potential t.4 than the most distant from t.4 value of the analyzed bar. This is a check of the potential t.5 for beeing the '''potential absolute extreme'''. The following options are possible:<br /> ::'''2.4.1.''' If the extreme is potentially absolute, the program proceeds to step 3.<br /> ::'''2.4.2.''' If the extreme is not potentially absolute, the program checks the next bar starting from this step (i.e., step 2).<br /> <br /> ===''' Step III. Confirmation of Point 4. Searching for Alternative t.5 and t.5&quot; '''===<br /> The program checks whether the bar of potential t.5 has reached the level of t.4. Two scenarios are possible:<br /> :'''3.1.''' The Bar of Potential t.5 Has Reached t.4.<br /> :In this case:<br /> ::The model is built through absolute t.5.<br /> ::The t.5 bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> ::Point 4 is confirmed,<br /> ::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3 (since there is already possible to display the model through t.5 on the chart).<br /> :'''3.2.''' The Bar of Potential t.5 Has Not Reached t.4. <br /> :In this case, the program checks the next bar for reaching the level of t.4. The following options are possible:<br /> ::'''3.2.1. The Considered Bar Reaches the Level of Potential t.4. <br /> ::In this case:<br /> :::The model is built through absolute t.5.<br /> :::The considered bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> :::Point 4 is confirmed,<br /> :::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3.ext, but first goes through sub-step 3.3.<br /> ::'''3.2.2.''' The Considered Bar Does Not Reach the Level of t.4.<br /> ::In this case the program checks the next bar for overcoming the level of potential t.5. Two scenarios are possible:<br /> :::'''3.2.2.1.''' If the t.5 level is overcome, the analyzed bar is considered as a new potential t.5. The program processes this bar according to step 2.<br /> :::'''3.2.2.2.''' If the t.5 level is not overcome, the analyzed bar is checked for reaching the level of t.4 according to sub-step 3.2.<br /> ::In parallel (i.e., an additional branch is created), the program proceeds to sub-step 3.3 (since there is already an option to display the model through t.5 on the chart). The model in this branch receives a &quot;draw_flag&quot; label.<br /> :'''3.3.''' Construction of the Trend Line (TL). <br /> :A Trend Line (TL) is constructed from t.3 to t.5. Each bar between t.3 and t.5 is checked for breaking the TL. Two scenarios are possible:<br /> ::'''3.3.1.'''The Price Crosses the TL. <br /> ::In this case, the TL through t.3 is not constructed. The program searches for a candidate for point 3' (hereafter - t.3'). T.3' is selected in such a way that the TL' (constructed from t.3' to t.5) is not crossed by the price in the 3-5 segment. Rule No.1 for t.3' is not applied. T.3' cannot belong to the same bar as t.4. Two scenarios are possible:<br /> :::'''3.3.1.1.''' T.3' is found, this model is classified as built through t.3'. The program proceeds to step 4, or to sub-step 3.3.extended if coming from 3.2.<br /> :::'''3.3.1.2.''' T.3' is not found. In this case, the program searches for new potential t.5 and t.4 according to step 2.<br /> ::'''3.3.2.''' The Price Does Not Break the TL. <br /> ::In this case, this model is classified as built through t.3 (absolute extreme). The program proceeds to step 4, or to sub-step 3.3.ext. if current algorithm line is coming from 3.2.<br /> <br /> <br /> ::'''3.3.ext. Additional Trend Line Construction Through t.5&quot;.'''<br /> ::If:<br /> ::*The t.5 bar does not exceed the range of t.4;<br /> ::*At the time of model calculation, the level of t.4 is confirmed, then this model is checked for the possibility of constructing an additional Trend Line (TL) through t.5&quot;. Note: If t.4 is not confirmed, this model should be recalculated upon the appearance of a bar that confirms it's t.4.<br /> <br /> ::''' Definition: Point 5&quot; '''<br /> ::Point 5&quot; can lie in the segment between t.5 and the point confirming t.4. On this segment, a point is searched that meets the following requirements:<br /> <br /> ::''' Rule for Selecting Point 5&quot; High '''<br /> ::To the left of the bar containing t.5&quot;, the nearest high should be above the level of t.5.<br /> ::To the right of t.5&quot;, at least one nearest high should be below or equal to t.5. ::If the nearest high is equal to the level of t.5, then the next high should again be below or equal to the level of t.5, until at least one bar is strictly below the level of t.5.<br /> <br /> ::''' Rule for Selecting Point 5&quot; Low '''<br /> ::To the left of the bar containing t.5&quot;, the nearest low should be below the level of the extreme.<br /> ::To the right of t.5&quot;, at least one nearest low should be above or equal to t.5. If the nearest low is equal to the level of t.5, then the next low should again be above or equal to the level of t.5, until at least one bar is strictly above the level of t.5.<br /> <br /> ::''' Special Cases for Point 5&quot; '''<br /> ::Point 5&quot; may belong to a bar that has broken the level of t.4 (but only the first of such bars). If the bar of potential t.5&quot; breaks the level of calculated t.6 from t.5, then it is impossible to construct a TL through t.5&quot; for this model (this model does not contain such a point).<br /> <br /> :::'''3.3.ext.1.''' Additional TL Calculation <br /> :::If a bar is found that fits the rule for selecting 5&quot;, an additional TL is calculated for the potential t.5&quot; (hereafter TL&quot;). This line is checked for the absence of breaks in the segment from t.3/3'' to potential t.5&quot;.<br /> <br /> :::::'''3.3ext.1.a.''' If there is an intersection, the program moves to check the next bar as a potential t.5&quot;.<br /> <br /> :::::'''3.3ext.1.b.''' If there is no intersection, the found bar is compared with the previous candidate for t.5&quot; (if there was one in the previous iteration of the cycle). If the considered bar is closer to the level of t.4 than the candidate for t.5&quot;, then the considered bar becomes the new candidate for t.5&quot;.<br /> :::The check of bars continues in a cycle until a bar confirming t.4 is reached. If a candidate for t.5 is found as a result of the check, the program moves to sub-step 3.3ext.1.1; otherwise, it moves to step 4.<br /> ::::'''3.3ext.1.1.''' If the analyzed model is built through t.3', a candidate for t.3&quot; is sought in the segment t.3-t.3', through which such a line to t.5&quot; can be built that will not have price intersections in the segment t.3-t.3&quot;.<br /> :::::'''3.3ext.1.1.1.''' If a candidate for t.3&quot; is found, where there are no intersections, a check is made for the intersection of TL&quot; by the bar following t.5&quot;.<br /> ::::::'''3.3.ext.1.1.1.A.''' If there are intersections, t.5&quot; is declared canceled, and the next one is sought according to sub-step 3.3.ext.<br /> ::::::'''3.3.ext.1.1.1.B.''' Otherwise, the program moves to step 13.2.<br /> :::::'''3.3.ext.1.1.2.''' If a suitable t.3&quot; is not found, a re-search for a candidate for t.5&quot; is carried out according to sub-steps 3.3.ext., but in this case, if a candidate for t.5&quot; was found, it becomes a canceled candidate for t.5&quot;. The new candidate must already be further from t.4 than the previously discarded ones.<br /> ::::'''3.3ext.1.2.''' If the analyzed model is built through t.3, a check is made for the intersection of TL'' by the bar following t.5&quot;.<br /> :::::'''3.3ext.1.2.A.''' If there are intersections, t.5&quot; is declared as canceled t.5', and the next one is sought according to sub-step 3.3.ext.<br /> :::::'''3.3ext.1.2.B.''' If there are no intersections, the algorithm moves to step 13.2.<br /> :::'''3.3.ext.2.''' TL'' is checked for price intersections in the segment between t.5 (inclusive) and potential t.5&quot; (hereafter segment 5-5&quot;).<br /> ::::'''3.3.ext.2.1.''' If there is an intersection, then this 5&quot; is filtered out. A re-search for a candidate for t.5&quot; is carried out according to sub-steps 3.3.ext., but in this case, the new candidate must already be further from t.4 (in terms of time) than the previously discarded ones.<br /> ::::'''3.3.ext.2.2.''' If there are no intersections of TL&quot; in the segment 5-5&quot;, then t.5&quot; is found.<br /> ::::In this case, the report displays: EAM5&quot; EAM5&quot;<br /> ::::The program moves to step 4.<br /> ::::'''3.3.ext.2.3.''' If t.5&quot; is not found, the program moves to step 4.<br /> <br /> ==='''Step IV: Searching for Potential Foundation Blocks.'''===<br /> <br /> ====Initial Check====<br /> First, it is necessary to check for the presence of a fixed t.2. If it exists, it means we are in a branch for searching for alternative models.<br /> <br /> ::'''4.0.1.''' If t.2 is defined in the model, proceed to step 6.<br /> ::'''4.0.2.''' If t.2 is not defined, the program moves to step 4.1.<br /> ====Examination of Extremes====<br /> On the preceding trend, extremes are checked sequentially from right to left (i.e., into the past) from t.3 (or from another analyzed bar in repeated applications of this step) according to the N1 bar rule (as a candidate for t.2). Each found candidate for t.2 is checked for the presence of a confirming extreme (which also serves as t.1) according to the following algorithm:<br /> <br /> ::'''4.1.0.''' An extreme candidate for t.2 is found.<br /> ::'''4.1.1.''' The point of the last intersection &lt;ref&gt;High or low of a bar, repeating or crossing high or low of t.2 bar – is an intersection&lt;/ref&gt; of the candidate's level with the price is found. In this case, the program looks for the absolute maximum (if t.2 is a minimum, i.e., t.2 is low) or the absolute minimum (if t.2 is a maximum, i.e., t.2 is high) in the segment from the last intersection of the t.2 level with the price to t.2.<br /> :::'''4.1.1.1.''' Maximum/minimum not found. In this case, the program discards this candidate for t.2.<br /> :::'''4.1.1.2.''' Maximum/minimum found. In this case, the potential t.2 is confirmed.<br /> :::'''4.1.2.''' The program reaches the starting point of the chart.<br /> :::'''4.1.3.''' The check reaches the boundary of the Depth of Search for t.1 &lt;ref&gt;&quot;Search depth t.1 for EAM models&quot; is set in the Calculation Parameters. It is calculated in bars from the bar of the considered potential t.2. By default, this value is 50 bars.&lt;/ref&gt; for the model and none of the above events (4.1.1. or 4.1.2.) occurred.<br /> <br /> ::'''4.2.''' The search for Foundation Blocks (i.e., points 1 and 2) continues until one of the events in steps 4.2.A, 4.2.B or 4.2.C. occurs.<br /> :::'''4.2.A. The check reaches the bar containing the (presumed) starting point of the preceding trend (from sub-step 1.2.2.1.). This point is not considered as a potential t.2<br /> :::'''4.2.B.''' The check reaches the bar that intersects the level of the presumed point 4 of the considered model.<br /> :::'''4.2.C.''' A bar that is located at a distance (by time) from T.3 greater than or equal to X* (distance from T.3 to t.4), where x is the parameter set in the settings &lt;ref&gt; This is the &quot;Time Ratio of 23 to 24&quot;(by default it is 3)&lt;/ref&gt;.<br /> ::=== Results ===<br /> ::As a result of the search for potential t.2 (i.e., upon the occurrence of4.2.A, 4.2.B or 4.2.C.), two scenarios are possible:<br /> :::'''4.2.1. ''' One or more pairs of potential t.2 and t.1 are found (potential Foundation Blocks). The program moves to step 5.<br /> :::'''4.2.2. ''' No potential Foundation Blocks are found. In this case, the program looks for the next potential t.5 according to step 2.<br /> <br /> <br /> ==References==<br /> &lt;references /&gt;</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_II&diff=196 2023-08-27T13:29:24Z

<p>Admin: </p> <hr /> <div>This article is not finished<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with UMG General Concepts.<br /> <br /> ==='''Step I. Search For Point 3 of the External Attraction Model (EAM) and the Sarting Point of the Previous Trend.'''===<br /> : '''1.1.''' The program looks for the first possible extreme, satisfying Single Bar Rule. Such an extreme is a candidate for potential point 3 ( potential t.3).<br /> : '''1.2.''' Next, the program checks the bars from right to left (i.e., in the past) from the bar containing the extreme candidate for point 3 to one of the following events:<br /> :: '''1.2.1.''' Found the last intersection (breakthrough) point by the price level of the candidate for point 3.<br /> ::In this case, the report displays: <br /> :: PREVdata: FullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.2.''' The program reached the starting point of the chart (i.e., the price did not intersect the level of point 3 after the starting point of the chart).<br /> ::In this case, the report displays: <br /> :: PREVdata: NoFullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.3.''' The price checked 300 bars preceding point 3 &lt;ref&gt;The depth of the search for the extreme confirming point 3 of EAM model&lt;/ref&gt;, but the level of step 3 did not intersect at this segment. The program looks for an absolute extreme (opposite to step 3) on the segment from the 300th bar before point 3 to point 3. The program proceeds to substep 1.3.<br /> : '''1.3.''' The program looks for an absolute extreme (opposite to point 3 extreme) on the segment:<br /> ::- from the last intersection by the price level of the candidate for point 3 (inclusive) (if came from 1.2.1.), or :: - from the starting point of the chart (if came from 1.2.2.), or <br /> :: - from 300 bars(if came from 1.2.3.) <br /> :: to point 3 (excluding).<br /> :: '''1.3.1.''' Absolute extreme found. The candidate for point 3 is confirmed; moreover, the found confirming extreme is the assumed (if coming from 1.2.2. or 1.2.3.) starting point of the preceding trend.'''<br /> ::The program checks for the absence of extremes equal to point 3 between the assumed starting point of the previous trend and point 3. <br /> :::'''1.3.1.1.''' If such an extreme is found, this candidate for point 3 is discarded, and this point 3 is discarded. <br /> :::'''1.3.1.2.''' If such an extreme is not found, the program proceeds to step 2.<br /> ::'''1.3.2.''' Absolute extreme not found. This point 3 is discarded.'''<br /> ::Simultaneously with step 1, the program launches the search for the next potential point 3.<br /> <br /> ==='''Step II. Search For Potentioal Points 5 and 4 ''' ===<br /> '''The Orientation rule (N1 requirement) for Algorithm II is as follows:'''<br /> If point 3 is low, then the level of point 5 should be higher than point 3. <br /> If point 3 is high, then the level of point 5 should be lower than point 3.<br /> '''Search for Point 5.''' The bar following the bar of Point 3 (and in repeated applications of this step - the bar specified in this algorithm) is checked for not overcoming the level of point 3 (since N1 requirement for Algorithm II must be observed).<br /> :'''2.1.''' If the price has overcome the level of point 3, the program discards the considered step 3 (due to N1 requirement).<br /> :'''2.2.''' If N1 requirement is met for the analyzed bar, it is checked for compliance with N1 requirement as a potential point 5 (hereafter - point 5 or t.5).<br /> ::'''2.2.1.''' If the analyzed bar is not an extreme according to N1 requirement (as a potential point 5), the program checks the next bar from the beginning of step 2.<br /> ::'''2.2.2.''' If the analyzed bar is determined as an extreme according to N1 requirement (as a potential point 5), then this bar is checked for reaching (but not necessarily overcoming) the level of point 3. There are 2 options:<br /> :::'''2.2.2.1.''' If the level of point 3 is reached, the program analyzes the next bar according to this step (i.e., from the beginning of step 2).<br /> :::'''2.2.2.2.''' If the level of point 3 is not reached, the analyzed bar is a potential point 5, and the program moves to substep 2.3.<br /> :'''2.3. Search for Point 4.''' The program searches for a bar, which was the last to cross the level of the considered potential point 5. Let's denote this bar as lcb5 (line-crossing-bar-5). If lcb5 coincides with the bar of point 3, we denote the bar following lcb5 as look4. Otherwise, look4 = lcb5. The program searches for a bar with the maximum (if point 3 is low) or minimum (if point 3 is high) price in the interval from lcb5 to potential point 5. Then this bar is checked for being an extreme according to N1 requirement as a potential pont 4 (hereafter – point 4 or t.4). There are 2 options:<br /> ::'''2.3.1.''' The bar is an absolute extreme (as a potential point 4). In this case, potential point 4 is found.<br /> :::'''2.3.1.1.''' If step 2 has already been determined (this is possible when this step is triggered during the search for an alternative model), the program checks the line chart for extra points in the section from step 2 to step 4. There are 2 options:<br /> ::::'''2.3.1.1.A.''' If extra points are found, the program processes the next bar after potential point 5 according to step 2.<br /> ::::'''2.3.1.1.B.''' Extra intersections are not found; the program moves to substep 2.4.<br /> :::'''2.3.1.2.''' If substep 2.3.1. is triggered during the search for the basic model, the program moves to substep 2.4.<br /> ::'''2.3.2.''' The bar is not an absolute extreme (as a potential point 4). In this case, the program looks for another candidate for point 5 according to this step (i.e., according to step 2).<br /> If the program has processed 50 bars in a row according to this step (step 2), and the program has not moved to another step of the algorithm, then this potential point 3 is discarded.<br /> If there are 150 or more bars&lt;ref&gt;Continuous search range of t.5 in one iteration for EAM model&lt;/ref&gt; between potential point 3 and the analyzed bar, and potential points 4 and 5 are not found, then this potential point 3 is discarded.<br /> :'''2.4.''' Real-Time Verification of t.5 <br /> :The potential t.5 bar is checked for the presence of bars between the analyzed bar and the potential t.4 bar, which contain price values more distant (or even equally distant) from the potential t.4 than the most distant from t.4 value of the analyzed bar. This is a check of the potential t.5 for beeing the '''potential absolute extreme'''. The following options are possible:<br /> ::'''2.4.1.''' If the extreme is potentially absolute, the program proceeds to step 3.<br /> ::'''2.4.2.''' If the extreme is not potentially absolute, the program checks the next bar starting from this step (i.e., step 2).<br /> <br /> ===''' Step III. Confirmation of Point 4. Searching for Alternative t.5 and t.5&quot; '''===<br /> The program checks whether the bar of potential t.5 has reached the level of t.4. Two scenarios are possible:<br /> :'''3.1.''' The Bar of Potential t.5 Has Reached t.4.<br /> :In this case:<br /> ::The model is built through absolute t.5.<br /> ::The t.5 bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> ::Point 4 is confirmed,<br /> ::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3 (since there is already possible to display the model through t.5 on the chart).<br /> :'''3.2.''' The Bar of Potential t.5 Has Not Reached t.4. <br /> :In this case, the program checks the next bar for reaching the level of t.4. The following options are possible:<br /> ::'''3.2.1. The Considered Bar Reaches the Level of Potential t.4. <br /> ::In this case:<br /> :::The model is built through absolute t.5.<br /> :::The considered bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> :::Point 4 is confirmed,<br /> :::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3.ext, but first goes through sub-step 3.3.<br /> ::'''3.2.2.''' The Considered Bar Does Not Reach the Level of t.4.<br /> ::In this case the program checks the next bar for overcoming the level of potential t.5. Two scenarios are possible:<br /> :::'''3.2.2.1.''' If the t.5 level is overcome, the analyzed bar is considered as a new potential t.5. The program processes this bar according to step 2.<br /> :::'''3.2.2.2.''' If the t.5 level is not overcome, the analyzed bar is checked for reaching the level of t.4 according to sub-step 3.2.<br /> ::In parallel (i.e., an additional branch is created), the program proceeds to sub-step 3.3 (since there is already an option to display the model through t.5 on the chart). The model in this branch receives a &quot;draw_flag&quot; label.<br /> :'''3.3.''' Construction of the Trend Line (TL). <br /> :A Trend Line (TL) is constructed from t.3 to t.5. Each bar between t.3 and t.5 is checked for breaking the TL. Two scenarios are possible:<br /> ::'''3.3.1.'''The Price Crosses the TL. <br /> ::In this case, the TL through t.3 is not constructed. The program searches for a candidate for point 3' (hereafter - t.3'). T.3' is selected in such a way that the TL' (constructed from t.3' to t.5) is not crossed by the price in the 3-5 segment. Rule No.1 for t.3' is not applied. T.3' cannot belong to the same bar as t.4. Two scenarios are possible:<br /> :::'''3.3.1.1.''' T.3' is found, this model is classified as built through t.3'. The program proceeds to step 4, or to sub-step 3.3.extended if coming from 3.2.<br /> :::'''3.3.1.2.''' T.3' is not found. In this case, the program searches for new potential t.5 and t.4 according to step 2.<br /> ::'''3.3.2.''' The Price Does Not Break the TL. <br /> ::In this case, this model is classified as built through t.3 (absolute extreme). The program proceeds to step 4, or to sub-step 3.3.ext. if current algorithm line is coming from 3.2.<br /> <br /> ::'''3.3.ext. Additional Trend Line Construction Through t.5&quot;.'''<br /> If:<br /> *The t.5 bar does not exceed the range of t.4;<br /> *At the time of model calculation, the level of t.4 is confirmed, then this model is checked for the possibility of constructing an additional Trend Line (TL) through t.5&quot;. Note: If t.4 is not confirmed, this model should be recalculated upon the appearance of a bar that confirms it's t.4.<br /> ''' Definition: Point 5&quot; '''<br /> Point 5&quot; can lie in the segment between t.5 and the point confirming t.4. On this segment, a point is searched that meets the following requirements:<br /> <br /> ''' Rule for Selecting Point 5&quot; High '''<br /> To the left of the bar containing t.5&quot;, the nearest high should be above the level of t.5.<br /> To the right of t.5&quot;, at least one nearest high should be below or equal to t.5. If the nearest high is equal to the level of t.5, then the next high should again be below or equal to the level of t.5, until at least one bar is strictly below the level of t.5.<br /> <br /> ''' Rule for Selecting Point 5&quot; Low '''<br /> To the left of the bar containing t.5&quot;, the nearest low should be below the level of the extreme.<br /> To the right of t.5&quot;, at least one nearest low should be above or equal to t.5. If the nearest low is equal to the level of t.5, then the next low should again be above or equal to the level of t.5, until at least one bar is strictly above the level of t.5.<br /> <br /> ''' Special Cases for Point 5&quot; '''<br /> Point 5&quot; may belong to a bar that has broken the level of t.4 (but only the first of such bars). If the bar of potential t.5&quot; breaks the level of calculated t.6 from t.5, then it is impossible to construct a TL through t.5&quot; for this model (this model does not contain such a point).<br /> <br /> :::'''3.3.ext.1.''' Additional TL Calculation <br /> :::If a bar is found that fits the rule for selecting 5&quot;, an additional TL is calculated for the potential t.5&quot; (hereafter TL&quot;). This line is checked for the absence of breaks in the segment from t.3/3'' to potential t.5&quot;.<br /> <br /> :::::'''3.3ext.1.a.''' If there is an intersection, the program moves to check the next bar as a potential t.5&quot;.<br /> <br /> :::::'''3.3ext.1.b''' If there is no intersection, the found bar is compared with the previous candidate for t.5&quot; (if there was one in the previous iteration of the cycle). If the considered bar is closer to the level of t.4 than the candidate for t.5&quot;, then the considered bar becomes the new candidate for t.5&quot;.<br /> :::::The check of bars continues in a cycle until a bar confirming t.4 is reached. If a candidate for t.5 is found as a result of the check, the program moves to sub-step 3.3ext.1.1; otherwise, it moves to step 4.<br /> ::::'''3.3ext.1.1''' If the analyzed model is built through t.3', a candidate for t.3&quot; is sought in the segment t.3-t.3', through which such a line to t.5&quot; can be built that will not have price intersections in the segment t.3-t.3&quot;.<br /> :::::'''3.3ext.1.1.1''' If a candidate for t.3&quot; is found, where there are no intersections, a check is made for the intersection of TL&quot; by the bar following t.5&quot;.<br /> ::::::'''3.3.ext.1.1.1.A''' If there are intersections, t.5&quot; is declared canceled, and the next one is sought according to sub-step 3.3.ext.<br /> ::::::'''3.3.ext.1.1.1.B''' Otherwise, the program moves to step 13.2.<br /> :::::'''3.3.ext.1.1.2''' If a suitable t.3&quot; is not found, a re-search for a candidate for t.5&quot; is carried out according to sub-steps 3.3.ext., but in this case, if a candidate for t.5&quot; was found, it becomes a canceled candidate for t.5&quot;. The new candidate must already be further from t.4 than the previously discarded ones.<br /> ::::'''3.3ext.1.2''' If the analyzed model is built through t.3, a check is made for the intersection of TL'' by the bar following t.5&quot;.<br /> :::::'''3.3ext.1.2.A''' If there are intersections, t.5&quot; is declared as canceled t.5', and the next one is sought according to sub-step 3.3.ext.<br /> :::::'''3.3ext.1.2.B''' If there are no intersections, the algorithm moves to step 13.2.<br /> :::'''3.3.ext.2''' TL'' is checked for price intersections in the segment between t.5 (inclusive) and potential t.5&quot; (hereafter segment 5-5&quot;).<br /> ::::'''3.3.ext.2.1''' If there is an intersection, then this 5&quot; is filtered out. A re-search for a candidate for t.5&quot; is carried out according to sub-steps 3.3.ext., but in this case, the new candidate must already be further from t.4 (in terms of time) than the previously discarded ones.<br /> ::::'''3.3.ext.2.2''' If there are no intersections of TL&quot; in the segment 5-5&quot;, then t.5&quot; is found.<br /> ::::In this case, the report displays: EAM5&quot; EAM5&quot;<br /> ::::The program moves to step 4.<br /> ::::'''3.3.ext.2.3''' If t.5&quot; is not found, the program moves to step 4.<br /> <br /> ==='''Step IV: Searching for Potential Foundation Blocks.'''===<br /> <br /> ====Initial Check====<br /> First, it is necessary to check for the presence of a fixed t.2. If it exists, it means we are in a branch for searching for alternative models.<br /> <br /> ::'''4.0.1.''' If t.2 is defined in the model, proceed to step 6.<br /> ::'''4.0.2.''' If t.2 is not defined, the program moves to step 4.1.<br /> ====Examination of Extremes====<br /> On the preceding trend, extremes are checked sequentially from right to left (i.e., into the past) from t.3 (or from another analyzed bar in repeated applications of this step) according to the N1 bar rule (as a candidate for t.2). Each found candidate for t.2 is checked for the presence of a confirming extreme (which also serves as t.1) according to the following algorithm:<br /> <br /> ::'''4.1.0.''' An extreme candidate for t.2 is found.<br /> ::'''4.1.1.''' The point of the last intersection &lt;ref&gt;High or low of a bar, repeating or crossing high or low of t.2 bar – is an intersection&lt;/ref&gt; of the candidate's level with the price is found. In this case, the program looks for the absolute maximum (if t.2 is a minimum, i.e., t.2 is low) or the absolute minimum (if t.2 is a maximum, i.e., t.2 is high) in the segment from the last intersection of the t.2 level with the price to t.2.<br /> :::'''4.1.1.1.''' Maximum/minimum not found. In this case, the program discards this candidate for t.2.<br /> :::'''4.1.1.2.''' Maximum/minimum found. In this case, the potential t.2 is confirmed.<br /> :::'''4.1.2.''' The program reaches the starting point of the chart.<br /> :::'''4.1.3.''' The check reaches the boundary of the Depth of Search for t.1 &lt;ref&gt;&quot;Search depth t.1 for EAM models&quot; is set in the Calculation Parameters. It is calculated in bars from the bar of the considered potential t.2. By default, this value is 50 bars.&lt;/ref&gt; for the model and none of the above events (4.1.1. or 4.1.2.) occurred.<br /> <br /> ::'''4.2.''' The search for Foundation Blocks (i.e., points 1 and 2) continues until one of the events in steps 4.2.A, 4.2.B or 4.2.C. occurs.<br /> :::'''4.2.A. The check reaches the bar containing the (presumed) starting point of the preceding trend (from sub-step 1.2.2.1.). This point is not considered as a potential t.2<br /> :::'''4.2.B.''' The check reaches the bar that intersects the level of the presumed point 4 of the considered model.<br /> :::'''4.2.C.''' A bar that is located at a distance (by time) from T.3 greater than or equal to X* (distance from T.3 to t.4), where x is the parameter set in the settings &lt;ref&gt; This is the &quot;Time Ratio of 23 to 24&quot;(by default it is 3)&lt;/ref&gt;.<br /> ::=== Results ===<br /> ::As a result of the search for potential t.2 (i.e., upon the occurrence of4.2.A, 4.2.B or 4.2.C.), two scenarios are possible:<br /> :::'''4.2.1. ''' One or more pairs of potential t.2 and t.1 are found (potential Foundation Blocks). The program moves to step 5.<br /> :::'''4.2.2. ''' No potential Foundation Blocks are found. In this case, the program looks for the next potential t.5 according to step 2.<br /> <br /> <br /> ==References==<br /> &lt;references /&gt;</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_II&diff=195 2023-08-26T19:25:27Z

<p>Admin: </p> <hr /> <div>This article is not finished<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with UMG General Concepts.<br /> <br /> ==='''Step I. Search For Point 3 of the External Attraction Model (EAM) and the Sarting Point of the Previous Trend.'''===<br /> : '''1.1.''' The program looks for the first possible extreme, satisfying Single Bar Rule. Such an extreme is a candidate for potential point 3 ( potential t.3).<br /> : '''1.2.''' Next, the program checks the bars from right to left (i.e., in the past) from the bar containing the extreme candidate for point 3 to one of the following events:<br /> :: '''1.2.1.''' Found the last intersection (breakthrough) point by the price level of the candidate for point 3.<br /> ::In this case, the report displays: <br /> :: PREVdata: FullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.2.''' The program reached the starting point of the chart (i.e., the price did not intersect the level of point 3 after the starting point of the chart).<br /> ::In this case, the report displays: <br /> :: PREVdata: NoFullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.3.''' The price checked 300 bars preceding point 3 &lt;ref&gt;The depth of the search for the extreme confirming point 3 of EAM model&lt;/ref&gt;, but the level of step 3 did not intersect at this segment. The program looks for an absolute extreme (opposite to step 3) on the segment from the 300th bar before point 3 to point 3. The program proceeds to substep 1.3.<br /> : '''1.3.''' The program looks for an absolute extreme (opposite to point 3 extreme) on the segment:<br /> ::- from the last intersection by the price level of the candidate for point 3 (inclusive) (if came from 1.2.1.), or :: - from the starting point of the chart (if came from 1.2.2.), or <br /> :: - from 300 bars(if came from 1.2.3.) <br /> :: to point 3 (excluding).<br /> :: '''1.3.1.''' Absolute extreme found. The candidate for point 3 is confirmed; moreover, the found confirming extreme is the assumed (if coming from 1.2.2. or 1.2.3.) starting point of the preceding trend.'''<br /> ::The program checks for the absence of extremes equal to point 3 between the assumed starting point of the previous trend and point 3. <br /> :::'''1.3.1.1.''' If such an extreme is found, this candidate for point 3 is discarded, and this point 3 is discarded. <br /> :::'''1.3.1.2.''' If such an extreme is not found, the program proceeds to step 2.<br /> ::'''1.3.2.''' Absolute extreme not found. This point 3 is discarded.'''<br /> ::Simultaneously with step 1, the program launches the search for the next potential point 3.<br /> <br /> ==='''Step II. Search For Potentioal Points 5 and 4 ''' ===<br /> '''The Orientation rule (N1 requirement) for Algorithm II is as follows:'''<br /> If point 3 is low, then the level of point 5 should be higher than point 3. <br /> If point 3 is high, then the level of point 5 should be lower than point 3.<br /> '''Search for Point 5.''' The bar following the bar of Point 3 (and in repeated applications of this step - the bar specified in this algorithm) is checked for not overcoming the level of point 3 (since N1 requirement for Algorithm II must be observed).<br /> :'''2.1.''' If the price has overcome the level of point 3, the program discards the considered step 3 (due to N1 requirement).<br /> :'''2.2.''' If N1 requirement is met for the analyzed bar, it is checked for compliance with N1 requirement as a potential point 5 (hereafter - point 5 or t.5).<br /> ::'''2.2.1.''' If the analyzed bar is not an extreme according to N1 requirement (as a potential point 5), the program checks the next bar from the beginning of step 2.<br /> ::'''2.2.2.''' If the analyzed bar is determined as an extreme according to N1 requirement (as a potential point 5), then this bar is checked for reaching (but not necessarily overcoming) the level of point 3. There are 2 options:<br /> :::'''2.2.2.1.''' If the level of point 3 is reached, the program analyzes the next bar according to this step (i.e., from the beginning of step 2).<br /> :::'''2.2.2.2.''' If the level of point 3 is not reached, the analyzed bar is a potential point 5, and the program moves to substep 2.3.<br /> :'''2.3. Search for Point 4.''' The program searches for a bar, which was the last to cross the level of the considered potential point 5. Let's denote this bar as lcb5 (line-crossing-bar-5). If lcb5 coincides with the bar of point 3, we denote the bar following lcb5 as look4. Otherwise, look4 = lcb5. The program searches for a bar with the maximum (if point 3 is low) or minimum (if point 3 is high) price in the interval from lcb5 to potential point 5. Then this bar is checked for being an extreme according to N1 requirement as a potential pont 4 (hereafter – point 4 or t.4). There are 2 options:<br /> ::'''2.3.1.''' The bar is an absolute extreme (as a potential point 4). In this case, potential point 4 is found.<br /> :::'''2.3.1.1.''' If step 2 has already been determined (this is possible when this step is triggered during the search for an alternative model), the program checks the line chart for extra points in the section from step 2 to step 4. There are 2 options:<br /> ::::'''2.3.1.1.A.''' If extra points are found, the program processes the next bar after potential point 5 according to step 2.<br /> ::::'''2.3.1.1.B.''' Extra intersections are not found; the program moves to substep 2.4.<br /> :::'''2.3.1.2.''' If substep 2.3.1. is triggered during the search for the basic model, the program moves to substep 2.4.<br /> ::'''2.3.2.''' The bar is not an absolute extreme (as a potential point 4). In this case, the program looks for another candidate for point 5 according to this step (i.e., according to step 2).<br /> If the program has processed 50 bars in a row according to this step (step 2), and the program has not moved to another step of the algorithm, then this potential point 3 is discarded.<br /> If there are 150 or more bars&lt;ref&gt;Continuous search range of t.5 in one iteration for EAM model&lt;/ref&gt; between potential point 3 and the analyzed bar, and potential points 4 and 5 are not found, then this potential point 3 is discarded.<br /> :'''2.4.''' Real-Time Verification of t.5 <br /> :The potential t.5 bar is checked for the presence of bars between the analyzed bar and the potential t.4 bar, which contain price values more distant (or even equally distant) from the potential t.4 than the most distant from t.4 value of the analyzed bar. This is a check of the potential t.5 for beeing the '''potential absolute extreme'''. The following options are possible:<br /> ::'''2.4.1.''' If the extreme is potentially absolute, the program proceeds to step 3.<br /> ::'''2.4.2.''' If the extreme is not potentially absolute, the program checks the next bar starting from this step (i.e., step 2).<br /> <br /> ===''' Step III. Confirmation of Point 4. Searching for Alternative t.5 and t.5&quot; '''===<br /> The program checks whether the bar of potential t.5 has reached the level of t.4. Two scenarios are possible:<br /> :'''3.1.''' The Bar of Potential t.5 Has Reached t.4.<br /> :In this case:<br /> ::The model is built through absolute t.5.<br /> ::The t.5 bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> ::Point 4 is confirmed,<br /> ::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3 (since there is already possible to display the model through t.5 on the chart).<br /> :'''3.2.''' The Bar of Potential t.5 Has Not Reached t.4. <br /> :In this case, the program checks the next bar for reaching the level of t.4. The following options are possible:<br /> ::'''3.2.1. The Considered Bar Reaches the Level of Potential t.4. <br /> ::In this case:<br /> :::The model is built through absolute t.5.<br /> :::The considered bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> :::Point 4 is confirmed,<br /> :::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3.ext, but first goes through sub-step 3.3.<br /> ::'''3.2.2.''' The Considered Bar Does Not Reach the Level of t.4.<br /> ::In this case the program checks the next bar for overcoming the level of potential t.5. Two scenarios are possible:<br /> :::'''3.2.2.1.''' If the t.5 level is overcome, the analyzed bar is considered as a new potential t.5. The program processes this bar according to step 2.<br /> :::'''3.2.2.2.''' If the t.5 level is not overcome, the analyzed bar is checked for reaching the level of t.4 according to sub-step 3.2.<br /> ::In parallel (i.e., an additional branch is created), the program proceeds to sub-step 3.3 (since there is already an option to display the model through t.5 on the chart). The model in this branch receives a &quot;draw_flag&quot; label.<br /> :'''3.3.''' Construction of the Trend Line (TL). <br /> :A Trend Line (TL) is constructed from t.3 to t.5. Each bar between t.3 and t.5 is checked for breaking the TL. Two scenarios are possible:<br /> ::'''3.3.1.'''The Price Crosses the TL. <br /> ::In this case, the TL through t.3 is not constructed. The program searches for a candidate for point 3' (hereafter - t.3'). T.3' is selected in such a way that the TL' (constructed from t.3' to t.5) is not crossed by the price in the 3-5 segment. Rule No.1 for t.3' is not applied. T.3' cannot belong to the same bar as t.4. Two scenarios are possible:<br /> :::'''3.3.1.1.''' T.3' is found, this model is classified as built through t.3'. The program proceeds to step 4, or to sub-step 3.3.extended if coming from 3.2.<br /> :::'''3.3.1.2.''' T.3' is not found. In this case, the program searches for new potential t.5 and t.4 according to step 2.<br /> ::'''3.3.2.''' The Price Does Not Break the TL. <br /> ::In this case, this model is classified as built through t.3 (absolute extreme). The program proceeds to step 4, or to sub-step 3.3.ext. if current algorithm line is coming from 3.2.<br /> <br /> ::'''3.3.ext. Additional Trend Line Construction Through t.5&quot;.'''<br /> If:<br /> *The t.5 bar does not exceed the range of t.4;<br /> *At the time of model calculation, the level of t.4 is confirmed, then this model is checked for the possibility of constructing an additional Trend Line (TL) through t.5&quot;. Note: If t.4 is not confirmed, this model should be recalculated upon the appearance of a bar that confirms it's t.4.<br /> ''' Definition: Point 5&quot; '''<br /> Point 5&quot; can lie in the segment between t.5 and the point confirming t.4. On this segment, a point is searched that meets the following requirements:<br /> <br /> ''' Rule for Selecting Point 5&quot; High '''<br /> To the left of the bar containing t.5&quot;, the nearest high should be above the level of t.5.<br /> To the right of t.5&quot;, at least one nearest high should be below or equal to t.5. If the nearest high is equal to the level of t.5, then the next high should again be below or equal to the level of t.5, until at least one bar is strictly below the level of t.5.<br /> ''' Rule for Selecting Point 5&quot; Low '''<br /> To the left of the bar containing t.5&quot;, the nearest low should be below the level of the extreme.<br /> To the right of t.5&quot;, at least one nearest low should be above or equal to t.5. If the nearest low is equal to the level of t.5, then the next low should again be above or equal to the level of t.5, until at least one bar is strictly above the level of t.5.<br /> ''' Special Cases for Point 5&quot; '''<br /> Point 5&quot; may belong to a bar that has broken the level of t.4 (but only the first of such bars). If the bar of potential t.5&quot; breaks the level of calculated t.6 from t.5, then it is impossible to construct a TL through t.5&quot; for this model (this model does not contain such a point).<br /> <br /> :::'''3.3.ext.1.''' Additional TL Calculation <br /> :::If a bar is found that fits the rule for selecting 5&quot;, an additional TL is calculated for the potential t.5&quot; (hereafter TL&quot;). This line is checked for the absence of breaks in the segment from t.3/3'' to potential t.5&quot;.<br /> <br /> :::::'''3.3ext.1.a.''' If there is an intersection, the program moves to check the next bar as a potential t.5&quot;.<br /> <br /> :::::'''3.3ext.1.b''' If there is no intersection, the found bar is compared with the previous candidate for t.5&quot; (if there was one in the previous iteration of the cycle). If the considered bar is closer to the level of t.4 than the candidate for t.5&quot;, then the considered bar becomes the new candidate for t.5&quot;.<br /> :::::The check of bars continues in a cycle until a bar confirming t.4 is reached. If a candidate for t.5 is found as a result of the check, the program moves to sub-step 3.3ext.1.1; otherwise, it moves to step 4.<br /> ::::'''3.3ext.1.1''' If the analyzed model is built through t.3', a candidate for t.3&quot; is sought in the segment t.3-t.3', through which such a line to t.5&quot; can be built that will not have price intersections in the segment t.3-t.3&quot;.<br /> :::::'''3.3ext.1.1.1''' If a candidate for t.3&quot; is found, where there are no intersections, a check is made for the intersection of TL&quot; by the bar following t.5&quot;.<br /> ::::::'''3.3.ext.1.1.1.A''' If there are intersections, t.5&quot; is declared canceled, and the next one is sought according to sub-step 3.3.ext.<br /> ::::::'''3.3.ext.1.1.1.B''' Otherwise, the program moves to step 13.2.<br /> :::::'''3.3.ext.1.1.2''' If a suitable t.3&quot; is not found, a re-search for a candidate for t.5&quot; is carried out according to sub-steps 3.3.ext., but in this case, if a candidate for t.5&quot; was found, it becomes a canceled candidate for t.5&quot;. The new candidate must already be further from t.4 than the previously discarded ones.<br /> ::::'''3.3ext.1.2''' If the analyzed model is built through t.3, a check is made for the intersection of TL'' by the bar following t.5&quot;.<br /> :::::'''3.3ext.1.2.A''' If there are intersections, t.5&quot; is declared as canceled t.5', and the next one is sought according to sub-step 3.3.ext.<br /> :::::'''3.3ext.1.2.B''' If there are no intersections, the algorithm moves to step 13.2.<br /> :::'''3.3.ext.2''' TL'' is checked for price intersections in the segment between t.5 (inclusive) and potential t.5&quot; (hereafter segment 5-5&quot;).<br /> ::::'''3.3.ext.2.1''' If there is an intersection, then this 5&quot; is filtered out. A re-search for a candidate for t.5&quot; is carried out according to sub-steps 3.3.ext., but in this case, the new candidate must already be further from t.4 (in terms of time) than the previously discarded ones.<br /> ::::'''3.3.ext.2.2''' If there are no intersections of TL&quot; in the segment 5-5&quot;, then t.5&quot; is found.<br /> ::::In this case, the report displays: EAM5&quot; EAM5&quot;<br /> ::::The program moves to step 4.<br /> ::::'''3.3.ext.2.3''' If t.5&quot; is not found, the program moves to step 4.<br /> <br /> ==='''Step IV: Searching for Potential Foundation Blocks.'''===<br /> <br /> ====Initial Check====<br /> First, it is necessary to check for the presence of a fixed t.2. If it exists, it means we are in a branch for searching for alternative models.<br /> <br /> ::'''4.0.1.''' If t.2 is defined in the model, proceed to step 6.<br /> ::'''4.0.2.''' If t.2 is not defined, the program moves to step 4.1.<br /> ====Examination of Extremes====<br /> On the preceding trend, extremes are checked sequentially from right to left (i.e., into the past) from t.3 (or from another analyzed bar in repeated applications of this step) according to the N1 bar rule (as a candidate for t.2). Each found candidate for t.2 is checked for the presence of a confirming extreme (which also serves as t.1) according to the following algorithm:<br /> <br /> ::'''4.1.0.''' An extreme candidate for t.2 is found.<br /> ::'''4.1.1.''' The point of the last intersection &lt;ref&gt;High or low of a bar, repeating or crossing high or low of t.2 bar – is an intersection&lt;/ref&gt; of the candidate's level with the price is found. In this case, the program looks for the absolute maximum (if t.2 is a minimum, i.e., t.2 is low) or the absolute minimum (if t.2 is a maximum, i.e., t.2 is high) in the segment from the last intersection of the t.2 level with the price to t.2.<br /> :::'''4.1.1.1.''' Maximum/minimum not found. In this case, the program discards this candidate for t.2.<br /> :::'''4.1.1.2.''' Maximum/minimum found. In this case, the potential t.2 is confirmed.<br /> :::'''4.1.2.''' The program reaches the starting point of the chart.<br /> :::'''4.1.3.''' The check reaches the boundary of the Depth of Search for t.1 &lt;ref&gt;&quot;Search depth t.1 for EAM models&quot; is set in the Calculation Parameters. It is calculated in bars from the bar of the considered potential t.2. By default, this value is 50 bars.&lt;/ref&gt; for the model and none of the above events (4.1.1. or 4.1.2.) occurred.<br /> <br /> ::'''4.2.''' The search for Foundation Blocks (i.e., points 1 and 2) continues until one of the events in steps 4.2.A, 4.2.B or 4.2.C. occurs.<br /> :::'''4.2.A. The check reaches the bar containing the (presumed) starting point of the preceding trend (from sub-step 1.2.2.1.). This point is not considered as a potential t.2<br /> :::'''4.2.B.''' The check reaches the bar that intersects the level of the presumed point 4 of the considered model.<br /> :::'''4.2.C.''' A bar that is located at a distance (by time) from T.3 greater than or equal to X* (distance from T.3 to t.4), where x is the parameter set in the settings &lt;ref&gt; This is the &quot;Time Ratio of 23 to 24&quot;(by default it is 3)&lt;/ref&gt;.<br /> ::=== Results ===<br /> ::As a result of the search for potential t.2 (i.e., upon the occurrence of4.2.A, 4.2.B or 4.2.C.), two scenarios are possible:<br /> :::'''4.2.1. ''' One or more pairs of potential t.2 and t.1 are found (potential Foundation Blocks). The program moves to step 5.<br /> :::'''4.2.2. ''' No potential Foundation Blocks are found. In this case, the program looks for the next potential t.5 according to step 2.<br /> <br /> <br /> ==References==<br /> &lt;references /&gt;</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_II&diff=194 2023-08-26T15:27:51Z

<p>Admin: Adding step</p> <hr /> <div>This article is not finished<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with UMG General Concepts.<br /> <br /> ==='''Step I. Search For Point 3 of the External Attraction Model (EAM) and the Sarting Point of the Previous Trend.'''===<br /> : '''1.1.''' The program looks for the first possible extreme, satisfying Single Bar Rule. Such an extreme is a candidate for potential point 3 ( potential t.3).<br /> : '''1.2.''' Next, the program checks the bars from right to left (i.e., in the past) from the bar containing the extreme candidate for point 3 to one of the following events:<br /> :: '''1.2.1.''' Found the last intersection (breakthrough) point by the price level of the candidate for point 3.<br /> ::In this case, the report displays: <br /> :: PREVdata: FullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.2.''' The program reached the starting point of the chart (i.e., the price did not intersect the level of point 3 after the starting point of the chart).<br /> ::In this case, the report displays: <br /> :: PREVdata: NoFullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.1.''' The price checked 300 bars preceding point 3, but the level of step 3 did not intersect at this segment. The program looks for an absolute extreme (opposite to step 3) on the segment from the 300th bar before point 3 to point 3. The program proceeds to substep 1.3.<br /> : '''1.3.''' The program looks for an absolute extreme (opposite to point 3 extreme) on the segment:<br /> ::- from the last intersection by the price level of the candidate for point 3 (inclusive) (if came from 1.2.1.), or :: - from the starting point of the chart (if came from 1.2.2.), or <br /> :: - from 300 bars(if came from 1.2.3.) <br /> :: to point 3 (excluding).<br /> :: '''1.3.1.''' Absolute extreme found. The candidate for point 3 is confirmed; moreover, the found confirming extreme is the assumed (if coming from 1.2.2. or 1.2.3.) starting point of the preceding trend.'''<br /> ::The program checks for the absence of extremes equal to point 3 between the assumed starting point of the previous trend and point 3. <br /> :::'''1.3.1.1.''' If such an extreme is found, this candidate for point 3 is discarded, and this point 3 is discarded. <br /> :::'''1.3.1.2.''' If such an extreme is not found, the program proceeds to step 2.<br /> ::'''1.3.2.''' Absolute extreme not found. This point 3 is discarded.'''<br /> ::Simultaneously with step 1, the program launches the search for the next potential point 3.<br /> <br /> ==='''Step II. Search For Potentioal Points 5 and 4 ''' ===<br /> '''The Orientation rule (N1 requirement) for Algorithm II is as follows:'''<br /> If point 3 is low, then the level of point 5 should be higher than point 3. <br /> If point 3 is high, then the level of point 5 should be lower than point 3.<br /> '''Search for Point 5.''' The bar following the bar of Point 3 (and in repeated applications of this step - the bar specified in this algorithm) is checked for not overcoming the level of point 3 (since N1 requirement for Algorithm II must be observed).<br /> :'''2.1.''' If the price has overcome the level of point 3, the program discards the considered step 3 (due to N1 requirement).<br /> :'''2.2.''' If N1 requirement is met for the analyzed bar, it is checked for compliance with N1 requirement as a potential point 5 (hereafter - point 5 or t.5).<br /> ::'''2.2.1.''' If the analyzed bar is not an extreme according to N1 requirement (as a potential point 5), the program checks the next bar from the beginning of step 2.<br /> ::'''2.2.2.''' If the analyzed bar is determined as an extreme according to N1 requirement (as a potential point 5), then this bar is checked for reaching (but not necessarily overcoming) the level of point 3. There are 2 options:<br /> :::'''2.2.2.1.''' If the level of point 3 is reached, the program analyzes the next bar according to this step (i.e., from the beginning of step 2).<br /> :::'''2.2.2.2.''' If the level of point 3 is not reached, the analyzed bar is a potential point 5, and the program moves to substep 2.3.<br /> :'''2.3. Search for Point 4.''' The program searches for a bar, which was the last to cross the level of the considered potential point 5. Let's denote this bar as lcb5 (line-crossing-bar-5). If lcb5 coincides with the bar of point 3, we denote the bar following lcb5 as look4. Otherwise, look4 = lcb5. The program searches for a bar with the maximum (if point 3 is low) or minimum (if point 3 is high) price in the interval from lcb5 to potential point 5. Then this bar is checked for being an extreme according to N1 requirement as a potential pont 4 (hereafter – point 4 or t.4). There are 2 options:<br /> ::'''2.3.1.''' The bar is an absolute extreme (as a potential point 4). In this case, potential point 4 is found.<br /> :::'''2.3.1.1.''' If step 2 has already been determined (this is possible when this step is triggered during the search for an alternative model), the program checks the line chart for extra points in the section from step 2 to step 4. There are 2 options:<br /> ::::'''2.3.1.1.A.''' If extra points are found, the program processes the next bar after potential point 5 according to step 2.<br /> ::::'''2.3.1.1.B.''' Extra intersections are not found; the program moves to substep 2.4.<br /> :::'''2.3.1.2.''' If substep 2.3.1. is triggered during the search for the basic model, the program moves to substep 2.4.<br /> ::'''2.3.2.''' The bar is not an absolute extreme (as a potential point 4). In this case, the program looks for another candidate for point 5 according to this step (i.e., according to step 2).<br /> If the program has processed 50 bars in a row according to this step (step 2), and the program has not moved to another step of the algorithm, then this potential point 3 is discarded.<br /> If there are 150 or more bars between potential point 3 and the analyzed bar, and potential points 4 and 5 are not found, then this potential point 3 is discarded.<br /> :'''2.4.''' Real-Time Verification of t.5 <br /> :The potential t.5 bar is checked for the presence of bars between the analyzed bar and the potential t.4 bar, which contain price values more distant (or even equally distant) from the potential t.4 than the most distant from t.4 value of the analyzed bar. This is a check of the potential t.5 for beeing the '''potential absolute extreme'''. The following options are possible:<br /> ::'''2.4.1.''' If the extreme is potentially absolute, the program proceeds to step 3.<br /> ::'''2.4.2.''' If the extreme is not potentially absolute, the program checks the next bar starting from this step (i.e., step 2).<br /> <br /> ===''' Step III. Confirmation of Point 4. Searching for Alternative t.5 and t.5&quot; '''===<br /> The program checks whether the bar of potential t.5 has reached the level of t.4. Two scenarios are possible:<br /> :'''3.1.''' The Bar of Potential t.5 Has Reached t.4.<br /> :In this case:<br /> ::The model is built through absolute t.5.<br /> ::The t.5 bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> ::Point 4 is confirmed,<br /> ::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3 (since there is already possible to display the model through t.5 on the chart).<br /> :'''3.2.''' The Bar of Potential t.5 Has Not Reached t.4. <br /> :In this case, the program checks the next bar for reaching the level of t.4. The following options are possible:<br /> ::'''3.2.1. The Considered Bar Reaches the Level of Potential t.4. <br /> ::In this case:<br /> :::The model is built through absolute t.5.<br /> :::The considered bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> :::Point 4 is confirmed,<br /> :::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3.ext, but first goes through sub-step 3.3.<br /> ::'''3.2.2.''' The Considered Bar Does Not Reach the Level of t.4.<br /> ::In this case the program checks the next bar for overcoming the level of potential t.5. Two scenarios are possible:<br /> :::'''3.2.2.1.''' If the t.5 level is overcome, the analyzed bar is considered as a new potential t.5. The program processes this bar according to step 2.<br /> :::'''3.2.2.2.''' If the t.5 level is not overcome, the analyzed bar is checked for reaching the level of t.4 according to sub-step 3.2.<br /> ::In parallel (i.e., an additional branch is created), the program proceeds to sub-step 3.3 (since there is already an option to display the model through t.5 on the chart). The model in this branch receives a &quot;draw_flag&quot; label.<br /> :'''3.3.''' Construction of the Trend Line (TL). <br /> :A Trend Line (TL) is constructed from t.3 to t.5. Each bar between t.3 and t.5 is checked for breaking the TL. Two scenarios are possible:<br /> ::'''3.3.1.'''The Price Crosses the TL. <br /> ::In this case, the TL through t.3 is not constructed. The program searches for a candidate for point 3' (hereafter - t.3'). T.3' is selected in such a way that the TL' (constructed from t.3' to t.5) is not crossed by the price in the 3-5 segment. Rule No.1 for t.3' is not applied. T.3' cannot belong to the same bar as t.4. Two scenarios are possible:<br /> :::'''3.3.1.1.''' T.3' is found, this model is classified as built through t.3'. The program proceeds to step 4, or to sub-step 3.3.extended if coming from 3.2.<br /> :::'''3.3.1.2.''' T.3' is not found. In this case, the program searches for new potential t.5 and t.4 according to step 2.<br /> ::'''3.3.2.''' The Price Does Not Break the TL. <br /> ::In this case, this model is classified as built through t.3 (absolute extreme). The program proceeds to step 4, or to sub-step 3.3.ext. if current algorithm line is coming from 3.2.<br /> <br /> ::'''3.3.ext. Additional Trend Line Construction Through t.5&quot;.'''<br /> If:<br /> *The t.5 bar does not exceed the range of t.4;<br /> *At the time of model calculation, the level of t.4 is confirmed, then this model is checked for the possibility of constructing an additional Trend Line (TL) through t.5&quot;. Note: If t.4 is not confirmed, this model should be recalculated upon the appearance of a bar that confirms it's t.4.<br /> ''' Definition: Point 5&quot; '''<br /> Point 5&quot; can lie in the segment between t.5 and the point confirming t.4. On this segment, a point is searched that meets the following requirements:<br /> <br /> ''' Rule for Selecting Point 5&quot; High '''<br /> To the left of the bar containing t.5&quot;, the nearest high should be above the level of t.5.<br /> To the right of t.5&quot;, at least one nearest high should be below or equal to t.5. If the nearest high is equal to the level of t.5, then the next high should again be below or equal to the level of t.5, until at least one bar is strictly below the level of t.5.<br /> ''' Rule for Selecting Point 5&quot; Low '''<br /> To the left of the bar containing t.5&quot;, the nearest low should be below the level of the extreme.<br /> To the right of t.5&quot;, at least one nearest low should be above or equal to t.5. If the nearest low is equal to the level of t.5, then the next low should again be above or equal to the level of t.5, until at least one bar is strictly above the level of t.5.<br /> ''' Special Cases for Point 5&quot; '''<br /> Point 5&quot; may belong to a bar that has broken the level of t.4 (but only the first of such bars). If the bar of potential t.5&quot; breaks the level of calculated t.6 from t.5, then it is impossible to construct a TL through t.5&quot; for this model (this model does not contain such a point).<br /> <br /> :::'''3.3.ext.1.''' Additional TL Calculation <br /> :::If a bar is found that fits the rule for selecting 5&quot;, an additional TL is calculated for the potential t.5&quot; (hereafter TL&quot;). This line is checked for the absence of breaks in the segment from t.3/3'' to potential t.5&quot;.<br /> <br /> :::::'''3.3ext.1.a.''' If there is an intersection, the program moves to check the next bar as a potential t.5&quot;.<br /> <br /> :::::'''3.3ext.1.b''' If there is no intersection, the found bar is compared with the previous candidate for t.5&quot; (if there was one in the previous iteration of the cycle). If the considered bar is closer to the level of t.4 than the candidate for t.5&quot;, then the considered bar becomes the new candidate for t.5&quot;.<br /> :::::The check of bars continues in a cycle until a bar confirming t.4 is reached. If a candidate for t.5 is found as a result of the check, the program moves to sub-step 3.3ext.1.1; otherwise, it moves to step 4.<br /> ::::'''3.3ext.1.1''' If the analyzed model is built through t.3', a candidate for t.3&quot; is sought in the segment t.3-t.3', through which such a line to t.5&quot; can be built that will not have price intersections in the segment t.3-t.3&quot;.<br /> :::::'''3.3ext.1.1.1''' If a candidate for t.3&quot; is found, where there are no intersections, a check is made for the intersection of TL&quot; by the bar following t.5&quot;.<br /> ::::::'''3.3.ext.1.1.1.A''' If there are intersections, t.5&quot; is declared canceled, and the next one is sought according to sub-step 3.3.ext.<br /> ::::::'''3.3.ext.1.1.1.B''' Otherwise, the program moves to step 13.2.<br /> :::::'''3.3.ext.1.1.2''' If a suitable t.3&quot; is not found, a re-search for a candidate for t.5&quot; is carried out according to sub-steps 3.3.ext., but in this case, if a candidate for t.5&quot; was found, it becomes a canceled candidate for t.5&quot;. The new candidate must already be further from t.4 than the previously discarded ones.<br /> ::::'''3.3ext.1.2''' If the analyzed model is built through t.3, a check is made for the intersection of TL'' by the bar following t.5&quot;.<br /> :::::'''3.3ext.1.2.A''' If there are intersections, t.5&quot; is declared as canceled t.5', and the next one is sought according to sub-step 3.3.ext.<br /> :::::'''3.3ext.1.2.B''' If there are no intersections, the algorithm moves to step 13.2.<br /> :::'''3.3.ext.2''' TL'' is checked for price intersections in the segment between t.5 (inclusive) and potential t.5&quot; (hereafter segment 5-5&quot;).<br /> ::::'''3.3.ext.2.1''' If there is an intersection, then this 5&quot; is filtered out. A re-search for a candidate for t.5&quot; is carried out according to sub-steps 3.3.ext., but in this case, the new candidate must already be further from t.4 (in terms of time) than the previously discarded ones.<br /> ::::'''3.3.ext.2.2''' If there are no intersections of TL&quot; in the segment 5-5&quot;, then t.5&quot; is found.<br /> ::::In this case, the report displays: EAM5&quot; EAM5&quot;<br /> ::::The program moves to step 4.<br /> ::::'''3.3.ext.2.3''' If t.5&quot; is not found, the program moves to step 4.<br /> <br /> ==='''Step IV: Searching for Potential Foundation Blocks.'''===<br /> <br /> ====Initial Check====<br /> First, it is necessary to check for the presence of a fixed t.2. If it exists, it means we are in a branch for searching for alternative models.<br /> <br /> ::'''4.0.1.''' If t.2 is defined in the model, proceed to step 6.<br /> ::'''4.0.2.''' If t.2 is not defined, the program moves to step 4.1.<br /> ====Examination of Extremes====<br /> On the preceding trend, extremes are checked sequentially from right to left (i.e., into the past) from t.3 (or from another analyzed bar in repeated applications of this step) according to the N1 bar rule (as a candidate for t.2). Each found candidate for t.2 is checked for the presence of a confirming extreme (which also serves as t.1) according to the following algorithm:<br /> <br /> ::'''4.1.0.''' An extreme candidate for t.2 is found.<br /> ::'''4.1.1.''' The point of the last intersection of the candidate's level with the price is found. In this case, the program looks for the absolute maximum (if t.2 is a minimum, i.e., t.2 is low) or the absolute minimum (if t.2 is a maximum, i.e., t.2 is high) in the segment from the last intersection of the t.2 level with the price to t.2.<br /> :::'''4.1.1.1.''' Maximum/minimum not found. In this case, the program discards this candidate for t.2.<br /> :::'''4.1.1.2.''' Maximum/minimum found. In this case, the potential t.2 is confirmed.<br /> :::'''4.1.2.''' The program reaches the starting point of the chart.<br /> :::'''4.1.3.''' The check reaches the boundary of the Depth of Search for t.1 for the model and none of the above events (4.1.1. or 4.1.2.) occurred.<br /> The search for Foundation Blocks (i.e., points 1 and 2) continues until one of the events in steps 4.2. and 4.3. occurs.<br /> <br /> ::'''4.2.''' The check reaches the bar containing the (presumed) starting point of the preceding trend.<br /> :::'''4.2.1.''' One or several pairs of potential t.2 and t.1 are found. The program moves to step 5.<br /> :::'''4.2.2.''' No potential Foundation Blocks are found. In this case, the program looks for the next potential t.5 according to step 2.<br /> ::'''4.3.''' The check reaches the bar that intersects the level of the presumed point 4 of the considered model.<br /> ::=== Results ===<br /> ::As a result of the search for potential t.2 (i.e., upon the occurrence of 4.2. or 4.3.), two scenarios are possible:<br /> <br /> :::'''4.2.1. / 4.3.1.''' One or more pairs of potential t.2 and t.1 are found (potential Foundation Blocks). The program moves to step 5.<br /> :::'''4.2.2. / 4.3.2.''' No potential Foundation Blocks are found. In this case, the program looks for the next potential t.5 according to step 2.</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_II&diff=193 2023-08-26T15:02:54Z

<p>Admin: </p> <hr /> <div>This article is not finished<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with UMG General Concepts.<br /> <br /> ==='''Step I. Search For Point 3 of the External Attraction Model (EAM) and the Sarting Point of the Previous Trend.'''===<br /> : '''1.1.''' The program looks for the first possible extreme, satisfying Single Bar Rule. Such an extreme is a candidate for potential point 3 ( potential t.3).<br /> : '''1.2.''' Next, the program checks the bars from right to left (i.e., in the past) from the bar containing the extreme candidate for point 3 to one of the following events:<br /> :: '''1.2.1.''' Found the last intersection (breakthrough) point by the price level of the candidate for point 3.<br /> ::In this case, the report displays: <br /> :: PREVdata: FullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.2.''' The program reached the starting point of the chart (i.e., the price did not intersect the level of point 3 after the starting point of the chart).<br /> ::In this case, the report displays: <br /> :: PREVdata: NoFullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.1.''' The price checked 300 bars preceding point 3, but the level of step 3 did not intersect at this segment. The program looks for an absolute extreme (opposite to step 3) on the segment from the 300th bar before point 3 to point 3. The program proceeds to substep 1.3.<br /> : '''1.3.''' The program looks for an absolute extreme (opposite to point 3 extreme) on the segment:<br /> ::- from the last intersection by the price level of the candidate for point 3 (inclusive) (if came from 1.2.1.), or :: - from the starting point of the chart (if came from 1.2.2.), or <br /> :: - from 300 bars(if came from 1.2.3.) <br /> :: to point 3 (excluding).<br /> :: '''1.3.1.''' Absolute extreme found. The candidate for point 3 is confirmed; moreover, the found confirming extreme is the assumed (if coming from 1.2.2. or 1.2.3.) starting point of the preceding trend.'''<br /> ::The program checks for the absence of extremes equal to point 3 between the assumed starting point of the previous trend and point 3. <br /> :::'''1.3.1.1.''' If such an extreme is found, this candidate for point 3 is discarded, and this point 3 is discarded. <br /> :::'''1.3.1.2.''' If such an extreme is not found, the program proceeds to step 2.<br /> ::'''1.3.2.''' Absolute extreme not found. This point 3 is discarded.'''<br /> ::Simultaneously with step 1, the program launches the search for the next potential point 3.<br /> <br /> ==='''Step II. Search For Potentioal Points 5 and 4 ''' ===<br /> '''The Orientation rule (N1 requirement) for Algorithm II is as follows:'''<br /> If point 3 is low, then the level of point 5 should be higher than point 3. <br /> If point 3 is high, then the level of point 5 should be lower than point 3.<br /> '''Search for Point 5.''' The bar following the bar of Point 3 (and in repeated applications of this step - the bar specified in this algorithm) is checked for not overcoming the level of point 3 (since N1 requirement for Algorithm II must be observed).<br /> :'''2.1.''' If the price has overcome the level of point 3, the program discards the considered step 3 (due to N1 requirement).<br /> :'''2.2.''' If N1 requirement is met for the analyzed bar, it is checked for compliance with N1 requirement as a potential point 5 (hereafter - point 5 or t.5).<br /> ::'''2.2.1.''' If the analyzed bar is not an extreme according to N1 requirement (as a potential point 5), the program checks the next bar from the beginning of step 2.<br /> ::'''2.2.2.''' If the analyzed bar is determined as an extreme according to N1 requirement (as a potential point 5), then this bar is checked for reaching (but not necessarily overcoming) the level of point 3. There are 2 options:<br /> :::'''2.2.2.1.''' If the level of point 3 is reached, the program analyzes the next bar according to this step (i.e., from the beginning of step 2).<br /> :::'''2.2.2.2.''' If the level of point 3 is not reached, the analyzed bar is a potential point 5, and the program moves to substep 2.3.<br /> :'''2.3. Search for Point 4.''' The program searches for a bar, which was the last to cross the level of the considered potential point 5. Let's denote this bar as lcb5 (line-crossing-bar-5). If lcb5 coincides with the bar of point 3, we denote the bar following lcb5 as look4. Otherwise, look4 = lcb5. The program searches for a bar with the maximum (if point 3 is low) or minimum (if point 3 is high) price in the interval from lcb5 to potential point 5. Then this bar is checked for being an extreme according to N1 requirement as a potential pont 4 (hereafter – point 4 or t.4). There are 2 options:<br /> ::'''2.3.1.''' The bar is an absolute extreme (as a potential point 4). In this case, potential point 4 is found.<br /> :::'''2.3.1.1.''' If step 2 has already been determined (this is possible when this step is triggered during the search for an alternative model), the program checks the line chart for extra points in the section from step 2 to step 4. There are 2 options:<br /> ::::'''2.3.1.1.A.''' If extra points are found, the program processes the next bar after potential point 5 according to step 2.<br /> ::::'''2.3.1.1.B.''' Extra intersections are not found; the program moves to substep 2.4.<br /> :::'''2.3.1.2.''' If substep 2.3.1. is triggered during the search for the basic model, the program moves to substep 2.4.<br /> ::'''2.3.2.''' The bar is not an absolute extreme (as a potential point 4). In this case, the program looks for another candidate for point 5 according to this step (i.e., according to step 2).<br /> If the program has processed 50 bars in a row according to this step (step 2), and the program has not moved to another step of the algorithm, then this potential point 3 is discarded.<br /> If there are 150 or more bars between potential point 3 and the analyzed bar, and potential points 4 and 5 are not found, then this potential point 3 is discarded.<br /> :'''2.4.''' Real-Time Verification of t.5 <br /> :The potential t.5 bar is checked for the presence of bars between the analyzed bar and the potential t.4 bar, which contain price values more distant (or even equally distant) from the potential t.4 than the most distant from t.4 value of the analyzed bar. This is a check of the potential t.5 for beeing the '''potential absolute extreme'''. The following options are possible:<br /> ::'''2.4.1.''' If the extreme is potentially absolute, the program proceeds to step 3.<br /> ::'''2.4.2.''' If the extreme is not potentially absolute, the program checks the next bar starting from this step (i.e., step 2).<br /> <br /> ===''' Step III. Confirmation of Point 4. Searching for Alternative t.5 and t.5&quot; '''===<br /> The program checks whether the bar of potential t.5 has reached the level of t.4. Two scenarios are possible:<br /> :'''3.1.''' The Bar of Potential t.5 Has Reached t.4.<br /> :In this case:<br /> ::The model is built through absolute t.5.<br /> ::The t.5 bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> ::Point 4 is confirmed,<br /> ::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3 (since there is already possible to display the model through t.5 on the chart).<br /> :'''3.2.''' The Bar of Potential t.5 Has Not Reached t.4. <br /> :In this case, the program checks the next bar for reaching the level of t.4. The following options are possible:<br /> ::'''3.2.1. The Considered Bar Reaches the Level of Potential t.4. <br /> ::In this case:<br /> :::The model is built through absolute t.5.<br /> :::The considered bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> :::Point 4 is confirmed,<br /> :::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3.ext, but first goes through sub-step 3.3.<br /> ::'''3.2.2.''' The Considered Bar Does Not Reach the Level of t.4.<br /> ::In this case the program checks the next bar for overcoming the level of potential t.5. Two scenarios are possible:<br /> :::'''3.2.2.1.''' If the t.5 level is overcome, the analyzed bar is considered as a new potential t.5. The program processes this bar according to step 2.<br /> :::'''3.2.2.2.''' If the t.5 level is not overcome, the analyzed bar is checked for reaching the level of t.4 according to sub-step 3.2.<br /> ::In parallel (i.e., an additional branch is created), the program proceeds to sub-step 3.3 (since there is already an option to display the model through t.5 on the chart). The model in this branch receives a &quot;draw_flag&quot; label.<br /> :'''3.3.''' Construction of the Trend Line (TL). <br /> :A Trend Line (TL) is constructed from t.3 to t.5. Each bar between t.3 and t.5 is checked for breaking the TL. Two scenarios are possible:<br /> ::'''3.3.1.'''The Price Crosses the TL. <br /> ::In this case, the TL through t.3 is not constructed. The program searches for a candidate for point 3' (hereafter - t.3'). T.3' is selected in such a way that the TL' (constructed from t.3' to t.5) is not crossed by the price in the 3-5 segment. Rule No.1 for t.3' is not applied. T.3' cannot belong to the same bar as t.4. Two scenarios are possible:<br /> :::'''3.3.1.1.''' T.3' is found, this model is classified as built through t.3'. The program proceeds to step 4, or to sub-step 3.3.extended if coming from 3.2.<br /> :::'''3.3.1.2.''' T.3' is not found. In this case, the program searches for new potential t.5 and t.4 according to step 2.<br /> ::'''3.3.2.''' The Price Does Not Break the TL. <br /> ::In this case, this model is classified as built through t.3 (absolute extreme). The program proceeds to step 4, or to sub-step 3.3.ext. if current algorithm line is coming from 3.2.<br /> <br /> ::'''3.3.ext. Additional Trend Line Construction Through t.5&quot;.'''<br /> If:<br /> *The t.5 bar does not exceed the range of t.4;<br /> *At the time of model calculation, the level of t.4 is confirmed, then this model is checked for the possibility of constructing an additional Trend Line (TL) through t.5&quot;. Note: If t.4 is not confirmed, this model should be recalculated upon the appearance of a bar that confirms it's t.4.<br /> ''' Definition: Point 5&quot; '''<br /> Point 5&quot; can lie in the segment between t.5 and the point confirming t.4. On this segment, a point is searched that meets the following requirements:<br /> <br /> ''' Rule for Selecting Point 5&quot; High '''<br /> To the left of the bar containing t.5&quot;, the nearest high should be above the level of t.5.<br /> To the right of t.5&quot;, at least one nearest high should be below or equal to t.5. If the nearest high is equal to the level of t.5, then the next high should again be below or equal to the level of t.5, until at least one bar is strictly below the level of t.5.<br /> ''' Rule for Selecting Point 5&quot; Low '''<br /> To the left of the bar containing t.5&quot;, the nearest low should be below the level of the extreme.<br /> To the right of t.5&quot;, at least one nearest low should be above or equal to t.5. If the nearest low is equal to the level of t.5, then the next low should again be above or equal to the level of t.5, until at least one bar is strictly above the level of t.5.<br /> ''' Special Cases for Point 5&quot; '''<br /> Point 5&quot; may belong to a bar that has broken the level of t.4 (but only the first of such bars). If the bar of potential t.5&quot; breaks the level of calculated t.6 from t.5, then it is impossible to construct a TL through t.5&quot; for this model (this model does not contain such a point).<br /> <br /> :::'''3.3.ext.1.''' Additional TL Calculation <br /> :::If a bar is found that fits the rule for selecting 5&quot;, an additional TL is calculated for the potential t.5&quot; (hereafter TL&quot;). This line is checked for the absence of breaks in the segment from t.3/3'' to potential t.5&quot;.<br /> <br /> :::::'''3.3ext.1.a.''' If there is an intersection, the program moves to check the next bar as a potential t.5&quot;.<br /> <br /> :::::'''3.3ext.1.b''' If there is no intersection, the found bar is compared with the previous candidate for t.5&quot; (if there was one in the previous iteration of the cycle). If the considered bar is closer to the level of t.4 than the candidate for t.5&quot;, then the considered bar becomes the new candidate for t.5&quot;.<br /> :::::The check of bars continues in a cycle until a bar confirming t.4 is reached. If a candidate for t.5 is found as a result of the check, the program moves to sub-step 3.3ext.1.1; otherwise, it moves to step 4.<br /> ::::'''3.3ext.1.1''' If the analyzed model is built through t.3', a candidate for t.3&quot; is sought in the segment t.3-t.3', through which such a line to t.5&quot; can be built that will not have price intersections in the segment t.3-t.3&quot;.<br /> :::::'''3.3ext.1.1.1''' If a candidate for t.3&quot; is found, where there are no intersections, a check is made for the intersection of TL&quot; by the bar following t.5&quot;.<br /> ::::::'''3.3.ext.1.1.1.A''' If there are intersections, t.5&quot; is declared canceled, and the next one is sought according to sub-step 3.3.ext.<br /> ::::::'''3.3.ext.1.1.1.B''' Otherwise, the program moves to step 13.2.<br /> :::::'''3.3.ext.1.1.2''' If a suitable t.3&quot; is not found, a re-search for a candidate for t.5&quot; is carried out according to sub-steps 3.3.ext., but in this case, if a candidate for t.5&quot; was found, it becomes a canceled candidate for t.5&quot;. The new candidate must already be further from t.4 than the previously discarded ones.<br /> ::::'''3.3ext.1.2''' If the analyzed model is built through t.3, a check is made for the intersection of TL'' by the bar following t.5&quot;.<br /> :::::'''3.3ext.1.2.A''' If there are intersections, t.5&quot; is declared as canceled t.5', and the next one is sought according to sub-step 3.3.ext.<br /> :::::'''3.3ext.1.2.B''' If there are no intersections, the algorithm moves to step 13.2.<br /> :::'''3.3.ext.2''' TL'' is checked for price intersections in the segment between t.5 (inclusive) and potential t.5&quot; (hereafter segment 5-5&quot;).<br /> ::::'''3.3.ext.2.1''' If there is an intersection, then this 5&quot; is filtered out. A re-search for a candidate for t.5&quot; is carried out according to sub-steps 3.3.ext., but in this case, the new candidate must already be further from t.4 (in terms of time) than the previously discarded ones.<br /> ::::'''3.3.ext.2.2''' If there are no intersections of TL&quot; in the segment 5-5&quot;, then t.5&quot; is found.<br /> ::::In this case, the report displays: EAM5&quot; EAM5&quot;<br /> ::::The program moves to step 4.<br /> ::::'''3.3.ext.2.3''' If t.5&quot; is not found, the program moves to step 4.</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_II&diff=192 2023-08-26T14:47:53Z

<p>Admin: </p> <hr /> <div>This article is not finished<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with UMG General Concepts.<br /> <br /> ==='''Step I. Search For Point 3 of the External Attraction Model (EAM) and the Sarting Point of the Previous Trend.'''===<br /> : '''1.1.''' The program looks for the first possible extreme, satisfying Single Bar Rule. Such an extreme is a candidate for potential point 3 ( potential t.3).<br /> : '''1.2.''' Next, the program checks the bars from right to left (i.e., in the past) from the bar containing the extreme candidate for point 3 to one of the following events:<br /> :: '''1.2.1.''' Found the last intersection (breakthrough) point by the price level of the candidate for point 3.<br /> ::In this case, the report displays: <br /> :: PREVdata: FullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.2.''' The program reached the starting point of the chart (i.e., the price did not intersect the level of point 3 after the starting point of the chart).<br /> ::In this case, the report displays: <br /> :: PREVdata: NoFullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.1.''' The price checked 300 bars preceding point 3, but the level of step 3 did not intersect at this segment. The program looks for an absolute extreme (opposite to step 3) on the segment from the 300th bar before point 3 to point 3. The program proceeds to substep 1.3.<br /> : '''1.3.''' The program looks for an absolute extreme (opposite to point 3 extreme) on the segment:<br /> ::- from the last intersection by the price level of the candidate for point 3 (inclusive) (if came from 1.2.1.), or :: - from the starting point of the chart (if came from 1.2.2.), or <br /> :: - from 300 bars(if came from 1.2.3.) <br /> :: to point 3 (excluding).<br /> :: '''1.3.1.''' Absolute extreme found. The candidate for point 3 is confirmed; moreover, the found confirming extreme is the assumed (if coming from 1.2.2. or 1.2.3.) starting point of the preceding trend.'''<br /> ::The program checks for the absence of extremes equal to point 3 between the assumed starting point of the previous trend and point 3. <br /> :::'''1.3.1.1.''' If such an extreme is found, this candidate for point 3 is discarded, and this point 3 is discarded. <br /> :::'''1.3.1.2.''' If such an extreme is not found, the program proceeds to step 2.<br /> ::'''1.3.2.''' Absolute extreme not found. This point 3 is discarded.'''<br /> ::Simultaneously with step 1, the program launches the search for the next potential point 3.<br /> <br /> ==='''Step II. Search For Potentioal Points 5 and 4 ''' ===<br /> '''The Orientation rule (N1 requirement) for Algorithm II is as follows:'''<br /> If point 3 is low, then the level of point 5 should be higher than point 3. <br /> If point 3 is high, then the level of point 5 should be lower than point 3.<br /> '''Search for Point 5.''' The bar following the bar of Point 3 (and in repeated applications of this step - the bar specified in this algorithm) is checked for not overcoming the level of point 3 (since N1 requirement for Algorithm II must be observed).<br /> :'''2.1.''' If the price has overcome the level of point 3, the program discards the considered step 3 (due to N1 requirement).<br /> :'''2.2.''' If N1 requirement is met for the analyzed bar, it is checked for compliance with N1 requirement as a potential point 5 (hereafter - point 5 or t.5).<br /> ::'''2.2.1.''' If the analyzed bar is not an extreme according to N1 requirement (as a potential point 5), the program checks the next bar from the beginning of step 2.<br /> ::'''2.2.2.''' If the analyzed bar is determined as an extreme according to N1 requirement (as a potential point 5), then this bar is checked for reaching (but not necessarily overcoming) the level of point 3. There are 2 options:<br /> :::'''2.2.2.1.''' If the level of point 3 is reached, the program analyzes the next bar according to this step (i.e., from the beginning of step 2).<br /> :::'''2.2.2.2.''' If the level of point 3 is not reached, the analyzed bar is a potential point 5, and the program moves to substep 2.3.<br /> :'''2.3. Search for Point 4.''' The program searches for a bar, which was the last to cross the level of the considered potential point 5. Let's denote this bar as lcb5 (line-crossing-bar-5). If lcb5 coincides with the bar of point 3, we denote the bar following lcb5 as look4. Otherwise, look4 = lcb5. The program searches for a bar with the maximum (if point 3 is low) or minimum (if point 3 is high) price in the interval from lcb5 to potential point 5. Then this bar is checked for being an extreme according to N1 requirement as a potential pont 4 (hereafter – point 4 or t.4). There are 2 options:<br /> ::'''2.3.1.''' The bar is an absolute extreme (as a potential point 4). In this case, potential point 4 is found.<br /> :::'''2.3.1.1.''' If step 2 has already been determined (this is possible when this step is triggered during the search for an alternative model), the program checks the line chart for extra points in the section from step 2 to step 4. There are 2 options:<br /> ::::'''2.3.1.1.A.''' If extra points are found, the program processes the next bar after potential point 5 according to step 2.<br /> ::::'''2.3.1.1.B.''' Extra intersections are not found; the program moves to substep 2.4.<br /> :::'''2.3.1.2.''' If substep 2.3.1. is triggered during the search for the basic model, the program moves to substep 2.4.<br /> ::'''2.3.2.''' The bar is not an absolute extreme (as a potential point 4). In this case, the program looks for another candidate for point 5 according to this step (i.e., according to step 2).<br /> If the program has processed 50 bars in a row according to this step (step 2), and the program has not moved to another step of the algorithm, then this potential point 3 is discarded.<br /> If there are 150 or more bars between potential point 3 and the analyzed bar, and potential points 4 and 5 are not found, then this potential point 3 is discarded.<br /> :'''2.4.''' Real-Time Verification of t.5 <br /> :The potential t.5 bar is checked for the presence of bars between the analyzed bar and the potential t.4 bar, which contain price values more distant (or even equally distant) from the potential t.4 than the most distant from t.4 value of the analyzed bar. This is a check of the potential t.5 for beeing the '''potential absolute extreme'''. The following options are possible:<br /> ::'''2.4.1.''' If the extreme is potentially absolute, the program proceeds to step 3.<br /> ::'''2.4.2.''' If the extreme is not potentially absolute, the program checks the next bar starting from this step (i.e., step 2).<br /> <br /> ===''' Step III. Confirmation of Point 4. Searching for Alternative t.5 and t.5&quot; '''===<br /> The program checks whether the bar of potential t.5 has reached the level of t.4. Two scenarios are possible:<br /> :'''3.1.''' The Bar of Potential t.5 Has Reached t.4.<br /> :In this case:<br /> ::The model is built through absolute t.5.<br /> ::The t.5 bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> ::Point 4 is confirmed,<br /> ::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3 (since there is already possible to display the model through t.5 on the chart).<br /> :'''3.2.''' The Bar of Potential t.5 Has Not Reached t.4. <br /> :In this case, the program checks the next bar for reaching the level of t.4. The following options are possible:<br /> ::'''3.2.1. The Considered Bar Reaches the Level of Potential t.4. <br /> ::In this case:<br /> :::The model is built through absolute t.5.<br /> :::The considered bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> :::Point 4 is confirmed,<br /> :::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3.ext, but first goes through sub-step 3.3.<br /> ::'''3.2.2.''' The Considered Bar Does Not Reach the Level of t.4.<br /> ::In this case the program checks the next bar for overcoming the level of potential t.5. Two scenarios are possible:<br /> :::'''3.2.2.1.''' If the t.5 level is overcome, the analyzed bar is considered as a new potential t.5. The program processes this bar according to step 2.<br /> :::'''3.2.2.2.''' If the t.5 level is not overcome, the analyzed bar is checked for reaching the level of t.4 according to sub-step 3.2.<br /> ::In parallel (i.e., an additional branch is created), the program proceeds to sub-step 3.3 (since there is already an option to display the model through t.5 on the chart). The model in this branch receives a &quot;draw_flag&quot; label.<br /> :'''3.3.''' Construction of the Trend Line (TL). <br /> :A Trend Line (TL) is constructed from t.3 to t.5. Each bar between t.3 and t.5 is checked for breaking the TL. Two scenarios are possible:<br /> ::'''3.3.1.'''The Price Crosses the TL. <br /> ::In this case, the TL through t.3 is not constructed. The program searches for a candidate for point 3' (hereafter - t.3'). T.3' is selected in such a way that the TL' (constructed from t.3' to t.5) is not crossed by the price in the 3-5 segment. Rule No.1 for t.3' is not applied. T.3' cannot belong to the same bar as t.4. Two scenarios are possible:<br /> :::'''3.3.1.1.''' T.3' is found, this model is classified as built through t.3'. The program proceeds to step 4, or to sub-step 3.3.extended if coming from 3.2.<br /> :::'''3.3.1.2.''' T.3' is not found. In this case, the program searches for new potential t.5 and t.4 according to step 2.<br /> ::'''3.3.2.''' The Price Does Not Break the TL. <br /> ::In this case, this model is classified as built through t.3 (absolute extreme). The program proceeds to step 4, or to sub-step 3.3.ext. if current algorithm line is coming from 3.2.<br /> <br /> ::'''3.3.ext. Additional Trend Line Construction Through t.5&quot;.'''<br /> If:<br /> *The t.5 bar does not exceed the range of t.4;<br /> *At the time of model calculation, the level of t.4 is confirmed, then this model is checked for the possibility of constructing an additional Trend Line (TL) through t.5&quot;. Note: If t.4 is not confirmed, this model should be recalculated upon the appearance of a bar that confirms it's t.4.<br /> ''' Definition: Point 5&quot; '''<br /> Point 5&quot; can lie in the segment between t.5 and the point confirming t.4. On this segment, a point is searched that meets the following requirements:<br /> <br /> ''' Rule for Selecting Point 5&quot; High '''<br /> To the left of the bar containing t.5&quot;, the nearest high should be above the level of t.5.<br /> To the right of t.5&quot;, at least one nearest high should be below or equal to t.5. If the nearest high is equal to the level of t.5, then the next high should again be below or equal to the level of t.5, until at least one bar is strictly below the level of t.5.<br /> ''' Rule for Selecting Point 5&quot; Low '''<br /> To the left of the bar containing t.5&quot;, the nearest low should be below the level of the extreme.<br /> To the right of t.5&quot;, at least one nearest low should be above or equal to t.5. If the nearest low is equal to the level of t.5, then the next low should again be above or equal to the level of t.5, until at least one bar is strictly above the level of t.5.<br /> ''' Special Cases for Point 5&quot; '''<br /> Point 5&quot; may belong to a bar that has broken the level of t.4 (but only the first of such bars). If the bar of potential t.5&quot; breaks the level of calculated t.6 from t.5, then it is impossible to construct a TL through t.5&quot; for this model (this model does not contain such a point).<br /> <br /> :::'''3.3.ext.1.''' Additional TL Calculation <br /> :::If a bar is found that fits the rule for selecting 5&quot;, an additional TL is calculated for the potential t.5&quot; (hereafter TL&quot;). This line is checked for the absence of breaks in the segment from t.3/3'' to potential t.5&quot;.<br /> <br /> :::::'''3.3ext.1.a.''' If there is an intersection, the program moves to check the next bar as a potential t.5&quot;.<br /> <br /> :::::'''3.3ext.1.b''' If there is no intersection, the found bar is compared with the previous candidate for t.5&quot; (if there was one in the previous iteration of the cycle). If the considered bar is closer to the level of t.4 than the candidate for t.5&quot;, then the considered bar becomes the new candidate for t.5&quot;.<br /> :::::The check of bars continues in a cycle until a bar confirming t.4 is reached. If a candidate for t.5 is found as a result of the check, the program moves to sub-step 3.3ext.1.1; otherwise, it moves to step 4.<br /> ::::'''3.3ext.1.1''' If the analyzed model is built through t.3', a candidate for t.3&quot; is sought in the segment t.3-t.3', through which such a line to t.5&quot; can be built that will not have price intersections in the segment t.3-t.3&quot;.<br /> :::::'''3.3ext.1.1.1''' If a candidate for t.3&quot; is found, where there are no intersections, a check is made for the intersection of TL&quot; by the bar following t.5&quot;.<br /> ::::::'''3.3.ext.1.1.1.A''' If there are intersections, t.5&quot; is declared canceled, and the next one is sought according to sub-step 3.3.ext.<br /> ::::::'''3.3.ext.1.1.1.B''' Otherwise, the program moves to step 13.2.<br /> :::::'''3.3.ext.1.1.2''' If a suitable t.3&quot; is not found, a re-search for a candidate for t.5&quot; is carried out according to sub-steps 3.3.ext., but in this case, if a candidate for t.5&quot; was found, it becomes a canceled candidate for t.5&quot;. The new candidate must already be further from t.4 than the previously discarded ones.<br /> ::::'''3.3ext.1.2''' If the analyzed model is built through t.3, a check is made for the intersection of TL'' by the bar following t.5&quot;.<br /> :::::'''3.3ext.1.2.A''' If there are intersections, t.5&quot; is declared as canceled t.5', and the next one is sought according to sub-step 3.3.ext.<br /> :::::'''3.3ext.1.2.B''' If there are no intersections, the algorithm moves to step 13.2.<br /> :::'''3.3.ext.2''' TL'' is checked for price intersections in the segment between t.5 (inclusive) and potential t.5&quot; (hereafter segment 5-5&quot;).<br /> ::::'''3.3.ext.2.1''' If there is an intersection, then this 5&quot; is filtered out. A re-search for a candidate for t.5&quot; is carried out according to sub-steps 3.3.ext., but in this case, the new candidate must already be further from t.4 (in terms of time) than the previously discarded ones.<br /> ::::'''3.3.ext.2.2''' If there are no intersections of TL&quot; in the segment 5-5&quot;, then t.5&quot; is found.<br /> ::::In this case, the report displays: EAM5&quot; EAM5&quot;<br /> ::::The program moves to step 4.<br /> ::::'''3.3.ext.2.3''' If t.5'' is not found, the program moves to step 4.</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_II&diff=191 2023-08-26T12:12:05Z

<p>Admin: </p> <hr /> <div>This article is not finished<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with UMG General Concepts.<br /> <br /> ==='''Step I. Search For Point 3 of the External Attraction Model (EAM) and the Sarting Point of the Previous Trend.'''===<br /> : '''1.1.''' The program looks for the first possible extreme, satisfying Single Bar Rule. Such an extreme is a candidate for potential point 3 ( potential t.3).<br /> : '''1.2.''' Next, the program checks the bars from right to left (i.e., in the past) from the bar containing the extreme candidate for point 3 to one of the following events:<br /> :: '''1.2.1.''' Found the last intersection (breakthrough) point by the price level of the candidate for point 3.<br /> ::In this case, the report displays: <br /> :: PREVdata: FullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.2.''' The program reached the starting point of the chart (i.e., the price did not intersect the level of point 3 after the starting point of the chart).<br /> ::In this case, the report displays: <br /> :: PREVdata: NoFullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.1.''' The price checked 300 bars preceding point 3, but the level of step 3 did not intersect at this segment. The program looks for an absolute extreme (opposite to step 3) on the segment from the 300th bar before point 3 to point 3. The program proceeds to substep 1.3.<br /> : '''1.3.''' The program looks for an absolute extreme (opposite to point 3 extreme) on the segment:<br /> ::- from the last intersection by the price level of the candidate for point 3 (inclusive) (if came from 1.2.1.), or :: - from the starting point of the chart (if came from 1.2.2.), or <br /> :: - from 300 bars(if came from 1.2.3.) <br /> :: to point 3 (excluding).<br /> :: '''1.3.1.''' Absolute extreme found. The candidate for point 3 is confirmed; moreover, the found confirming extreme is the assumed (if coming from 1.2.2. or 1.2.3.) starting point of the preceding trend.'''<br /> ::The program checks for the absence of extremes equal to point 3 between the assumed starting point of the previous trend and point 3. <br /> :::'''1.3.1.1.''' If such an extreme is found, this candidate for point 3 is discarded, and this point 3 is discarded. <br /> :::'''1.3.1.2.''' If such an extreme is not found, the program proceeds to step 2.<br /> ::'''1.3.2.''' Absolute extreme not found. This point 3 is discarded.'''<br /> ::Simultaneously with step 1, the program launches the search for the next potential point 3.<br /> <br /> ==='''Step II. Search For Potentioal Points 5 and 4 ''' ===<br /> '''The Orientation rule (N1 requirement) for Algorithm II is as follows:'''<br /> If point 3 is low, then the level of point 5 should be higher than point 3. <br /> If point 3 is high, then the level of point 5 should be lower than point 3.<br /> '''Search for Point 5.''' The bar following the bar of Point 3 (and in repeated applications of this step - the bar specified in this algorithm) is checked for not overcoming the level of point 3 (since N1 requirement for Algorithm II must be observed).<br /> :'''2.1.''' If the price has overcome the level of point 3, the program discards the considered step 3 (due to N1 requirement).<br /> :'''2.2.''' If N1 requirement is met for the analyzed bar, it is checked for compliance with N1 requirement as a potential point 5 (hereafter - point 5 or t.5).<br /> ::'''2.2.1.''' If the analyzed bar is not an extreme according to N1 requirement (as a potential point 5), the program checks the next bar from the beginning of step 2.<br /> ::'''2.2.2.''' If the analyzed bar is determined as an extreme according to N1 requirement (as a potential point 5), then this bar is checked for reaching (but not necessarily overcoming) the level of point 3. There are 2 options:<br /> :::'''2.2.2.1.''' If the level of point 3 is reached, the program analyzes the next bar according to this step (i.e., from the beginning of step 2).<br /> :::'''2.2.2.2.''' If the level of point 3 is not reached, the analyzed bar is a potential point 5, and the program moves to substep 2.3.<br /> :'''2.3. Search for Point 4.''' The program searches for a bar, which was the last to cross the level of the considered potential point 5. Let's denote this bar as lcb5 (line-crossing-bar-5). If lcb5 coincides with the bar of point 3, we denote the bar following lcb5 as look4. Otherwise, look4 = lcb5. The program searches for a bar with the maximum (if point 3 is low) or minimum (if point 3 is high) price in the interval from lcb5 to potential point 5. Then this bar is checked for being an extreme according to N1 requirement as a potential pont 4 (hereafter – point 4 or t.4). There are 2 options:<br /> ::'''2.3.1.''' The bar is an absolute extreme (as a potential point 4). In this case, potential point 4 is found.<br /> :::'''2.3.1.1.''' If step 2 has already been determined (this is possible when this step is triggered during the search for an alternative model), the program checks the line chart for extra points in the section from step 2 to step 4. There are 2 options:<br /> ::::'''2.3.1.1.A.''' If extra points are found, the program processes the next bar after potential point 5 according to step 2.<br /> ::::'''2.3.1.1.B.''' Extra intersections are not found; the program moves to substep 2.4.<br /> :::'''2.3.1.2.''' If substep 2.3.1. is triggered during the search for the basic model, the program moves to substep 2.4.<br /> ::'''2.3.2.''' The bar is not an absolute extreme (as a potential point 4). In this case, the program looks for another candidate for point 5 according to this step (i.e., according to step 2).<br /> If the program has processed 50 bars in a row according to this step (step 2), and the program has not moved to another step of the algorithm, then this potential point 3 is discarded.<br /> If there are 150 or more bars between potential point 3 and the analyzed bar, and potential points 4 and 5 are not found, then this potential point 3 is discarded.<br /> :'''2.4.''' Real-Time Verification of t.5 <br /> :The potential t.5 bar is checked for the presence of bars between the analyzed bar and the potential t.4 bar, which contain price values more distant (or even equally distant) from the potential t.4 than the most distant from t.4 value of the analyzed bar. This is a check of the potential t.5 for beeing the '''potential absolute extreme'''. The following options are possible:<br /> ::'''2.4.1.''' If the extreme is potentially absolute, the program proceeds to step 3.<br /> ::'''2.4.2.''' If the extreme is not potentially absolute, the program checks the next bar starting from this step (i.e., step 2).<br /> <br /> ===''' Step III. Confirmation of Point 4. Searching for Alternative t.5 and t.5&quot; '''===<br /> The program checks whether the bar of potential t.5 has reached the level of t.4. Two scenarios are possible:<br /> :'''3.1.''' The Bar of Potential t.5 Has Reached t.4.<br /> :In this case:<br /> ::The model is built through absolute t.5.<br /> ::The t.5 bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> ::Point 4 is confirmed,<br /> ::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3 (since there is already possible to display the model through t.5 on the chart).<br /> :'''3.2.''' The Bar of Potential t.5 Has Not Reached t.4. <br /> :In this case, the program checks the next bar for reaching the level of t.4. The following options are possible:<br /> ::'''3.2.1. The Considered Bar Reaches the Level of Potential t.4. <br /> ::In this case:<br /> :::The model is built through absolute t.5.<br /> :::The considered bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> :::Point 4 is confirmed,<br /> :::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3.ext, but first goes through sub-step 3.3.<br /> ::'''3.2.2.''' The Considered Bar Does Not Reach the Level of t.4.<br /> ::In this case the program checks the next bar for overcoming the level of potential t.5. Two scenarios are possible:<br /> :::'''3.2.2.1.''' If the t.5 level is overcome, the analyzed bar is considered as a new potential t.5. The program processes this bar according to step 2.<br /> :::'''3.2.2.2.''' If the t.5 level is not overcome, the analyzed bar is checked for reaching the level of t.4 according to sub-step 3.2.<br /> ::In parallel (i.e., an additional branch is created), the program proceeds to sub-step 3.3 (since there is already an option to display the model through t.5 on the chart). The model in this branch receives a &quot;draw_flag&quot; label.<br /> :'''3.3.''' Construction of the Trend Line (TL). <br /> :A Trend Line (TL) is constructed from t.3 to t.5. Each bar between t.3 and t.5 is checked for breaking the TL. Two scenarios are possible:<br /> ::'''3.3.1.'''The Price Crosses the TL. <br /> ::In this case, the TL through t.3 is not constructed. The program searches for a candidate for point 3' (hereafter - t.3'). T.3' is selected in such a way that the TL' (constructed from t.3' to t.5) is not crossed by the price in the 3-5 segment. Rule No.1 for t.3' is not applied. T.3' cannot belong to the same bar as t.4. Two scenarios are possible:<br /> :::'''3.3.1.1.''' T.3' is found, this model is classified as built through t.3'. The program proceeds to step 4, or to sub-step 3.3.extended if coming from 3.2.<br /> :::'''3.3.1.2.''' T.3' is not found. In this case, the program searches for new potential t.5 and t.4 according to step 2.<br /> ::'''3.3.2.''' The Price Does Not Break the TL. <br /> ::In this case, this model is classified as built through t.3 (absolute extreme). The program proceeds to step 4, or to sub-step 3.3.ext. if current algorithm line is coming from 3.2.</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_II&diff=190 2023-08-26T12:10:36Z

<p>Admin: </p> <hr /> <div>This article is not finished<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with UMG General Concepts.<br /> <br /> ==='''Step I. Search For Point 3 of the External Attraction Model (EAM) and the Sarting Point of the Previous Trend.'''===<br /> : '''1.1.''' The program looks for the first possible extreme, satisfying Single Bar Rule. Such an extreme is a candidate for potential point 3 ( potential t.3).<br /> : '''1.2.''' Next, the program checks the bars from right to left (i.e., in the past) from the bar containing the extreme candidate for point 3 to one of the following events:<br /> :: '''1.2.1.''' Found the last intersection (breakthrough) point by the price level of the candidate for point 3.<br /> ::In this case, the report displays: <br /> :: PREVdata: FullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.2.''' The program reached the starting point of the chart (i.e., the price did not intersect the level of point 3 after the starting point of the chart).<br /> ::In this case, the report displays: <br /> :: PREVdata: NoFullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.1.''' The price checked 300 bars preceding point 3, but the level of step 3 did not intersect at this segment. The program looks for an absolute extreme (opposite to step 3) on the segment from the 300th bar before point 3 to point 3. The program proceeds to substep 1.3.<br /> : '''1.3.''' The program looks for an absolute extreme (opposite to point 3 extreme) on the segment:<br /> ::- from the last intersection by the price level of the candidate for point 3 (inclusive) (if came from 1.2.1.), or :: - from the starting point of the chart (if came from 1.2.2.), or <br /> :: - from 300 bars(if came from 1.2.3.) <br /> :: to point 3 (excluding).<br /> :: '''1.3.1.''' Absolute extreme found. The candidate for point 3 is confirmed; moreover, the found confirming extreme is the assumed (if coming from 1.2.2. or 1.2.3.) starting point of the preceding trend.'''<br /> ::The program checks for the absence of extremes equal to point 3 between the assumed starting point of the previous trend and point 3. <br /> :::'''1.3.1.1.''' If such an extreme is found, this candidate for point 3 is discarded, and this point 3 is discarded. <br /> :::'''1.3.1.2.''' If such an extreme is not found, the program proceeds to step 2.<br /> ::'''1.3.2.''' Absolute extreme not found. This point 3 is discarded.'''<br /> ::Simultaneously with step 1, the program launches the search for the next potential point 3.<br /> <br /> ==='''Step II. Search For Potentioal Points 5 and 4 ''' ===<br /> '''The Orientation rule (N1 requirement) for Algorithm II is as follows:'''<br /> If point 3 is low, then the level of point 5 should be higher than point 3. <br /> If point 3 is high, then the level of point 5 should be lower than point 3.<br /> '''Search for Point 5.''' The bar following the bar of Point 3 (and in repeated applications of this step - the bar specified in this algorithm) is checked for not overcoming the level of point 3 (since N1 requirement for Algorithm II must be observed).<br /> :'''2.1.''' If the price has overcome the level of point 3, the program discards the considered step 3 (due to N1 requirement).<br /> :'''2.2.''' If N1 requirement is met for the analyzed bar, it is checked for compliance with N1 requirement as a potential point 5 (hereafter - point 5 or t.5).<br /> ::'''2.2.1.''' If the analyzed bar is not an extreme according to N1 requirement (as a potential point 5), the program checks the next bar from the beginning of step 2.<br /> ::'''2.2.2.''' If the analyzed bar is determined as an extreme according to N1 requirement (as a potential point 5), then this bar is checked for reaching (but not necessarily overcoming) the level of point 3. There are 2 options:<br /> :::'''2.2.2.1.''' If the level of point 3 is reached, the program analyzes the next bar according to this step (i.e., from the beginning of step 2).<br /> :::'''2.2.2.2.''' If the level of point 3 is not reached, the analyzed bar is a potential point 5, and the program moves to substep 2.3.<br /> :'''2.3. Search for Point 4.''' The program searches for a bar, which was the last to cross the level of the considered potential point 5. Let's denote this bar as lcb5 (line-crossing-bar-5). If lcb5 coincides with the bar of point 3, we denote the bar following lcb5 as look4. Otherwise, look4 = lcb5. The program searches for a bar with the maximum (if point 3 is low) or minimum (if point 3 is high) price in the interval from lcb5 to potential point 5. Then this bar is checked for being an extreme according to N1 requirement as a potential pont 4 (hereafter – point 4 or t.4). There are 2 options:<br /> ::'''2.3.1.''' The bar is an absolute extreme (as a potential point 4). In this case, potential point 4 is found.<br /> :::'''2.3.1.1.''' If step 2 has already been determined (this is possible when this step is triggered during the search for an alternative model), the program checks the line chart for extra points in the section from step 2 to step 4. There are 2 options:<br /> ::::'''2.3.1.1.A.''' If extra points are found, the program processes the next bar after potential point 5 according to step 2.<br /> ::::'''2.3.1.1.B.''' Extra intersections are not found; the program moves to substep 2.4.<br /> :::'''2.3.1.2.''' If substep 2.3.1. is triggered during the search for the basic model, the program moves to substep 2.4.<br /> ::'''2.3.2.''' The bar is not an absolute extreme (as a potential point 4). In this case, the program looks for another candidate for point 5 according to this step (i.e., according to step 2).<br /> If the program has processed 50 bars in a row according to this step (step 2), and the program has not moved to another step of the algorithm, then this potential point 3 is discarded.<br /> If there are 150 or more bars between potential point 3 and the analyzed bar, and potential points 4 and 5 are not found, then this potential point 3 is discarded.<br /> :'''2.4.''' Real-Time Verification of t.5 <br /> :The potential t.5 bar is checked for the presence of bars between the analyzed bar and the potential t.4 bar, which contain price values more distant (or even equally distant) from the potential t.4 than the most distant from t.4 value of the analyzed bar. This is a check of the potential t.5 for beeing the '''potential absolute extreme'''. The following options are possible:<br /> ::'''2.4.1.''' If the extreme is potentially absolute, the program proceeds to step 3.<br /> ::'''2.4.2.''' If the extreme is not potentially absolute, the program checks the next bar starting from this step (i.e., step 2).<br /> <br /> ===''' Step III. Confirmation of Point 4. Searching for Alternative t.5 and t.5&quot; '''===<br /> The program checks whether the bar of potential t.5 has reached the level of t.4. Two scenarios are possible:<br /> :'''3.1.''' The Bar of Potential t.5 Has Reached t.4.<br /> :In this case:<br /> ::The model is built through absolute t.5.<br /> ::The t.5 bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> ::Point 4 is confirmed,<br /> ::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3 (since there is already possible to display the model through t.5 on the chart).<br /> :'''3.2.''' The Bar of Potential t.5 Has Not Reached t.4. <br /> :In this case, the program checks the next bar for reaching the level of t.4. The following options are possible:<br /> ::'''3.2.1. The Considered Bar Reaches the Level of Potential t.4. <br /> ::In this case:<br /> :::The model is built through absolute t.5.<br /> :::The considered bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> :::Point 4 is confirmed,<br /> :::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3.ext, but first goes through sub-step 3.3.<br /> ::'''3.2.2.''' The Considered Bar Does Not Reach the Level of t.4.<br /> ::In this case the program checks the next bar for overcoming the level of potential t.5. Two scenarios are possible:<br /> :::'''3.2.2.1.''' If the t.5 level is overcome, the analyzed bar is considered as a new potential t.5. The program processes this bar according to step 2.<br /> :::'''3.2.2.2.''' If the t.5 level is not overcome, the analyzed bar is checked for reaching the level of t.4 according to sub-step 3.2.<br /> ::In parallel (i.e., an additional branch is created), the program proceeds to sub-step 3.3 (since there is already an option to display the model through t.5 on the chart). The model in this branch receives a &quot;draw_flag&quot; label.<br /> :'''3.3.''' Construction of the Trend Line (TL). <br /> :A Trend Line (TL) is constructed from t.3 to t.5. Each bar between t.3 and t.5 is checked for breaking the TL. Two scenarios are possible:<br /> ::'''3.3.1.'''The Price Crosses the TL. <br /> ::In this case, the TL through t.3 is not constructed. The program searches for a candidate for point 3' (hereafter - t.3'). T.3' is selected in such a way that the TL' (constructed from t.3' to t.5) is not crossed by the price in the 3-5 segment. Rule No.1 for t.3' is not applied. T.3' cannot belong to the same bar as t.4. Two scenarios are possible:<br /> :::'''3.3.1.1.''' T.3' is found, this model is classified as built through t.3'. The program proceeds to step 4, or to sub-step 3.3.extended if coming from 3.2.<br /> :::'''3.3.1.2.''' T.3' is not found. In this case, the program searches for new potential t.5 and t.4 according to step 2.<br /> ::'''3.3.2.''' The Price Does Not Break the TL. <br /> ::In this case, this model is classified as built through t.3 (absolute extreme). The program proceeds to step 4, or to sub-step 3.3.ext. if coming from 3.2.</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_II&diff=189 2023-08-26T12:09:16Z

<p>Admin: </p> <hr /> <div>This article is not finished<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with UMG General Concepts.<br /> <br /> ==='''Step I. Search For Point 3 of the External Attraction Model (EAM) and the Sarting Point of the Previous Trend.'''===<br /> : '''1.1.''' The program looks for the first possible extreme, satisfying Single Bar Rule. Such an extreme is a candidate for potential point 3 ( potential t.3).<br /> : '''1.2.''' Next, the program checks the bars from right to left (i.e., in the past) from the bar containing the extreme candidate for point 3 to one of the following events:<br /> :: '''1.2.1.''' Found the last intersection (breakthrough) point by the price level of the candidate for point 3.<br /> ::In this case, the report displays: <br /> :: PREVdata: FullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.2.''' The program reached the starting point of the chart (i.e., the price did not intersect the level of point 3 after the starting point of the chart).<br /> ::In this case, the report displays: <br /> :: PREVdata: NoFullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.1.''' The price checked 300 bars preceding point 3, but the level of step 3 did not intersect at this segment. The program looks for an absolute extreme (opposite to step 3) on the segment from the 300th bar before point 3 to point 3. The program proceeds to substep 1.3.<br /> : '''1.3.''' The program looks for an absolute extreme (opposite to point 3 extreme) on the segment:<br /> ::- from the last intersection by the price level of the candidate for point 3 (inclusive) (if came from 1.2.1.), or :: - from the starting point of the chart (if came from 1.2.2.), or <br /> :: - from 300 bars(if came from 1.2.3.) <br /> :: to point 3 (excluding).<br /> :: '''1.3.1.''' Absolute extreme found. The candidate for point 3 is confirmed; moreover, the found confirming extreme is the assumed (if coming from 1.2.2. or 1.2.3.) starting point of the preceding trend.'''<br /> ::The program checks for the absence of extremes equal to point 3 between the assumed starting point of the previous trend and point 3. <br /> :::'''1.3.1.1.''' If such an extreme is found, this candidate for point 3 is discarded, and this point 3 is discarded. <br /> :::'''1.3.1.2.''' If such an extreme is not found, the program proceeds to step 2.<br /> ::'''1.3.2.''' Absolute extreme not found. This point 3 is discarded.'''<br /> ::Simultaneously with step 1, the program launches the search for the next potential point 3.<br /> <br /> ==='''Step II. Search For Potentioal Points 5 and 4 ''' ===<br /> '''The Orientation rule (N1 requirement) for Algorithm II is as follows:'''<br /> If point 3 is low, then the level of point 5 should be higher than point 3. <br /> If point 3 is high, then the level of point 5 should be lower than point 3.<br /> '''Search for Point 5.''' The bar following the bar of Point 3 (and in repeated applications of this step - the bar specified in this algorithm) is checked for not overcoming the level of point 3 (since N1 requirement for Algorithm II must be observed).<br /> :'''2.1.''' If the price has overcome the level of point 3, the program discards the considered step 3 (due to N1 requirement).<br /> :'''2.2.''' If N1 requirement is met for the analyzed bar, it is checked for compliance with N1 requirement as a potential point 5 (hereafter - point 5 or t.5).<br /> ::'''2.2.1.''' If the analyzed bar is not an extreme according to N1 requirement (as a potential point 5), the program checks the next bar from the beginning of step 2.<br /> ::'''2.2.2.''' If the analyzed bar is determined as an extreme according to N1 requirement (as a potential point 5), then this bar is checked for reaching (but not necessarily overcoming) the level of point 3. There are 2 options:<br /> :::'''2.2.2.1.''' If the level of point 3 is reached, the program analyzes the next bar according to this step (i.e., from the beginning of step 2).<br /> :::'''2.2.2.2.''' If the level of point 3 is not reached, the analyzed bar is a potential point 5, and the program moves to substep 2.3.<br /> :'''2.3. Search for Point 4.''' The program searches for a bar, which was the last to cross the level of the considered potential point 5. Let's denote this bar as lcb5 (line-crossing-bar-5). If lcb5 coincides with the bar of point 3, we denote the bar following lcb5 as look4. Otherwise, look4 = lcb5. The program searches for a bar with the maximum (if point 3 is low) or minimum (if point 3 is high) price in the interval from lcb5 to potential point 5. Then this bar is checked for being an extreme according to N1 requirement as a potential pont 4 (hereafter – point 4 or t.4). There are 2 options:<br /> ::'''2.3.1.''' The bar is an absolute extreme (as a potential point 4). In this case, potential point 4 is found.<br /> :::'''2.3.1.1.''' If step 2 has already been determined (this is possible when this step is triggered during the search for an alternative model), the program checks the line chart for extra points in the section from step 2 to step 4. There are 2 options:<br /> ::::'''2.3.1.1.A.''' If extra points are found, the program processes the next bar after potential point 5 according to step 2.<br /> ::::'''2.3.1.1.B.''' Extra intersections are not found; the program moves to substep 2.4.<br /> :::'''2.3.1.2.''' If substep 2.3.1. is triggered during the search for the basic model, the program moves to substep 2.4.<br /> ::'''2.3.2.''' The bar is not an absolute extreme (as a potential point 4). In this case, the program looks for another candidate for point 5 according to this step (i.e., according to step 2).<br /> If the program has processed 50 bars in a row according to this step (step 2), and the program has not moved to another step of the algorithm, then this potential point 3 is discarded.<br /> If there are 150 or more bars between potential point 3 and the analyzed bar, and potential points 4 and 5 are not found, then this potential point 3 is discarded.<br /> :'''2.4.''' Real-Time Verification of t.5 <br /> :The potential t.5 bar is checked for the presence of bars between the analyzed bar and the potential t.4 bar, which contain price values more distant (or even equally distant) from the potential t.4 than the most distant from t.4 value of the analyzed bar. This is a check of the potential t.5 for beeing the '''potential absolute extreme'''. The following options are possible:<br /> ::'''2.4.1.''' If the extreme is potentially absolute, the program proceeds to step 3.<br /> ::'''2.4.2.''' If the extreme is not potentially absolute, the program checks the next bar starting from this step (i.e., step 2).<br /> <br /> ===''' Step III. Confirmation of Point 4. Searching for Alternative t.5 and t.5&quot; '''===<br /> The program checks whether the bar of potential t.5 has reached the level of t.4. Two scenarios are possible:<br /> :'''3.1.''' The Bar of Potential t.5 Has Reached t.4.<br /> :In this case:<br /> ::The model is built through absolute t.5.<br /> ::The t.5 bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> ::Point 4 is confirmed,<br /> ::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3 (since there is already possible to display the model through t.5 on the chart).<br /> :'''3.2.''' The Bar of Potential t.5 Has Not Reached t.4. <br /> :In this case, the program checks the next bar for reaching the level of t.4. The following options are possible:<br /> ::'''3.2.1. The Considered Bar Reaches the Level of Potential t.4. <br /> ::In this case:<br /> :::The model is built through absolute t.5.<br /> :::The considered bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> :::Point 4 is confirmed,<br /> :::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3.ext, but first goes through sub-step 3.3.<br /> ::'''3.2.2.''' The Considered Bar Does Not Reach the Level of t.4 ====<br /> ::In this case the program checks the next bar for overcoming the level of potential t.5. Two scenarios are possible:<br /> :::'''3.2.2.1.''' If the t.5 level is overcome, the analyzed bar is considered as a new potential t.5. The program processes this bar according to step 2.<br /> :::'''3.2.2.2.''' If the t.5 level is not overcome, the analyzed bar is checked for reaching the level of t.4 according to sub-step 3.2.<br /> ::In parallel (i.e., an additional branch is created), the program proceeds to sub-step 3.3 (since there is already an option to display the model through t.5 on the chart). The model in this branch receives a &quot;draw_flag&quot; label.<br /> :'''3.3.''' Construction of the Trend Line (TL). <br /> :A Trend Line (TL) is constructed from t.3 to t.5. Each bar between t.3 and t.5 is checked for breaking the TL. Two scenarios are possible:<br /> ::'''3.3.1.'''The Price Crosses the TL. <br /> ::In this case, the TL through t.3 is not constructed. The program searches for a candidate for point 3' (hereafter - t.3'). T.3' is selected in such a way that the TL' (constructed from t.3' to t.5) is not crossed by the price in the 3-5 segment. Rule No.1 for t.3' is not applied. T.3' cannot belong to the same bar as t.4. Two scenarios are possible:<br /> :::'''3.3.1.1.''' T.3' is found, this model is classified as built through t.3'. The program proceeds to step 4, or to sub-step 3.3.extended if coming from 3.2.<br /> :::'''3.3.1.2.''' T.3' is not found. In this case, the program searches for new potential t.5 and t.4 according to step 2.<br /> ::'''3.3.2.''' The Price Does Not Break the TL. <br /> ::In this case, this model is classified as built through t.3 (absolute extreme). The program proceeds to step 4, or to sub-step 3.3.ext. if coming from 3.2.</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_II&diff=188 2023-08-26T12:08:20Z

<p>Admin: </p> <hr /> <div>This article is not finished<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with UMG General Concepts.<br /> <br /> ==='''Step I. Search For Point 3 of the External Attraction Model (EAM) and the Sarting Point of the Previous Trend.'''===<br /> : '''1.1.''' The program looks for the first possible extreme, satisfying Single Bar Rule. Such an extreme is a candidate for potential point 3 ( potential t.3).<br /> : '''1.2.''' Next, the program checks the bars from right to left (i.e., in the past) from the bar containing the extreme candidate for point 3 to one of the following events:<br /> :: '''1.2.1.''' Found the last intersection (breakthrough) point by the price level of the candidate for point 3.<br /> ::In this case, the report displays: <br /> :: PREVdata: FullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.2.''' The program reached the starting point of the chart (i.e., the price did not intersect the level of point 3 after the starting point of the chart).<br /> ::In this case, the report displays: <br /> :: PREVdata: NoFullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.1.''' The price checked 300 bars preceding point 3, but the level of step 3 did not intersect at this segment. The program looks for an absolute extreme (opposite to step 3) on the segment from the 300th bar before point 3 to point 3. The program proceeds to substep 1.3.<br /> : '''1.3.''' The program looks for an absolute extreme (opposite to point 3 extreme) on the segment:<br /> ::- from the last intersection by the price level of the candidate for point 3 (inclusive) (if came from 1.2.1.), or :: - from the starting point of the chart (if came from 1.2.2.), or <br /> :: - from 300 bars(if came from 1.2.3.) <br /> :: to point 3 (excluding).<br /> :: '''1.3.1.''' Absolute extreme found. The candidate for point 3 is confirmed; moreover, the found confirming extreme is the assumed (if coming from 1.2.2. or 1.2.3.) starting point of the preceding trend.'''<br /> ::The program checks for the absence of extremes equal to point 3 between the assumed starting point of the previous trend and point 3. <br /> :::'''1.3.1.1.''' If such an extreme is found, this candidate for point 3 is discarded, and this point 3 is discarded. <br /> :::'''1.3.1.2.''' If such an extreme is not found, the program proceeds to step 2.<br /> ::'''1.3.2.''' Absolute extreme not found. This point 3 is discarded.'''<br /> ::Simultaneously with step 1, the program launches the search for the next potential point 3.<br /> ==='''Step II. Search For Potentioal Points 5 and 4 ''' ===<br /> '''The Orientation rule (N1 requirement) for Algorithm II is as follows:'''<br /> If point 3 is low, then the level of point 5 should be higher than point 3. <br /> If point 3 is high, then the level of point 5 should be lower than point 3.<br /> '''Search for Point 5.''' The bar following the bar of Point 3 (and in repeated applications of this step - the bar specified in this algorithm) is checked for not overcoming the level of point 3 (since N1 requirement for Algorithm II must be observed).<br /> :'''2.1.''' If the price has overcome the level of point 3, the program discards the considered step 3 (due to N1 requirement).<br /> :'''2.2.''' If N1 requirement is met for the analyzed bar, it is checked for compliance with N1 requirement as a potential point 5 (hereafter - point 5 or t.5).<br /> ::'''2.2.1.''' If the analyzed bar is not an extreme according to N1 requirement (as a potential point 5), the program checks the next bar from the beginning of step 2.<br /> ::'''2.2.2.''' If the analyzed bar is determined as an extreme according to N1 requirement (as a potential point 5), then this bar is checked for reaching (but not necessarily overcoming) the level of point 3. There are 2 options:<br /> :::'''2.2.2.1.''' If the level of point 3 is reached, the program analyzes the next bar according to this step (i.e., from the beginning of step 2).<br /> :::'''2.2.2.2.''' If the level of point 3 is not reached, the analyzed bar is a potential point 5, and the program moves to substep 2.3.<br /> :'''2.3. Search for Point 4.''' The program searches for a bar, which was the last to cross the level of the considered potential point 5. Let's denote this bar as lcb5 (line-crossing-bar-5). If lcb5 coincides with the bar of point 3, we denote the bar following lcb5 as look4. Otherwise, look4 = lcb5. The program searches for a bar with the maximum (if point 3 is low) or minimum (if point 3 is high) price in the interval from lcb5 to potential point 5. Then this bar is checked for being an extreme according to N1 requirement as a potential pont 4 (hereafter – point 4 or t.4). There are 2 options:<br /> ::'''2.3.1.''' The bar is an absolute extreme (as a potential point 4). In this case, potential point 4 is found.<br /> :::'''2.3.1.1.''' If step 2 has already been determined (this is possible when this step is triggered during the search for an alternative model), the program checks the line chart for extra points in the section from step 2 to step 4. There are 2 options:<br /> ::::'''2.3.1.1.A.''' If extra points are found, the program processes the next bar after potential point 5 according to step 2.<br /> ::::'''2.3.1.1.B.''' Extra intersections are not found; the program moves to substep 2.4.<br /> :::'''2.3.1.2.''' If substep 2.3.1. is triggered during the search for the basic model, the program moves to substep 2.4.<br /> ::'''2.3.2.''' The bar is not an absolute extreme (as a potential point 4). In this case, the program looks for another candidate for point 5 according to this step (i.e., according to step 2).<br /> If the program has processed 50 bars in a row according to this step (step 2), and the program has not moved to another step of the algorithm, then this potential point 3 is discarded.<br /> If there are 150 or more bars between potential point 3 and the analyzed bar, and potential points 4 and 5 are not found, then this potential point 3 is discarded.<br /> :'''2.4.''' Real-Time Verification of t.5 <br /> :The potential t.5 bar is checked for the presence of bars between the analyzed bar and the potential t.4 bar, which contain price values more distant (or even equally distant) from the potential t.4 than the most distant from t.4 value of the analyzed bar. This is a check of the potential t.5 for beeing the '''potential absolute extreme'''. The following options are possible:<br /> ::'''2.4.1.''' If the extreme is potentially absolute, the program proceeds to step 3.<br /> ::'''2.4.2.''' If the extreme is not potentially absolute, the program checks the next bar starting from this step (i.e., step 2).<br /> ===''' Step 3. Confirmation of Point 4. Searching for Alternative t.5 and t.5&quot; '''===<br /> The program checks whether the bar of potential t.5 has reached the level of t.4. Two scenarios are possible:<br /> :'''3.1.''' The Bar of Potential t.5 Has Reached t.4.<br /> :In this case:<br /> ::The model is built through absolute t.5.<br /> ::The t.5 bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> ::Point 4 is confirmed,<br /> ::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3 (since there is already possible to display the model through t.5 on the chart).<br /> :'''3.2.''' The Bar of Potential t.5 Has Not Reached t.4. <br /> :In this case, the program checks the next bar for reaching the level of t.4. The following options are possible:<br /> ::'''3.2.1. The Considered Bar Reaches the Level of Potential t.4. <br /> ::In this case:<br /> :::The model is built through absolute t.5.<br /> :::The considered bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> :::Point 4 is confirmed,<br /> :::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3.ext, but first goes through sub-step 3.3.<br /> ::'''3.2.2.''' The Considered Bar Does Not Reach the Level of t.4 ====<br /> ::In this case the program checks the next bar for overcoming the level of potential t.5. Two scenarios are possible:<br /> :::'''3.2.2.1.''' If the t.5 level is overcome, the analyzed bar is considered as a new potential t.5. The program processes this bar according to step 2.<br /> :::'''3.2.2.2.''' If the t.5 level is not overcome, the analyzed bar is checked for reaching the level of t.4 according to sub-step 3.2.<br /> ::In parallel (i.e., an additional branch is created), the program proceeds to sub-step 3.3 (since there is already an option to display the model through t.5 on the chart). The model in this branch receives a &quot;draw_flag&quot; label.<br /> :'''3.3.''' Construction of the Trend Line (TL). <br /> :A Trend Line (TL) is constructed from t.3 to t.5. Each bar between t.3 and t.5 is checked for breaking the TL. Two scenarios are possible:<br /> ::'''3.3.1.'''The Price Crosses the TL. <br /> ::In this case, the TL through t.3 is not constructed. The program searches for a candidate for point 3' (hereafter - t.3'). T.3' is selected in such a way that the TL' (constructed from t.3' to t.5) is not crossed by the price in the 3-5 segment. Rule No.1 for t.3' is not applied. T.3' cannot belong to the same bar as t.4. Two scenarios are possible:<br /> :::'''3.3.1.1.''' T.3' is found, this model is classified as built through t.3'. The program proceeds to step 4, or to sub-step 3.3.extended if coming from 3.2.<br /> :::'''3.3.1.2.''' T.3' is not found. In this case, the program searches for new potential t.5 and t.4 according to step 2.<br /> ::'''3.3.2.''' The Price Does Not Break the TL. <br /> ::In this case, this model is classified as built through t.3 (absolute extreme). The program proceeds to step 4, or to sub-step 3.3.ext. if coming from 3.2.</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_II&diff=187 2023-08-26T12:08:00Z

<p>Admin: </p> <hr /> <div>This article is not finished<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with UMG General Concepts.<br /> <br /> ==='''Step I. Search For Point 3 of the External Attraction Model (EAM) and the Sarting Point of the Previous Trend.'''===<br /> : '''1.1.''' The program looks for the first possible extreme, satisfying Single Bar Rule. Such an extreme is a candidate for potential point 3 ( potential t.3).<br /> : '''1.2.''' Next, the program checks the bars from right to left (i.e., in the past) from the bar containing the extreme candidate for point 3 to one of the following events:<br /> :: '''1.2.1.''' Found the last intersection (breakthrough) point by the price level of the candidate for point 3.<br /> ::In this case, the report displays: <br /> :: PREVdata: FullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.2.''' The program reached the starting point of the chart (i.e., the price did not intersect the level of point 3 after the starting point of the chart).<br /> ::In this case, the report displays: <br /> :: PREVdata: NoFullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.1.''' The price checked 300 bars preceding point 3, but the level of step 3 did not intersect at this segment. The program looks for an absolute extreme (opposite to step 3) on the segment from the 300th bar before point 3 to point 3. The program proceeds to substep 1.3.<br /> : '''1.3.''' The program looks for an absolute extreme (opposite to point 3 extreme) on the segment:<br /> ::- from the last intersection by the price level of the candidate for point 3 (inclusive) (if came from 1.2.1.), or :: - from the starting point of the chart (if came from 1.2.2.), or <br /> :: - from 300 bars(if came from 1.2.3.) <br /> :: to point 3 (excluding).<br /> :: '''1.3.1.''' Absolute extreme found. The candidate for point 3 is confirmed; moreover, the found confirming extreme is the assumed (if coming from 1.2.2. or 1.2.3.) starting point of the preceding trend.'''<br /> ::The program checks for the absence of extremes equal to point 3 between the assumed starting point of the previous trend and point 3. <br /> :::'''1.3.1.1.''' If such an extreme is found, this candidate for point 3 is discarded, and this point 3 is discarded. <br /> :::'''1.3.1.2.''' If such an extreme is not found, the program proceeds to step 2.<br /> ::'''1.3.2.''' Absolute extreme not found. This point 3 is discarded.'''<br /> ::Simultaneously with step 1, the program launches the search for the next potential point 3.<br /> <br /> ==='''Step II. Search For Potentioal Points 5 and 4 ''' ===<br /> '''The Orientation rule (N1 requirement) for Algorithm II is as follows:'''<br /> If point 3 is low, then the level of point 5 should be higher than point 3. <br /> If point 3 is high, then the level of point 5 should be lower than point 3.<br /> '''Search for Point 5.''' The bar following the bar of Point 3 (and in repeated applications of this step - the bar specified in this algorithm) is checked for not overcoming the level of point 3 (since N1 requirement for Algorithm II must be observed).<br /> :'''2.1.''' If the price has overcome the level of point 3, the program discards the considered step 3 (due to N1 requirement).<br /> :'''2.2.''' If N1 requirement is met for the analyzed bar, it is checked for compliance with N1 requirement as a potential point 5 (hereafter - point 5 or t.5).<br /> ::'''2.2.1.''' If the analyzed bar is not an extreme according to N1 requirement (as a potential point 5), the program checks the next bar from the beginning of step 2.<br /> ::'''2.2.2.''' If the analyzed bar is determined as an extreme according to N1 requirement (as a potential point 5), then this bar is checked for reaching (but not necessarily overcoming) the level of point 3. There are 2 options:<br /> :::'''2.2.2.1.''' If the level of point 3 is reached, the program analyzes the next bar according to this step (i.e., from the beginning of step 2).<br /> :::'''2.2.2.2.''' If the level of point 3 is not reached, the analyzed bar is a potential point 5, and the program moves to substep 2.3.<br /> :'''2.3. Search for Point 4.''' The program searches for a bar, which was the last to cross the level of the considered potential point 5. Let's denote this bar as lcb5 (line-crossing-bar-5). If lcb5 coincides with the bar of point 3, we denote the bar following lcb5 as look4. Otherwise, look4 = lcb5. The program searches for a bar with the maximum (if point 3 is low) or minimum (if point 3 is high) price in the interval from lcb5 to potential point 5. Then this bar is checked for being an extreme according to N1 requirement as a potential pont 4 (hereafter – point 4 or t.4). There are 2 options:<br /> ::'''2.3.1.''' The bar is an absolute extreme (as a potential point 4). In this case, potential point 4 is found.<br /> :::'''2.3.1.1.''' If step 2 has already been determined (this is possible when this step is triggered during the search for an alternative model), the program checks the line chart for extra points in the section from step 2 to step 4. There are 2 options:<br /> ::::'''2.3.1.1.A.''' If extra points are found, the program processes the next bar after potential point 5 according to step 2.<br /> ::::'''2.3.1.1.B.''' Extra intersections are not found; the program moves to substep 2.4.<br /> :::'''2.3.1.2.''' If substep 2.3.1. is triggered during the search for the basic model, the program moves to substep 2.4.<br /> ::'''2.3.2.''' The bar is not an absolute extreme (as a potential point 4). In this case, the program looks for another candidate for point 5 according to this step (i.e., according to step 2).<br /> If the program has processed 50 bars in a row according to this step (step 2), and the program has not moved to another step of the algorithm, then this potential point 3 is discarded.<br /> If there are 150 or more bars between potential point 3 and the analyzed bar, and potential points 4 and 5 are not found, then this potential point 3 is discarded.<br /> :'''2.4.''' Real-Time Verification of t.5 <br /> :The potential t.5 bar is checked for the presence of bars between the analyzed bar and the potential t.4 bar, which contain price values more distant (or even equally distant) from the potential t.4 than the most distant from t.4 value of the analyzed bar. This is a check of the potential t.5 for beeing the '''potential absolute extreme'''. The following options are possible:<br /> ::'''2.4.1.''' If the extreme is potentially absolute, the program proceeds to step 3.<br /> ::'''2.4.2.''' If the extreme is not potentially absolute, the program checks the next bar starting from this step (i.e., step 2).<br /> ===''' Step 3. Confirmation of Point 4. Searching for Alternative t.5 and t.5&quot; '''===<br /> The program checks whether the bar of potential t.5 has reached the level of t.4. Two scenarios are possible:<br /> :'''3.1.''' The Bar of Potential t.5 Has Reached t.4.<br /> :In this case:<br /> ::The model is built through absolute t.5.<br /> ::The t.5 bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> ::Point 4 is confirmed,<br /> ::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3 (since there is already possible to display the model through t.5 on the chart).<br /> :'''3.2.''' The Bar of Potential t.5 Has Not Reached t.4. <br /> :In this case, the program checks the next bar for reaching the level of t.4. The following options are possible:<br /> ::'''3.2.1. The Considered Bar Reaches the Level of Potential t.4. <br /> ::In this case:<br /> :::The model is built through absolute t.5.<br /> :::The considered bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> :::Point 4 is confirmed,<br /> :::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3.ext, but first goes through sub-step 3.3.<br /> ::'''3.2.2.''' The Considered Bar Does Not Reach the Level of t.4 ====<br /> ::In this case the program checks the next bar for overcoming the level of potential t.5. Two scenarios are possible:<br /> :::'''3.2.2.1.''' If the t.5 level is overcome, the analyzed bar is considered as a new potential t.5. The program processes this bar according to step 2.<br /> :::'''3.2.2.2.''' If the t.5 level is not overcome, the analyzed bar is checked for reaching the level of t.4 according to sub-step 3.2.<br /> ::In parallel (i.e., an additional branch is created), the program proceeds to sub-step 3.3 (since there is already an option to display the model through t.5 on the chart). The model in this branch receives a &quot;draw_flag&quot; label.<br /> :'''3.3.''' Construction of the Trend Line (TL). <br /> :A Trend Line (TL) is constructed from t.3 to t.5. Each bar between t.3 and t.5 is checked for breaking the TL. Two scenarios are possible:<br /> ::'''3.3.1.'''The Price Crosses the TL. <br /> ::In this case, the TL through t.3 is not constructed. The program searches for a candidate for point 3' (hereafter - t.3'). T.3' is selected in such a way that the TL' (constructed from t.3' to t.5) is not crossed by the price in the 3-5 segment. Rule No.1 for t.3' is not applied. T.3' cannot belong to the same bar as t.4. Two scenarios are possible:<br /> :::'''3.3.1.1.''' T.3' is found, this model is classified as built through t.3'. The program proceeds to step 4, or to sub-step 3.3.extended if coming from 3.2.<br /> :::'''3.3.1.2.''' T.3' is not found. In this case, the program searches for new potential t.5 and t.4 according to step 2.<br /> ::'''3.3.2.''' The Price Does Not Break the TL. <br /> ::In this case, this model is classified as built through t.3 (absolute extreme). The program proceeds to step 4, or to sub-step 3.3.ext. if coming from 3.2.</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_II&diff=186 2023-08-26T11:18:18Z

<p>Admin: Adding Step 3</p> <hr /> <div>This article is not finished<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with UMG General Concepts.<br /> <br /> ==='''Step I. Search For Point 3 of the External Attraction Model (EAM) and the Sarting Point of the Previous Trend.'''===<br /> : '''1.1.''' The program looks for the first possible extreme, satisfying Single Bar Rule. Such an extreme is a candidate for potential point 3 ( potential t.3).<br /> : '''1.2.''' Next, the program checks the bars from right to left (i.e., in the past) from the bar containing the extreme candidate for point 3 to one of the following events:<br /> :: '''1.2.1.''' Found the last intersection (breakthrough) point by the price level of the candidate for point 3.<br /> ::In this case, the report displays: <br /> :: PREVdata: FullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.2.''' The program reached the starting point of the chart (i.e., the price did not intersect the level of point 3 after the starting point of the chart).<br /> ::In this case, the report displays: <br /> :: PREVdata: NoFullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.1.''' The price checked 300 bars preceding point 3, but the level of step 3 did not intersect at this segment. The program looks for an absolute extreme (opposite to step 3) on the segment from the 300th bar before point 3 to point 3. The program proceeds to substep 1.3.<br /> : '''1.3.''' The program looks for an absolute extreme (opposite to point 3 extreme) on the segment:<br /> ::- from the last intersection by the price level of the candidate for point 3 (inclusive) (if came from 1.2.1.), or :: - from the starting point of the chart (if came from 1.2.2.), or <br /> :: - from 300 bars(if came from 1.2.3.) <br /> :: to point 3 (excluding).<br /> :: '''1.3.1.''' Absolute extreme found. The candidate for point 3 is confirmed; moreover, the found confirming extreme is the assumed (if coming from 1.2.2. or 1.2.3.) starting point of the preceding trend.'''<br /> ::The program checks for the absence of extremes equal to point 3 between the assumed starting point of the previous trend and point 3. <br /> :::'''1.3.1.1.''' If such an extreme is found, this candidate for point 3 is discarded, and this point 3 is discarded. <br /> :::'''1.3.1.2.''' If such an extreme is not found, the program proceeds to step 2.<br /> ::'''1.3.2.''' Absolute extreme not found. This point 3 is discarded.'''<br /> ::Simultaneously with step 1, the program launches the search for the next potential point 3.<br /> <br /> ==='''Step II. Search For Potentioal Points 5 and 4 ''' ===<br /> '''The Orientation rule (N1 requirement) for Algorithm II is as follows:'''<br /> If point 3 is low, then the level of point 5 should be higher than point 3. <br /> If point 3 is high, then the level of point 5 should be lower than point 3.<br /> '''Search for Point 5.''' The bar following the bar of Point 3 (and in repeated applications of this step - the bar specified in this algorithm) is checked for not overcoming the level of point 3 (since N1 requirement for Algorithm II must be observed).<br /> :'''2.1.''' If the price has overcome the level of point 3, the program discards the considered step 3 (due to N1 requirement).<br /> :'''2.2.''' If N1 requirement is met for the analyzed bar, it is checked for compliance with N1 requirement as a potential point 5 (hereafter - point 5 or t.5).<br /> ::'''2.2.1.''' If the analyzed bar is not an extreme according to N1 requirement (as a potential point 5), the program checks the next bar from the beginning of step 2.<br /> ::'''2.2.2.''' If the analyzed bar is determined as an extreme according to N1 requirement (as a potential point 5), then this bar is checked for reaching (but not necessarily overcoming) the level of point 3. There are 2 options:<br /> :::'''2.2.2.1.''' If the level of point 3 is reached, the program analyzes the next bar according to this step (i.e., from the beginning of step 2).<br /> :::'''2.2.2.2.''' If the level of point 3 is not reached, the analyzed bar is a potential point 5, and the program moves to substep 2.3.<br /> :'''2.3. Search for Point 4.''' The program searches for a bar, which was the last to cross the level of the considered potential point 5. Let's denote this bar as lcb5 (line-crossing-bar-5). If lcb5 coincides with the bar of point 3, we denote the bar following lcb5 as look4. Otherwise, look4 = lcb5. The program searches for a bar with the maximum (if point 3 is low) or minimum (if point 3 is high) price in the interval from lcb5 to potential point 5. Then this bar is checked for being an extreme according to N1 requirement as a potential pont 4 (hereafter – point 4 or t.4). There are 2 options:<br /> ::'''2.3.1.''' The bar is an absolute extreme (as a potential point 4). In this case, potential point 4 is found.<br /> :::'''2.3.1.1.''' If step 2 has already been determined (this is possible when this step is triggered during the search for an alternative model), the program checks the line chart for extra points in the section from step 2 to step 4. There are 2 options:<br /> ::::'''2.3.1.1.A.''' If extra points are found, the program processes the next bar after potential point 5 according to step 2.<br /> ::::'''2.3.1.1.B.''' Extra intersections are not found; the program moves to substep 2.4.<br /> :::'''2.3.1.2.''' If substep 2.3.1. is triggered during the search for the basic model, the program moves to substep 2.4.<br /> ::'''2.3.2.''' The bar is not an absolute extreme (as a potential point 4). In this case, the program looks for another candidate for point 5 according to this step (i.e., according to step 2).<br /> If the program has processed 50 bars in a row according to this step (step 2), and the program has not moved to another step of the algorithm, then this potential point 3 is discarded.<br /> If there are 150 or more bars between potential point 3 and the analyzed bar, and potential points 4 and 5 are not found, then this potential point 3 is discarded.<br /> :'''2.4.''' Real-Time Verification of t.5 <br /> :The potential t.5 bar is checked for the presence of bars between the analyzed bar and the potential t.4 bar, which contain price values more distant (or even equally distant) from the potential t.4 than the most distant from t.4 value of the analyzed bar. This is a check of the potential t.5 for beeing the '''potential absolute extreme'''. The following options are possible:<br /> ::'''2.4.1.''' If the extreme is potentially absolute, the program proceeds to step 3.<br /> ::'''2.4.2.''' If the extreme is not potentially absolute, the program checks the next bar starting from this step (i.e., step 2).<br /> ===''' Step 3. Confirmation of Point 4. Searching for Alternative t.5 and t.5&quot; '''===<br /> The program checks whether the bar of potential t.5 has reached the level of t.4. Two scenarios are possible:<br /> :'''3.1.''' The Bar of Potential t.5 Has Reached t.4.<br /> :In this case:<br /> ::The model is built through absolute t.5.<br /> ::The t.5 bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> ::Point 4 is confirmed,<br /> ::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3 (since there is already possible to display the model through t.5 on the chart).<br /> :'''3.2.''' The Bar of Potential t.5 Has Not Reached t.4. <br /> :In this case, the program checks the next bar for reaching the level of t.4. The following options are possible:<br /> ::'''3.2.1. The Considered Bar Reaches the Level of Potential t.4. <br /> ::In this case:<br /> :::The model is built through absolute t.5.<br /> :::The considered bar confirms t.4. The presence of a bar confirming t.4 indicates that:<br /> :::Point 4 is confirmed,<br /> :::Point 5 is confirmed.<br /> ::The program proceeds to sub-step 3.3 extended, but first goes through sub-step 3.3.<br /> ::'''3.2.2.''' The Considered Bar Does Not Reach the Level of t.4 ====<br /> ::In this case the program checks the next bar for overcoming the level of potential t.5. Two scenarios are possible:<br /> :::'''3.2.2.1.''' If the t.5 level is overcome, the analyzed bar is considered as a new potential t.5. The program processes this bar according to step 2.<br /> :::'''3.2.2.2.''' If the t.5 level is not overcome, the analyzed bar is checked for reaching the level of t.4 according to sub-step 3.2.<br /> ::In parallel (i.e., an additional branch is created), the program proceeds to sub-step 3.3 (since there is already an option to display the model through t.5 on the chart). The model in this branch receives a &quot;draw_flag&quot; label.<br /> :'''3.3.''' Construction of the Trend Line (TL). <br /> :A Trend Line (TL) is constructed from t.3 to t.5. Each bar between t.3 and t.5 is checked for breaking the TL. Two scenarios are possible:<br /> ::'''3.3.1.'''The Price Crosses the TL. <br /> ::In this case, the TL through t.3 is not constructed. The program searches for a candidate for point 3' (hereafter - t.3'). T.3' is selected in such a way that the TL' (constructed from t.3' to t.5) is not crossed by the price in the 3-5 segment. Rule No.1 for t.3' is not applied. T.3' cannot belong to the same bar as t.4. Two scenarios are possible:<br /> :::'''3.3.1.1.''' T.3' is found, this model is classified as built through t.3'. The program proceeds to step 4, or to sub-step 3.3.extended if coming from 3.2.<br /> :::'''3.3.1.2.''' T.3' is not found. In this case, the program searches for new potential t.5 and t.4 according to step 2.<br /> ::'''3.3.2.''' The Price Does Not Break the TL. <br /> ::In this case, this model is classified as built through t.3 (absolute extreme). The program proceeds to step 4, or to sub-step 3.3.extended if coming from 3.2.</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_II&diff=185 2023-08-26T06:38:30Z

<p>Admin: </p> <hr /> <div>This article is not finished<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with UMG General Concepts.<br /> <br /> ==='''Step I. Search For Point 3 of the External Attraction Model (EAM) and the Sarting Point of the Previous Trend.'''===<br /> : '''1.1.''' The program looks for the first possible extreme, satisfying Single Bar Rule. Such an extreme is a candidate for potential point 3 ( potential t.3).<br /> : '''1.2.''' Next, the program checks the bars from right to left (i.e., in the past) from the bar containing the extreme candidate for point 3 to one of the following events:<br /> :: '''1.2.1.''' Found the last intersection (breakthrough) point by the price level of the candidate for point 3.<br /> ::In this case, the report displays: <br /> :: PREVdata: FullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.2.''' The program reached the starting point of the chart (i.e., the price did not intersect the level of point 3 after the starting point of the chart).<br /> ::In this case, the report displays: <br /> :: PREVdata: NoFullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.1.''' The price checked 300 bars preceding point 3, but the level of step 3 did not intersect at this segment. The program looks for an absolute extreme (opposite to step 3) on the segment from the 300th bar before point 3 to point 3. The program proceeds to substep 1.3.<br /> : '''1.3.''' The program looks for an absolute extreme (opposite to point 3 extreme) on the segment:<br /> ::- from the last intersection by the price level of the candidate for point 3 (inclusive) (if came from 1.2.1.), or :: - from the starting point of the chart (if came from 1.2.2.), or <br /> :: - from 300 bars(if came from 1.2.3.) <br /> :: to point 3 (excluding).<br /> :: '''1.3.1.''' Absolute extreme found. The candidate for point 3 is confirmed; moreover, the found confirming extreme is the assumed (if coming from 1.2.2. or 1.2.3.) starting point of the preceding trend.'''<br /> ::The program checks for the absence of extremes equal to point 3 between the assumed starting point of the previous trend and point 3. <br /> :::'''1.3.1.1.''' If such an extreme is found, this candidate for point 3 is discarded, and this point 3 is discarded. <br /> :::'''1.3.1.2.''' If such an extreme is not found, the program proceeds to step 2.<br /> ::'''1.3.2.''' Absolute extreme not found. This point 3 is discarded.'''<br /> ::Simultaneously with step 1, the program launches the search for the next potential point 3.<br /> <br /> <br /> ==='''Step II. Search For Potentioal Points 5 and 4 ''' ===<br /> '''The Orientation rule (N1 requirement) for Algorithm II is as follows:'''<br /> If point 3 is low, then the level of point 5 should be higher than point 3. <br /> If point 3 is high, then the level of point 5 should be lower than point 3.<br /> '''Search for Point 5.''' The bar following the bar of Point 3 (and in repeated applications of this step - the bar specified in this algorithm) is checked for not overcoming the level of point 3 (since N1 requirement for Algorithm II must be observed).<br /> : '''2.1.''' If the price has overcome the level of point 3, the program discards the considered step 3 (due to N1 requirement).<br /> :: '''2.2.''' If N1 requirement is met for the analyzed bar, it is checked for compliance with N1 requirement as a potential point 5 (hereafter - point 5 or t.5).<br /> :: '''2.2.1.''' If the analyzed bar is not an extreme according to N1 requirement (as a potential point 5), the program checks the next bar from the beginning of step 2.<br /> :: '''2.2.2.''' If the analyzed bar is determined as an extreme according to N1 requirement (as a potential point 5), then this bar is checked for reaching (but not necessarily overcoming) the level of point 3. There are 2 options:<br /> ::: '''2.2.2.1.''' If the level of point 3 is reached, the program analyzes the next bar according to this step (i.e., from the beginning of step 2).<br /> ::: '''2.2.2.2.''' If the level of point 3 is not reached, the analyzed bar is a potential point 5, and the program moves to substep 2.3.<br /> :'''2.3. Search for Point 4.''' The program searches for a bar, which was the last to cross the level of the considered potential point 5. Let's denote this bar as lcb5 (line-crossing-bar-5). If lcb5 coincides with the bar of point 3, we denote the bar following lcb5 as look4. Otherwise, look4 = lcb5. The program searches for a bar with the maximum (if point 3 is low) or minimum (if point 3 is high) price in the interval from lcb5 to potential point 5. Then this bar is checked for being an extreme according to N1 requirement as a potential pont 4 (hereafter – point 4 or t.4). There are 2 options:<br /> :: '''2.3.1.''' The bar is an absolute extreme (as a potential point 4). In this case, potential point 4 is found.<br /> ::: '''2.3.1.1.''' If step 2 has already been determined (this is possible when this step is triggered during the search for an alternative model), the program checks the line chart for extra points in the section from step 2 to step 4. There are 2 options:<br /> :::: '''2.3.1.1.A.''' If extra points are found, the program processes the next bar after potential point 5 according to step 2.<br /> :::: '''2.3.1.1.B.''' Extra intersections are not found; the program moves to substep 2.4.<br /> ::: '''2.3.1.2.''' If substep 2.3.1. is triggered during the search for the basic model, the program moves to substep 2.4.<br /> :: '''2.3.2.''' The bar is not an absolute extreme (as a potential point 4). In this case, the program looks for another candidate for point 5 according to this step (i.e., according to step 2).<br /> If the program has processed 50 bars in a row according to this step (step 2), and the program has not moved to another step of the algorithm, then this potential point 3 is discarded.<br /> <br /> If there are 150 or more bars between potential point 3 and the analyzed bar, and potential points 4 and 5 are not found, then this potential point 3 is discarded.<br /> <br /> : '''2.4.''' Real-Time Verification of t.5 <br /> <br /> :The potential t.5 bar is checked for the presence of bars between the analyzed bar and the potential t.4 bar, which contain price values more distant (or even equally distant) from the potential t.4 than the most distant from t.4 value of the analyzed bar. This is a check of the potential t.5 for beeing the '''potential absolute extreme'''. The following options are possible:<br /> <br /> :: '''2.4.1.''' If the extreme is potentially absolute, the program proceeds to step 3.<br /> <br /> :: '''2.4.2.''' If the extreme is not potentially absolute, the program checks the next bar starting from this step (i.e., step 2).</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_II&diff=184 2023-08-26T06:36:16Z

<p>Admin: </p> <hr /> <div>This article is not finished<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with UMG General Concepts.<br /> <br /> ==='''Step I. Search For Point 3 of the External Attraction Model (EAM) and the Sarting Point of the Previous Trend.'''===<br /> : '''1.1.''' The program looks for the first possible extreme, satisfying Single Bar Rule. Such an extreme is a candidate for potential point 3 ( potential t.3).<br /> : '''1.2.''' Next, the program checks the bars from right to left (i.e., in the past) from the bar containing the extreme candidate for point 3 to one of the following events:<br /> :: '''1.2.1.''' Found the last intersection (breakthrough) point by the price level of the candidate for point 3.<br /> ::In this case, the report displays: <br /> :: PREVdata: FullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.2.''' The program reached the starting point of the chart (i.e., the price did not intersect the level of point 3 after the starting point of the chart).<br /> ::In this case, the report displays: <br /> :: PREVdata: NoFullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.1.''' The price checked 300 bars preceding point 3, but the level of step 3 did not intersect at this segment. The program looks for an absolute extreme (opposite to step 3) on the segment from the 300th bar before point 3 to point 3. The program proceeds to substep 1.3.<br /> : '''1.3.''' The program looks for an absolute extreme (opposite to point 3 extreme) on the segment:<br /> ::- from the last intersection by the price level of the candidate for point 3 (inclusive) (if came from 1.2.1.), or :: - from the starting point of the chart (if came from 1.2.2.), or <br /> :: - from 300 bars(if came from 1.2.3.) <br /> :: to point 3 (excluding).<br /> :: '''1.3.1.''' Absolute extreme found. The candidate for point 3 is confirmed; moreover, the found confirming extreme is the assumed (if coming from 1.2.2. or 1.2.3.) starting point of the preceding trend.'''<br /> ::The program checks for the absence of extremes equal to point 3 between the assumed starting point of the previous trend and point 3. <br /> :::'''1.3.1.1.''' If such an extreme is found, this candidate for point 3 is discarded, and this point 3 is discarded. <br /> :::'''1.3.1.2.''' If such an extreme is not found, the program proceeds to step 2.<br /> ::'''1.3.2.''' Absolute extreme not found. This point 3 is discarded.'''<br /> ::Simultaneously with step 1, the program launches the search for the next potential point 3.<br /> <br /> <br /> ==='''Step II. Search For Potentioal Points 5 and 4 ''' ===<br /> '''The Orientation rule (N1 requirement) for Algorithm II is as follows:'''<br /> If point 3 is low, then the level of point 5 should be higher than point 3. <br /> If point 3 is high, then the level of point 5 should be lower than point 3.<br /> '''Search for Point 5.''' The bar following the bar of Point 3 (and in repeated applications of this step - the bar specified in this algorithm) is checked for not overcoming the level of point 3 (since N1 requirement for Algorithm II must be observed).<br /> : '''2.1.''' If the price has overcome the level of point 3, the program discards the considered step 3 (due to N1 requirement).<br /> :: '''2.2.''' If N1 requirement is met for the analyzed bar, it is checked for compliance with N1 requirement as a potential point 5 (hereafter - point 5 or t.5).<br /> :: '''2.2.1.''' If the analyzed bar is not an extreme according to N1 requirement (as a potential point 5), the program checks the next bar from the beginning of step 2.<br /> :: '''2.2.2.''' If the analyzed bar is determined as an extreme according to N1 requirement (as a potential point 5), then this bar is checked for reaching (but not necessarily overcoming) the level of point 3. There are 2 options:<br /> ::: '''2.2.2.1.''' If the level of point 3 is reached, the program analyzes the next bar according to this step (i.e., from the beginning of step 2).<br /> ::: '''2.2.2.2.''' If the level of point 3 is not reached, the analyzed bar is a potential point 5, and the program moves to substep 2.3.<br /> '''2.3. Search for Point 4.''' The program searches for a bar, which was the last to cross the level of the considered potential point 5. Let's denote this bar as lcb5 (line-crossing-bar-5). If lcb5 coincides with the bar of point 3, we denote the bar following lcb5 as look4. Otherwise, look4 = lcb5. The program searches for a bar with the maximum (if point 3 is low) or minimum (if point 3 is high) price in the interval from lcb5 to potential point 5. Then this bar is checked for being an extreme according to N1 requirement as a potential pont 4 (hereafter – point 4 or t.4). There are 2 options:<br /> :: '''2.3.1.''' The bar is an absolute extreme (as a potential point 4). In this case, potential point 4 is found.<br /> ::: '''2.3.1.1.''' If step 2 has already been determined (this is possible when this step is triggered during the search for an alternative model), the program checks the line chart for extra points in the section from step 2 to step 4. There are 2 options:<br /> :::: '''2.3.1.1.A.''' If extra points are found, the program processes the next bar after potential point 5 according to step 2.<br /> :::: '''2.3.1.1.B.''' Extra intersections are not found; the program moves to substep 2.4.<br /> ::: '''2.3.1.2.''' If substep 2.3.1. is triggered during the search for the basic model, the program moves to substep 2.4.<br /> :: '''2.3.2.''' The bar is not an absolute extreme (as a potential point 4). In this case, the program looks for another candidate for point 5 according to this step (i.e., according to step 2).<br /> If the program has processed 50 bars in a row according to this step (step 2), and the program has not moved to another step of the algorithm, then this potential point 3 is discarded.<br /> <br /> If there are 150 or more bars between potential point 3 and the analyzed bar, and potential points 4 and 5 are not found, then this potential point 3 is discarded.<br /> <br /> : '''2.4.''' Real-Time Verification of t.5 <br /> <br /> The potential t.5 bar is checked for the presence of bars between the analyzed bar and the potential t.4 bar, which contain price values more distant (as well as equally distant ones) from the potential t.4 than the most distant from t.4 value of the analyzed bar. This is a check of the potential t.5 for beeing the potential absolute extreme. The following options are possible:<br /> <br /> :: '''2.4.1.''' If the extreme is potentially absolute, the program proceeds to step 3.<br /> <br /> :: '''2.4.2.''' If the extreme is not potentially absolute, the program checks the next bar starting from this step (i.e., step 2).</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_II&diff=183 2023-08-26T06:30:13Z

<p>Admin: </p> <hr /> <div>This article is not finished<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with UMG General Concepts.<br /> <br /> ==='''Step I. Search For Point 3 of the External Attraction Model (EAM) and the Sarting Point of the Previous Trend.'''===<br /> : '''1.1.''' The program looks for the first possible extreme, satisfying Single Bar Rule. Such an extreme is a candidate for potential point 3 ( potential t.3).<br /> : '''1.2.''' Next, the program checks the bars from right to left (i.e., in the past) from the bar containing the extreme candidate for point 3 to one of the following events:<br /> :: '''1.2.1.''' Found the last intersection (breakthrough) point by the price level of the candidate for point 3.<br /> ::In this case, the report displays: <br /> :: PREVdata: FullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.2.''' The program reached the starting point of the chart (i.e., the price did not intersect the level of point 3 after the starting point of the chart).<br /> ::In this case, the report displays: <br /> :: PREVdata: NoFullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.1.''' The price checked 300 bars preceding point 3, but the level of step 3 did not intersect at this segment. The program looks for an absolute extreme (opposite to step 3) on the segment from the 300th bar before point 3 to point 3. The program proceeds to substep 1.3.<br /> : '''1.3.''' The program looks for an absolute extreme (opposite to point 3 extreme) on the segment:<br /> ::- from the last intersection by the price level of the candidate for point 3 (inclusive) (if came from 1.2.1.), or :: - from the starting point of the chart (if came from 1.2.2.), or <br /> :: - from 300 bars(if came from 1.2.3.) <br /> :: to point 3 (excluding).<br /> :: '''1.3.1.''' Absolute extreme found. The candidate for point 3 is confirmed; moreover, the found confirming extreme is the assumed (if coming from 1.2.2. or 1.2.3.) starting point of the preceding trend.'''<br /> ::The program checks for the absence of extremes equal to point 3 between the assumed starting point of the previous trend and point 3. <br /> :::'''1.3.1.1.''' If such an extreme is found, this candidate for point 3 is discarded, and this point 3 is discarded. <br /> :::'''1.3.1.2.''' If such an extreme is not found, the program proceeds to step 2.<br /> ::'''1.3.2.''' Absolute extreme not found. This point 3 is discarded.'''<br /> ::Simultaneously with step 1, the program launches the search for the next potential point 3.<br /> <br /> <br /> ==='''Step II. Search For Potentioal Points 5 and 4 ''' ===<br /> '''The Orientation rule (N1 requirement) for Algorithm II is as follows:'''<br /> If point 3 is low, then the level of point 5 should be higher than point 3. <br /> If point 3 is high, then the level of point 5 should be lower than point 3.<br /> '''Search for Point 5.''' The bar following the bar of Point 3 (and in repeated applications of this step - the bar specified in this algorithm) is checked for not overcoming the level of point 3 (since N1 requirement for Algorithm II must be observed).<br /> : '''2.1.''' If the price has overcome the level of point 3, the program discards the considered step 3 (due to N1 requirement).<br /> :: '''2.2.''' If N1 requirement is met for the analyzed bar, it is checked for compliance with N1 requirement as a potential point 5 (hereafter - point 5 or t.5).<br /> :: '''2.2.1.''' If the analyzed bar is not an extreme according to N1 requirement (as a potential point 5), the program checks the next bar from the beginning of step 2.<br /> :: '''2.2.2.''' If the analyzed bar is determined as an extreme according to N1 requirement (as a potential point 5), then this bar is checked for reaching (but not necessarily overcoming) the level of point 3. There are 2 options:<br /> ::: '''2.2.2.1.''' If the level of point 3 is reached, the program analyzes the next bar according to this step (i.e., from the beginning of step 2).<br /> ::: '''2.2.2.2.''' If the level of point 3 is not reached, the analyzed bar is a potential point 5, and the program moves to substep 2.3.<br /> '''2.3. Search for Point 4.''' The program searches for a bar, which was the last to cross the level of the considered potential point 5. Let's denote this bar as lcb5 (line-crossing-bar-5). If lcb5 coincides with the bar of point 3, we denote the bar following lcb5 as look4. Otherwise, look4 = lcb5. The program searches for a bar with the maximum (if point 3 is low) or minimum (if point 3 is high) price in the interval from lcb5 to potential point 5. Then this bar is checked for being an extreme according to N1 requirement as a potential pont 4 (hereafter – point 4 or t.4). There are 2 options:<br /> :: '''2.3.1.''' The bar is an absolute extreme (as a potential point 4). In this case, potential point 4 is found.<br /> ::: '''2.3.1.1.''' If step 2 has already been determined (this is possible when this step is triggered during the search for an alternative model), the program checks the line chart for extra points in the section from step 2 to step 4. There are 2 options:<br /> :::: '''2.3.1.1.A.''' If extra points are found, the program processes the next bar after potential point 5 according to step 2.<br /> :::: '''2.3.1.1.B.''' Extra intersections are not found; the program moves to substep 2.4.<br /> ::: '''2.3.1.2.''' If substep 2.3.1. is triggered during the search for the basic model, the program moves to substep 2.4.<br /> :: '''2.3.2.''' The bar is not an absolute extreme (as a potential point 4). In this case, the program looks for another candidate for point 5 according to this step (i.e., according to step 2).<br /> If the program has processed 50 bars in a row according to this step (step 2), and the program has not moved to another step of the algorithm, then this potential point 3 is discarded.<br /> <br /> If there are 150 or more bars between potential point 3 and the analyzed bar, and potential points 4 and 5 are not found, then this potential point 3 is discarded.<br /> <br /> : '''2.4.''' Real-Time Verification of t.5 <br /> <br /> The potential t.5 bar is checked for the presence of bars between the analyzed bar and the potential t.4 bar, which contain price values further away from the potential t.4 than the most distant value from t.4 in the analyzed bar (as well as equally distant ones). This is a check for the potential extreme nature of the potential t.5. The following options are possible:<br /> <br /> :: '''2.4.1.''' If the extreme is potentially absolute, the program proceeds to step 3.<br /> <br /> :: '''2.4.2.''' If the extreme is not potentially absolute, the program checks the next bar starting from this step (i.e., step 2).</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_II&diff=182 2023-08-26T06:29:21Z

<p>Admin: </p> <hr /> <div>This article is not finished<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with UMG General Concepts.<br /> <br /> ==='''Step I. Search For Point 3 of the External Attraction Model (EAM) and the Sarting Point of the Previous Trend.'''===<br /> : '''1.1.''' The program looks for the first possible extreme, satisfying Single Bar Rule. Such an extreme is a candidate for potential point 3 ( potential t.3).<br /> : '''1.2.''' Next, the program checks the bars from right to left (i.e., in the past) from the bar containing the extreme candidate for point 3 to one of the following events:<br /> :: '''1.2.1.''' Found the last intersection (breakthrough) point by the price level of the candidate for point 3.<br /> ::In this case, the report displays: <br /> :: PREVdata: FullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.2.''' The program reached the starting point of the chart (i.e., the price did not intersect the level of point 3 after the starting point of the chart).<br /> ::In this case, the report displays: <br /> :: PREVdata: NoFullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.1.''' The price checked 300 bars preceding point 3, but the level of step 3 did not intersect at this segment. The program looks for an absolute extreme (opposite to step 3) on the segment from the 300th bar before point 3 to point 3. The program proceeds to substep 1.3.<br /> : '''1.3.''' The program looks for an absolute extreme (opposite to point 3 extreme) on the segment:<br /> ::- from the last intersection by the price level of the candidate for point 3 (inclusive) (if came from 1.2.1.), or :: - from the starting point of the chart (if came from 1.2.2.), or <br /> :: - from 300 bars(if came from 1.2.3.) <br /> :: to point 3 (excluding).<br /> :: '''1.3.1.''' Absolute extreme found. The candidate for point 3 is confirmed; moreover, the found confirming extreme is the assumed (if coming from 1.2.2. or 1.2.3.) starting point of the preceding trend.'''<br /> ::The program checks for the absence of extremes equal to point 3 between the assumed starting point of the previous trend and point 3. <br /> :::'''1.3.1.1.''' If such an extreme is found, this candidate for point 3 is discarded, and this point 3 is discarded. <br /> :::'''1.3.1.2.''' If such an extreme is not found, the program proceeds to step 2.<br /> ::'''1.3.2.''' Absolute extreme not found. This point 3 is discarded.'''<br /> ::Simultaneously with step 1, the program launches the search for the next potential point 3.<br /> <br /> <br /> ==='''Step II. Search For Potentioal Points 5 and 4 ''' ===<br /> '''The Orientation rule (N1 requirement) for Algorithm II is as follows:'''<br /> If point 3 is low, then the level of point 5 should be higher than point 3. <br /> If point 3 is high, then the level of point 5 should be lower than point 3.<br /> '''Search for Point 5.''' The bar following the bar of Point 3 (and in repeated applications of this step - the bar specified in this algorithm) is checked for not overcoming the level of point 3 (since N1 requirement for Algorithm II must be observed).<br /> : '''2.1.''' If the price has overcome the level of point 3, the program discards the considered step 3 (due to N1 requirement).<br /> :: '''2.2.''' If N1 requirement is met for the analyzed bar, it is checked for compliance with N1 requirement as a potential point 5 (hereafter - point 5 or t.5).<br /> :: '''2.2.1.''' If the analyzed bar is not an extreme according to N1 requirement (as a potential point 5), the program checks the next bar from the beginning of step 2.<br /> :: '''2.2.2.''' If the analyzed bar is determined as an extreme according to N1 requirement (as a potential point 5), then this bar is checked for reaching (but not necessarily overcoming) the level of point 3. There are 2 options:<br /> ::: '''2.2.2.1.''' If the level of point 3 is reached, the program analyzes the next bar according to this step (i.e., from the beginning of step 2).<br /> ::: '''2.2.2.2.''' If the level of point 3 is not reached, the analyzed bar is a potential point 5, and the program moves to substep 2.3.<br /> '''2.3. Search for Point 4.''' The program searches for a bar, which was the last to cross the level of the considered potential point 5. Let's denote this bar as lcb5 (line-crossing-bar-5). If lcb5 coincides with the bar of point 3, we denote the bar following lcb5 as look4. Otherwise, look4 = lcb5. The program searches for a bar with the maximum (if point 3 is low) or minimum (if point 3 is high) price in the interval from lcb5 to potential point 5. Then this bar is checked for being an extreme according to N1 requirement as a potential pont 4 (hereafter – point 4 or t.4). There are 2 options:<br /> :: '''2.3.1.''' The bar is an absolute extreme (as a potential point 4). In this case, potential point 4 is found.<br /> ::: '''2.3.1.1.''' If step 2 has already been determined (this is possible when this step is triggered during the search for an alternative model), the program checks the line chart for extra points in the section from step 2 to step 4. There are 2 options:<br /> :::: '''2.3.1.1.A.''' If extra points are found, the program processes the next bar after potential point 5 according to step 2.<br /> :::: '''2.3.1.1.B.''' Extra intersections are not found; the program moves to substep 2.4.<br /> ::: '''2.3.1.2.''' If substep 2.3.1. is triggered during the search for the basic model, the program moves to substep 2.4.<br /> :: '''2.3.2.''' The bar is not an absolute extreme (as a potential point 4). In this case, the program looks for another candidate for point 5 according to this step (i.e., according to step 2).<br /> If the program has processed 50 bars in a row according to this step (step 2), and the program has not moved to another step of the algorithm, then this potential point 3 is discarded.<br /> <br /> If there are 150 or more bars between potential point 3 and the analyzed bar, and potential points 4 and 5 are not found, then this potential point 3 is discarded.<br /> <br /> : 2.4. Real-Time Verification of t.5 <br /> <br /> The potential t.5 bar is checked for the presence of bars between the analyzed bar and the potential t.4 bar, which contain price values further away from the potential t.4 than the most distant value from t.4 in the analyzed bar (as well as equally distant ones). This is a check for the potential extreme nature of the potential t.5. The following options are possible:<br /> <br /> :: 2.4.1. If the extreme is potentially absolute, the program proceeds to step 3.<br /> <br /> :: 2.4.2. If the extreme is not potentially absolute, the program checks the next bar starting from this step (i.e., step 2).</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_I&diff=181 2023-08-25T20:20:07Z

<p>Admin: </p> <hr /> <div> '''The Orientaion rule (N1 requirement) for Algorithm I is as follows:'''<br /> If point 1 is low, then the level of point 3 should be equal to or higher than point 1. <br /> If point 1 is high, then the level of point 3 should be equal to or lower than point 1.<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with [[UMG General Concepts]].<br /> <br /> <br /> ==='''Step I. Find Point 1. Search for a Confirming Extreme.'''===<br /> : '''1.1.''' The program searches for the first possible extreme that satisfies Single Bar Rule. This extreme is a candidate for point 1.<br /> : '''1.2.''' When a candidate for point 1 (hereinafter referred to as t.1 candifate) is found, all bars to the left (i.e., in the past) of the bar containing the t.1 candidate extreme are checked until one of the following events occurs:<br /> :: '''1.2.1.''' The place of the last intersection of the price level of the t.1 candidate is found &lt;ref&gt;High or low equal to high or low of t.1 is an intersection&lt;/ref&gt;. In this case, the program searches for an absolute extreme that confirms point 1 from the intersection of the price with the t.1 candidate level (inclusive) to the bar of t.1 candidate (exclusive). There are two possibilities:<br /> ::: '''1.2.1.1.''' If the extreme is not found, the program searches for a new candidate for point 1.<br /> ::: '''1.2.1.2.''' If the absolute extreme is found, it is the beginning of the preceding trend. The point 1 is confirmed. <br /> ::: The program checks for the absence of extremes equal to point 1 from the Beginning of the preceding trend. <br /> :::: '''1.2.1.2.1.''' If such an extreme is found, this candidate for point 1 is discarded (the program continues to process other t.1 candidates).<br /> :::: '''1.2.1.2.2.''' If such an extreme is not found, the program proceeds to process the next bar after point 1 according to point 2 of the Algorithm.<br /> :: '''1.2.2.''' The program has reached the starting point of the chart (i.e., after the starting point of the chart, the levels of points 1 and 2 have never intersected). The program searches for a confirming extreme from right to left to the starting point of the chart. The options are similar to the sub-steps 1.2.1.1. and 1.2.1.2.<br /> :: '''1.2.3.''' The program has checked 50 bars &lt;ref&gt;The depth of the search for the extreme confirming point 1&lt;/ref&gt; preceding the bar of the potential point 1, and none of the above events have occurred. The program searches for a confirming extreme from right to left in the area of 50 bars before the potential point 1. The options are similar to the sub-steps 1.2.1.1. and 1.2.1.2.<br /> <br /> ==='''Step II. Searching for Points 3 and 2.'''===<br /> If the program returns to this step during the construction of an alternative model, this branch of the algorithm stops.<br /> <br /> The bar being analyzed after point 1 (or in cases of repeated application of the step specified in the algorithm) is checked for non-exceedance of the level of point 1.<br /> : '''2.1.''' If the level of point 1 is exceeded, the program discards this point 1.<br /> : '''2.2. Searching for Point 3.''' If the level of point 1 is not exceeded, the bar being analyzed is checked by rule N1 as an extreme.<br /> :: '''2.2.1.''' If this bar is not an extreme according to rule N1 (as a potential point 3)&lt;ref&gt; Here and further under the formulation (as a potential T.3) a reminder is implied that this extremum should be aligned with the potential T.1. (see the Rule of alternating extremes).&lt;/ref&gt;, the program checks the next bar in accordance with step 2.<br /> :: '''2.2.2.''' If this bar is an extreme according to rule N1 (as a potential point 3), then<br /> ::: '''2.2.2.1.''' If this step (step 2) is applied again after confirmed candidates for point 3 have been found (i.e., such point 3, for which there is a point 2 between point 3 and point 1), but for one reason or another they were rejected, and the algorithm returned to the search for point 3, then the exceedance of the level of the previous candidate for point 3 by this extreme is checked.<br /> :::: '''2.2.2.1.A.''' If the check is not passed (i.e., if the level of the previous candidate for point 3 is not exceeded), then the program processes the next bar in accordance with this step (step 2) and further according to the algorithm.<br /> :::: '''2.2.2.1.B.''' If the check is passed, then the program proceeds to sub-step 2.2.2.2.<br /> ::: '''2.2.2.2. Searching for Point 2.''' The program searches for an absolute minimum (if point 1 and point 3 are high) or maximum (if point 1 and point 3 are low) in the range from point 1 to point 3 (hereinafter segment 1-3) as point 2 (hereinafter point 2). Then this bar is checked for &quot;extremity&quot; according to N1 rule. Two variants are possible &lt;ref&gt;As part of this particular check, it should be noted that bars T.1 and T.3 should not reach the level of T.2&lt;/ref&gt;:<br /> :::: '''2.2.2.2.A.''' If the bar is an extreme, then this is a potential point 2, and the potential point 3 becomes a confirmed point 3. In this case, the program proceeds to step 3.<br /> :::: '''2.2.2.2.B.''' The bar is not an extreme. In this case, the program begins to search for another candidate for point 3, for which it returns to the beginning of step 2.<br /> <br /> If the program has processed 50 bars &lt;ref&gt;The range of continuous search is t.3 in one iteration for all models except EAM&lt;/ref&gt; in a row in accordance with this step (step 2), and potential points 2 and 3 have not been found (i.e., the program has not yet moved to another step of the algorithm), then this potential point 1 is discarded.<br /> <br /> If there are 150 or more bars &lt;ref&gt;Maximum search range t3 for all models except EAM&lt;/ref&gt; between the potential point 1 and the bar being analyzed, and the program has not yet moved to another step of the algorithm, this potential point 1 is discarded.<br /> <br /> ==='''Step III. Building TL. Search for t.4'''===<br /> : '''3.1. Checking for Fragmentation of the Base:''' After finding candidates for points 1, 2, and 3, a check is performed for the fragmentation of the Base. This means that there should be no extremes, co-directed with t.1, between the levels of t.1 and t.3 (Extremes that Fragment the Base, hereinafter referred to as EFB).<br /> <br /> :: '''3.1.1:''' If such extremes are present, the program checks each EFB for the presence of a confirming counter-directed extreme on the section from the last intersection of the price level of the EFB to the EFB (analogous to the search for a confirming extreme of a potential t.1 in sub-step 1.2.1). If the EFB does not have a confirming extreme, then such an EFB is no longer considered (i.e., if there are no EFBs with confirming extremes, then the check is passed). If there is at least 1 EFB with a confirming extreme, then:<br /> :: - The Base is fragmented;<br /> :: - The confirmed t.3 becomes a cancelled t.3;<br /> :: The program searches for a new t.3, for which it processes the next bar after the bar of the last cancelled t.3 according to step 2 of the algorithm.<br /> :: '''3.1.2:''' If the check is successful and no EFBs are found (including if there are no confirmed EFBs), then the program proceeds to sub-step 3.2.<br /> <br /> <br /> :'''3.2. Building and Checking TL on the 1-3 Section'''<br /> : '''Determining the Section on Which t.3' Can Be Found'''<br /> : '''Searching for t.3'.'''<br /> :The parameters of the Trend Line passing through t.1 and t.3 (hereinafter TL) are calculated. TL is checked for breakthroughs on the 1-3 section.<br /> :: '''3.2.1.''' TL is Broken<br /> :: The bar of the confirmed t.3 is checked for breaking the level of t.2.<br /> ::: '''3.2.1.1.''' If the level of t.2 is broken by the bar of the confirmed t.3, the confirmed t.3 becomes a cancelled t.3. The program searches for a new t.3. To do this, the bar that broke the level of t.2 is processed according to sub-step 3.4.<br /> ::: '''3.2.1.2.''' If the level of t.2 is not broken by the bar of the confirmed t.3, then the next bar is processed according to sub-step 3.2.3.<br /> :: '''3.2.2.''' TL is Not Broken - the bar following the bar of the confirmed t.3 is processed according to sub-step 3.3.<br /> <br /> ::'''3.2.3. Determining the Section on Which t.3' Can Be Found'''<br /> ::The analyzed bar is checked for breaking the level of the confirmed t.3.<br /> ::: '''3.2.3.1.''' If the level of the confirmed t.3 is broken, the confirmed t.3 becomes a cancelled t.3. The program searches for a new t.3. For this, the bar that broke the level of the confirmed t.3 is processed according to step 2 and further according to the algorithm.<br /> ::: '''3.2.3.2.''' If the level of t.3 is not broken, the program checks the analyzed bar for breaking the level of t.2.<br /> :::: '''3.2.3.2.1.''' If the level of t.2 is not broken, the program analyzes the next bar according to sub-step 3.2.3.<br /> :::: '''3.2.3.2.2. Searching for t.3'.'''<br /> :::: If it breaks the level of t.2, then the program looks for such a point 3' (hereinafter t.3') through which a line can be drawn from t.1 to t.3', which will not contain extra touches by the price on the section from the bar of t.1 to the bar following the bar of t.3' (inclusive), and this line should not contain extra breakthroughs (not touches) by the price on the section to the bar that broke the level of t.2 (not inclusive).<br /> ::::: '''3.2.3.2.2.A.''' If t.3' is found, then the TL is rebuilt through t.3' (i.e., TL is now the line from t.1 to t.3'), and the algorithm searches for a potential t.4, for which it processes the bar that broke the level of t.2 (but if the bar that broke the level of t.2 coincides with the bar of t.3', then the program immediately proceeds to process the next bar) according to sub-step 3.4.<br /> ::::: '''3.2.3.2.2.B.''' If the point t.3' is not found, then the confirmed t.3 becomes a cancelled t.3. The program searches for a new t.3, for which it processes each previously unprocessed bar for the cancelled t.3 according to step 2 and further according to the algorithm. <br /> <br /> : If between t.1 and the analyzed bar there are 150 or more bars, and the program has not yet moved to another step of the algorithm, this potential t.1 is discarded.<br /> <br /> :'''3.3. Checking TL on the Section After t.3.'''<br /> : The analyzed bar is checked for overcoming TL.<br /> :: '''3.3.1. TL is not overcome''' - the analyzed bar is processed according to sub-step 3.4.<br /> :: '''3.3.2. TL is overcome.''' In this case, there are 2 options:<br /> ::: '''3.3.2.1.''' If between the analyzed bar (not inclusive) and the bar of t.3 (inclusive) the level of t.2 was not reached, the program performs a search for t.3', for which it moves to sub-step 3.2.3.<br /> ::: '''3.3.2.2.''' If between the analyzed bar (not inclusive) and the bar of t.3 (inclusive) the level of t.2 was reached, the program performs a search for a new candidate for t.3. For this, the analyzed bar is processed according to step 2 and further according to the algorithm.<br /> <br /> :'''3.4: Searching for Potential or Alternative t.4'''<br /> : If the program is searching for t.4 and the analyzed bar is further from t.1 than 5 times the distance between t.1 and t.3, then this potential t.1 is discarded.<br /> : If the program is searching for an alternative t.4 and the analyzed bar is further from t.1 than 10 times the number of bars between t.1 and t.3, then the search for an alternative t.4 is terminated.<br /> : The analyzed bar is checked for being an extreme according to rule N1 (as a potential t.4).<br /> <br /> ::'''Step 3.4.1: If the Bar is not an Extreme'''<br /> :: The program checks the analyzed bar for breaking through (in this case, not touching) the TL.<br /> ::: '''Step 3.4.1.1:''' If the TL is not reached (not broken), then the program processes the next bar according to step 3.4.<br /> ::: '''Step 3.4.1.2:''' If the TL is broken, then the analyzed bar is processed similarly to step 3.3.2.<br /> <br /> ::'''Step 3.4.2: If the Bar is an Extreme'''<br /> :: This is potentially t.4, proceed to step 3.5.<br /> <br /> :'''3.5. Checking the Position of t.4'''<br /> : The program checks the position of the potential t.4 relative to the extreme of t.2. There are 3 possible scenarios:<br /> :: '''3.5.1.''' The level of the potential t.4 is closer to the level of t.1 than the level of t.2. A candidate for t.4 for the Wedge model is found. In this case:<br /> ::: '''3.5.1.0.''' The bar of the potential t.4 is checked for the presence between it and the bar of t.3 of bars containing price values<br /> :::: more distant from t.3 than the value of the potential t.4, or<br /> :::: equal to t.4.<br /> :::: This is a check for the potential absoluteness of the extreme of the potential t.4. Possible options are:<br /> ::::: '''3.5.1.0.1.''' The potential t.4 is not a potentially absolute extreme (there are bars more distant from t.3). In this case, the next bar is processed according to sub-step 3.4.<br /> ::::: '''3.5.1.0.2.''' The potential t.4 is a potentially absolute extreme. In this case checking if t.2-t.4 line (this is the Aims Line, hereinafter - AL) is crossed by the price in the section between t.2 and t.4 (hereinafter - section 2-4). There are 2 options – 3.5.1.1. and 3.5.1.2.<br /> :::::: '''3.5.1.1.''' If AL is crossed, the program checks the analyzed bar for reaching the TL.<br /> :::::::: '''3.5.1.1.1.''' If the TL is not reached - the next bar is processed according to sub-step 3.4.<br /> :::::::: '''3.5.1.1.2.''' If the TL is reached, the program searches for a new candidate in t.3/t.3'. To do this, the analyzed bar is processed according to sub-step 3.2.3 and further according to the algorithm.<br /> :::::: '''3.5.1.2.''' If there is no linecrossing, the bar t.4 is checked for reaching the TL. The following options are possible:<br /> :::::::: '''3.5.1.2.1.''' If the bar t.4 reached the TL, then the [Wedge Found] Wedge model is fixed, for which the level of intersection of the TL and the AL is calculated, after which the program searches for t.3’ with the same points 1,2,3, or searches for a new t.3. To do this, the program processes the analyzed bar (in this case, the bar t.4, while reaching the TL) starting from sub-step 3.2.3. Model's Type (parameter G1) = WEDGE . <br /> :::::::: '''3.5.1.2.2.''' If the t.4 bar did not reach the TL, then the next bar after it (and when reapplying this step - the next bar after the previously analyzed bar) is analyzed for reaching the TL. At the same time, a check is made for not overcoming the distance equal to (t.1-t.3)*10. If the distance is overcome, then we return (go in a cycle) to the search for t.3. The following options are possible:<br /> :::::::::: '''3.5.1.2.2.1.''' If the analyzed bar reached the TL, then the program acts in analogy with sub-step 3.5.1.2.1. (i.e., the [Wedge Found] Wedge model is fixed and in a new branch of the algorithm the program processes the analyzed bar (in this case, the bar that reached the TL) starting from sub-step 3.2.3.<br /> :::::::::: '''3.5.1.2.2.2.''' If the TL is not reached, then the analyzed bar is checked for reaching the level of t.4. The following options are possible:<br /> :::::::::::: '''3.5.1.2.2.2.A.''' If the level of t.4 is not reached, the program analyzes the next bar for reaching the TL, options are similar to sub-steps 3.5.1.2.2.1. and 3.5.1.2.2.2.<br /> :::::::::::: '''3.5.1.2.2.2.B.''' If the level of t.4 is reached, then the program checks the analyzed bar according to sub-step 3.4.<br /> :: '''3.5.2.''' The level of the potential t.4 is further from the level of t.1 than the level of the potential t.2 - transition to step 4.<br /> :: '''3.5.3.''' The level of the potential t.4 is equal to the level of the potential t.2 - the program checks whether the bar of the considered candidate in t.4 has broken through (touched) the Trend Line (TL).<br /> ::: '''3.5.3.1. If not''' - the program searches for the next candidate for t.4. For this, the program processes the next bar according to sub-step 3.4.<br /> ::: '''3.5.3.2. If yes''' – the program searches for a new t.3, for which it analyzes the next bar according to step 2 and further according to the algorithm.<br /> <br /> <br /> ==='''Step IV. Checking for Intersection of the Aim Line (AL) by Price on Section 2-4'''===<br /> The program checks for intersections of the Aim Line by price on the section from t.2 to t.4 (hereafter - section 2-4).<br /> : '''4.1.''' If the AL is intersected by price on section 2-4 the program checks the analyzed bar (which is also the bar of the potential t.4) for a breakout (in this case, not a touch) of the Trend Line (TL).<br /> :: '''4.1.1.''' If the TL is not reached, the program processes the next bar according to step 3.4.<br /> :: '''4.1.2.''' If the TL is broken,<br /> ::: - t.3 becomes the cancelled t.3;<br /> ::: - the program searches for a new candidate for t.3. To do this, the analyzed bar is processed according to step 2.<br /> : '''4.2.''' If the AL is not intersected by price on section 2-4 the program proceeds to step 5.<br /> <br /> <br /> ==='''Step V. Model Fixation at the TL Breakthrough. Search for t.5. Search for t.6.'''===<br /> <br /> 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:<br /> <br /> : '''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.<br /> :: '''5.1.1.''' If the level of t.4 is not surpassed, then the model is considered formed [The model is formed without 6];<br /> :: Then the program proceeds to step 6.<br /> <br /> :: '''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).<br /> :: 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).<br /> <br /> ::: '''5.1.2.1.''' If the extreme is found - this is a potential t.5.<br /> ::: There are 2 scenarios:<br /> :::: '''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:<br /> ::::: '''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.<br /> ::::: There are 2 scenarios:<br /> ::::::: '''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.<br /> ::::::: '''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.<br /> <br /> ::::: '''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.<br /> <br /> :::: '''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.<br /> <br /> ::: '''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.<br /> <br /> : '''5.2.''' LT 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:<br /> <br /> : for extremity according to rule N1 (as t.5);<br /> : 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<br /> :-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).<br /> :: '''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:<br /> ::: '''5.2.1.1.''' If the level of t.4 is reached (confirmed by the bar of the potential t.5)<br /> ::: 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:<br /> ::: There are 2 scenarios:<br /> :::: '''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:<br /> ::::: '''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.<br /> ::::: '''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.<br /> <br /> :::: '''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. <br /> :::: The program proceeds to step 6. (there was an idea to redo to step 5.3.)<br /> <br /> ::: '''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.<br /> <br /> :: '''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.<br /> ::: '''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:<br /> :::: '''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.)<br /> :::: '''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.<br /> <br /> ::: '''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).<br /> <br /> '''5.3.''' Algorithm for determining the presumed real p.6:<br /> <br /> : '''5.3.1.''' Apply Algorithm I to the models, excluding AM.<br /> : 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.<br /> :The extremum identified in step 2 is considered the real t.6.<br /> :Instead of x's representing price value or time and date, the report displays the following:<br /> : P6: xxxxx (price value)<br /> : P6t: xx:xx:xxxx (time and date)<br /> <br /> :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.<br /> :P6supp: -<br /> :P6suppt: -<br /> <br /> : '''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.<br /> :: '''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.<br /> :: The report should display the following information:<br /> :: P6: --<br /> :: P6t: -- <br /> :: P6supp: --<br /> :: P6suppt: --<br /> <br /> ::: '''5.3.2.2.''' If the number of bars formed after t.4 does not exceed 300, several scenarios are possible.<br /> :::: '''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.<br /> :::: 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.<br /> :::: The program then checks if the price has surpassed this level in the section after t.4 of the analyzed model.<br /> <br /> :::: '''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. The report shows the following data:<br /> <br /> :::: P6: --<br /> :::: P6t: -- <br /> :::: P6supp: --<br /> :::: P6suppt: --<br /> <br /> :::: '''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. In this situation, the report will show the following information instead of x's (which represent either price value or time and date):<br /> <br /> :::: P6: --<br /> :::: P6t: -- <br /> :::: Additionally, the report will display the following details related to the presumed real p.6:<br /> :::: P6supp (the price value)<br /> :::: P6suppt (a specific time and date in the format xx:xx:xxxx)<br /> <br /> ::: '''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. In this scenario, the report displays the following:<br /> ::: P6: --<br /> ::: P6t: -- <br /> ::: Additionally, the report will display the following details related to the presumed real p.6:<br /> ::: P6supp (the price value)<br /> ::: P6suppt (a specific time and date in the format xx:xx:xxxx)<br /> <br /> :: '''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.<br /> <br /> : '''5.4.''' Algorithm for Determining Whether the Model is from the Start of the Trend Model or Along the Trend (Trend-Following) Model<br /> <br /> :: '''5.4.1.''' For main models except for EAM <br /> :: 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 .<br /> <br /> ::* 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.<br /> ::* If the intersection lies to the left of the (presumed) starting point of the preceding trend (related to this model), the report displays: <br /> :: G3: HTModel<br /> :: * 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: <br /> :: G3: BTModel<br /> :: * 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: <br /> :: G3: NoData<br /> <br /> :: '''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.<br /> <br /> :The program proceeds to step 6.<br /> <br /> <br /> <br /> ==='''Step VI. Search for Tangents and Construction of the Auxiliary Attraction Model'''===<br /> <br /> : '''6.1.''' Search for t.2’<br /> <br /> : The program conducts a search for t.2’ (tangent, i.e., the rule N1 is removed for it), which will yield the LC, without any intersections with the price in the section between T.1 and T.2. Bars are checked from right to left starting from the bar t.2 to the bar t.1 inclusive (further – section 1-2). Point 2’ (further – t.2’) can coincide with t.2, if the LC through t.2 does not have extra price intersections on 1-2, however t.2’ cannot belong to the bar t.1.<br /> <br /> :: '''6.1.1.''' If t.2’ is found <br /> <br /> :: If t.2’ is found (including if t.2’ coincides with t.2), then the program calculates the Line of goals by the tangent from t.2’ to t.4 (further -AL’). It is then checked whether the considered model has the status [The model is formed without point 6].<br /> <br /> ::: '''6.1.1.1.''' The model has the status [The model is formed without point 6] <br /> <br /> ::: If the model has the status [The model is formed without point 6], the program proceeds to step 7.<br /> <br /> ::: '''6.1.1.2.''' The model does not have the status [The model is formed without point 6] <br /> <br /> ::: If the model does not have the status [The model is formed without point 6], the program proceeds to sub-step 6.2.<br /> <br /> ::: '''6.1.2.''' If T.2’ is not found <br /> <br /> ::: If t.2’ is not found (i.e., it is impossible to build such a line through points t.2’ and t.4, which will not contain extra points on section 1-2), then this is a model without an Auxiliary AM. Theprogram proceeds to step 7.<br /> <br /> :: '''6.2.''' Search for t.3’ of the Auxiliary AM <br /> <br /> :: The program constructs a line from t.3 (or t.3’ if it exists) to t.5 (Trend Line of the Auxiliary Attraction Model, further - TLam) and checks it for the presence of price intersections in the section between t.3 and t.5.<br /> <br /> ::: '''6.2.1.''' Intersections are found <br /> <br /> ::: If intersections are found, the line t.3/t.3’-t.5 in this case is not displayed on the chart. The program searches for such point 3’ of the Auxiliary Attraction Model (further t.3’am), through which it is possible to construct a line, which will not have price intersections on the section from t.3/t.3’ to t.5.<br /> <br /> :::: '''6.2.1.1.''' If t.3’am is found<br /> <br /> :::: If t.3’am is found, then the program constructs the Line of trend of the auxiliary model of attraction by the tangent from t.3’am to t.5 (further – TLam’) and calculates the level of intersection of AL’ and TLmp’ (further – calculated t.6). There are 2 options:<br /> <br /> :::: '''6.2.1.1.1.''' If the calculated t.6 is found<br /> <br /> :::: If the calculated t.6 is found, then a check is carried out for the minimum ratio of the time segment t.2-t.4 to the segment t.4-t.6 for the Auxiliary AM (should be within 0.5). If the check is not passed, then the model does not have an auxiliary MP (in this case LTmp is not displayed on the chart), the algorithm proceeds to sub-step 6.3. If the check is passed, the program checks whether the bar t.5 breaks through the level of the calculated p.6.<br /> <br /> ::::: '''6.2.1.1.1.A.''' If the bar t.5 does not break through the level of the calculated p.6 <br /> <br /> ::::: If the t.5 bar does not break through the level of the calculated p.6, then the program proceeds to sub-step 6.3. In the report is displayed: AUX AM<br /> <br /> ::::: '''6.2.1.1.1.B.''' If the t.5 bar breaks through the level of the calculated p.6<br /> <br /> ::::: If the t.5 bar breaks through the level of the calculated p.6, then this AM cannot be built and the program is looking for a new t.4. for this the next bar is checked according to sub-step 3.4., or in case if the model has a mark draw_flag this branch of the algorithm stops.<br /> <br /> :::: '''6.2.1.1.2.''' The calculated point 6-th is not found<br /> <br /> :::: The calculated 6-th is not found (i.e., the lines do not intersect). In this case TLam is not displayed on the chart. In the report is displayed: AUX NoAM The program proceeds to sub-step 6.3.<br /> <br /> ::: '''6.2.1.2.''' If t.3’am is not found<br /> <br /> ::: If t.3’am is not found, then in the report is displayed: AUX NoAM The program proceeds to step 7.<br /> <br /> :: '''6.2.2.''' Intersections are not found <br /> <br /> :: Intersections are not found. In this case, the program calculates the level of intersection of TLam and AL’ (this is the level of the calculated p.6). There are 2 options according to sub-steps 6.2.1.1.1. and 6.2.1.1.2.<br /> <br /> : '''6.3.''' Construction of the Auxiliary AM through t.5<br /> <br /> : The program checks for the presence of t.5’ (the first possible local extremum in time on the section T.4-T.5). If T.5’ is found, in the report is displayed: AimsBlock5’ 5' If t.5’ is not, then in the report is displayed: AimsBlock5’ No5'<br /> <br /> : If t.5' is present, the program will follow a similar process as sub-step 6.2 to construct the Trend Line for the Auxiliary Attraction Model. However, this time it will start from t.5' and, if necessary, use another suitable t.3' (referred to as t.3'am5'). If the program successfully constructs a Auxiliary AM through t.5' (indicating convergence of the lines), the model will be labeled as [The AM is built through t.5'] in the report. <br /> : The report will display: <br /> : AUX5’: AUX5’<br /> : Alternatively, if the MP is not built through t.5', the program will display: <br /> : AUX5’: NoAUX5’ <br /> : After this, the program will proceed to step.7.<br /> <br /> <br /> ===''' Step VII. Determination of SP and Model Type.'''===<br /> The program recalls whether the model was built through t.2 or through t.2’<br /> : '''7.1.''' In case if AL is built through t.2 does not have intersection with the price on the section t.1-t.2, or if there is ALam, built through t.2’. Here and further it is assumed that if the line, built through t.2 to t.4 does not have intersections with the price on the section t.1-t.2, then it is considered that t.2’=t.2 and AL’=AL.<br /> <br /> : The type of the model is determined by the position of the intersection point of TL and AL’ (this is the line built from t.2’ to t.4) in relation to t.4:<br /> <br /> :: '''7.1.1.''' The intersection point of TL and AL’ lies to the right of t.4. In this case the intersection point of the lines is the calculated point 6 (further - calculated t.6).), then the program calculates the ratio of time segments from t.1 to t.4 and from t.4 to calculated point 6 for AM.<br /> <br /> ::: '''7.1.1.1.''' If the section from t.1 to t.4, multiplied by 3 is greater than the section from t.4 to the calculated point 6 for CMP, this model's type is AM.<br /> ::: G1: AM<br /> <br /> ::: If the model under consideration is AM and at the same time it is formed (i.e. after t.4 the TL is broken through), the program checks each bar after the t.4 bar, until one of the following events:<br /> <br /> :::: '''7.1.1.1.1.''' A bar is found that has reached the level of t.3 (but has not reached the level of t.4). In this case, this branch of the algorithm is completed.<br /> <br /> :::: '''7.1.1.1.2.''' A bar is found that has reached the level of t.4 (while either not reaching or reaching the level of t.3).<br /> <br /> :::: -in case of the presence of the draw_flag label – this branch stops;<br /> :::: -in another case, the program checks for the presence on the section from t.4 (not including) to the bar, which reached the level of t.4 (inclusive) of the extremum, opposite to the extremum t.4 (i.e. co-directed with the extremum t.1 of the analyzed model. There are 2 options:<br /> <br /> ::::: '''7.1.1.1.2.A.''' The extremum is found. In this case, the algorithm proceeds to step 8.<br /> <br /> ::::: '''7.1.1.1.2.B.''' The extremum is not found. In this case the status of the formed model is canceled (the model is discarded);<br /> ::::: -t.3 becomes the canceled t.3;<br /> ::::: -the program searches for the next candidate for t.3. For this, the program processes the bar that broke through the TL according to step 2.<br /> ::: '''7.1.1.2.''' If<br /> ::: -the section from t.1 to t.4, multiplied by 3 is less than or equal to the section from t.4 to the calculated t.6 (for converging lines) and at the same time<br /> ::: -the section from t.1 to t.4 multiplied by 12 is greater than the section t.4-t.6, this model is AM/DBM<br /> ::: G1: AM/DBM<br /> <br /> ::: '''7.1.1.3.''' The section from t.1 to t.4 multiplied by 12 is less than or equal to the section from SP to t.1 (for TL and AL converging to the left), then this model is DBM. <br /> ::: G1: DBM<br /> <br /> :: '''7.1.2.''' The intersection point of TL and AL’ (AL’ – this is the line from t.2’ – t.4) lies to the left of t.4 —this point is qualified as the Sacral Point (further – SP).<br /> <br /> ::: '''7.1.2.1.''' If<br /> ::: -the section from t.1 to t.4 multiplied by 3 is less than or equal to the section from SP to t.1, and at the same time;<br /> ::: -the section from t.1 to t.4 multiplied by 12 is greater than the section from SP to t.1 then this is EM/DBM <br /> ::: G1: EM/DBM<br /> <br /> ::: '''7.1.2.2.''' If the section from t.1 to t.4 multiplied by 3 is greater than the section from SP to t.1, this is eng. - EM.<br /> ::: G1: EM<br /> <br /> ::: '''7.1.2.3.''' If<br /> ::: -TL and AL of the model are parallel, or<br /> ::: -the section from t.1 to t.4 multiplied by 12 is less than or equal to the section t.4-t.6 (for TL and AL converging to the right);<br /> ::: -the section from t.1 to t.4 multiplied by 12 is less than or equal to the section from SP to t.1 (for TL and AL converging to the left), then this model is eng. - DBM <br /> ::: G1: DBM<br /> <br /> ::: The program proceeds to step 8.<br /> <br /> : '''7.2.''' If for this model it was impossible to construct AL (AL’) in such a way that there were no extra intersections on the section t.1 (inclusive) - t.2, then the program checks where TL and AL from t.2 intersect.<br /> <br /> :: '''7.2.1.''' If the lines intersect to the right (i.e. after t.4), then<br /> ::: '''7.2.1.1.''' if the section from t.1 to t.4, multiplied by 3 is greater than the section from t.4 to the calculated t.6 (for converging lines), then this model is incorrect.<br /> ::: There are one of 2 options:<br /> <br /> :::: '''7.2.1.1.1''' If the TL of the incorrect AM is broken through by the t.4 bar or the bar immediately following t.4, then<br /> <br /> :::: -in case of the presence of the draw_flag label – this branch stops;<br /> :::: -in another case t.3 becomes the canceled t.3 and the program searches for a new t.3, for this it processes the bar that broke through the TL AM according to step 2.<br /> :::: '''7.2.1.1.2.''' If the TL of the incorrect CMP is not broken through by the t.4 bar or the bar immediately following it, then the program searches for a new t.4, for this the next bar is checked according to sub-step 3.4.<br /> <br /> ::: '''7.2.1.2.''' -the section from t.1 to t.4, multiplied by 12 is greater than the section from t.4 to the calculated t.6, then this model is AM/DBM .<br /> ::: G1: AM/DBM<br /> <br /> ::: '''7.2.1.3.''' the section from t.1 to t.4 multiplied by 12 is less than or equal to the section from t.4 to t.6 then this model is DBM .<br /> ::: G1: DBM<br /> <br /> :: '''7.2.2.''' If TL and AL intersect to the left (i.e. in the past) relative to t.4, the program performs an indirect check for the Strength of the trend. For this, a pseudo SP is used – this is the intersection point of AL (built through t.2) and TL in case it is impossible to build AL through t.2 so that there are no extra points on it. The following options are possible:<br /> <br /> ::: '''7.2.2.1.''' If the pseudo SP lies to the right (i.e. later) of t.1 to t.3 (or t.3’, if the model is built on it), then the type of this model is determined as EM, moreover, the model is strong by pseudo SP.<br /> <br /> ::: G1: EM<br /> <br /> ::: SP: strongpseudoSP<br /> <br /> ::: '''7.2.2.2.''' Otherwise<br /> ::: If the lines intersect to the left of t.1 (i.e. earlier), the following options are possible:<br /> <br /> :::: '''7.2.2.2.1.''' If the section from t.1 to t.3 (3’) is greater than the section from the intersection of TL and AL to t.1, the model is assigned the type EM, while the Strength of the model is not determined.<br /> :::: G1: EM<br /> <br /> :::: SP: undef<br /> <br /> :::: '''7.2.2.2.2.''' If<br /> :::: -the section from T.1 to t.3(3’) is less than or equal to the section from the intersection of TL and AL to t.1 and up to<br /> :::: -the section from T.1 to t.3(3’) multiplied by 3 is greater than the section from the intersection of TL and AL to t.1, the model is assigned the type is EM. At the same time, the model is weak.<br /> <br /> :::: G1: EM<br /> <br /> :::: SP: weakpseudoST<br /> <br /> :::: '''7.2.2.2.3.''' If the section from t.1 to t.3(3’) multiplied by 3 is less than the section from the intersection of TL and AL to t.1, then the model type is EM/DBM.<br /> :::: G1: EM/DBM<br /> <br /> : '''7.3.''' Also, occasionally there are cases when the model for some reason does not fall under any of the above options. Then the model type is not determined.<br /> <br /> === '''Step VIII: Search for Alternative Models. Launching a New Branch from the Previous t.1 but with a Different t.3 '''===<br /> <br /> The program initiates a search for the subsequent model with the same t.1, but a new t.3. The bar following t.3/t.3’, according to step 2, is analyzed for this purpose. Concurrently, the program initiates a search for an alternative model in relation to the one already found. For this, it analyzes the bar that has broken through the level of t.4 as a potential t.4, according to step 3.4, and continues further according to the algorithm.<br /> <br /> <br /> ==References==<br /> &lt;references /&gt;</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_II&diff=180 2023-08-25T20:16:12Z

<p>Admin: </p> <hr /> <div>This article is not finished<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with UMG General Concepts.<br /> <br /> ==='''Step I. Search For Point 3 of the External Attraction Model (EAM) and the Sarting Point of the Previous Trend.'''===<br /> : '''1.1.''' The program looks for the first possible extreme, satisfying Single Bar Rule. Such an extreme is a candidate for potential point 3 ( potential t.3).<br /> : '''1.2.''' Next, the program checks the bars from right to left (i.e., in the past) from the bar containing the extreme candidate for point 3 to one of the following events:<br /> :: '''1.2.1.''' Found the last intersection (breakthrough) point by the price level of the candidate for point 3.<br /> ::In this case, the report displays: <br /> :: PREVdata: FullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.2.''' The program reached the starting point of the chart (i.e., the price did not intersect the level of point 3 after the starting point of the chart).<br /> ::In this case, the report displays: <br /> :: PREVdata: NoFullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.1.''' The price checked 300 bars preceding point 3, but the level of step 3 did not intersect at this segment. The program looks for an absolute extreme (opposite to step 3) on the segment from the 300th bar before point 3 to point 3. The program proceeds to substep 1.3.<br /> : '''1.3.''' The program looks for an absolute extreme (opposite to point 3 extreme) on the segment:<br /> ::- from the last intersection by the price level of the candidate for point 3 (inclusive) (if came from 1.2.1.), or :: - from the starting point of the chart (if came from 1.2.2.), or <br /> :: - from 300 bars(if came from 1.2.3.) <br /> :: to point 3 (excluding).<br /> :: '''1.3.1.''' Absolute extreme found. The candidate for point 3 is confirmed; moreover, the found confirming extreme is the assumed (if coming from 1.2.2. or 1.2.3.) starting point of the preceding trend.'''<br /> ::The program checks for the absence of extremes equal to point 3 between the assumed starting point of the previous trend and point 3. <br /> :::'''1.3.1.1.''' If such an extreme is found, this candidate for point 3 is discarded, and this point 3 is discarded. <br /> :::'''1.3.1.2.''' If such an extreme is not found, the program proceeds to step 2.<br /> ::'''1.3.2.''' Absolute extreme not found. This point 3 is discarded.'''<br /> ::Simultaneously with step 1, the program launches the search for the next potential point 3.<br /> <br /> <br /> ==='''Step II. Search For Potentioal Points 5 and 4 ''' ===<br /> '''The Orientation rule (N1 requirement) for Algorithm II is as follows:'''<br /> If point 3 is low, then the level of point 5 should be higher than point 3. <br /> If point 3 is high, then the level of point 5 should be lower than point 3.<br /> '''Search for Point 5.''' The bar following the bar of Point 3 (and in repeated applications of this step - the bar specified in this algorithm) is checked for not overcoming the level of point 3 (since N1 requirement for Algorithm II must be observed).<br /> : '''2.1.''' If the price has overcome the level of point 3, the program discards the considered step 3 (due to N1 requirement).<br /> :: '''2.2.''' If N1 requirement is met for the analyzed bar, it is checked for compliance with N1 requirement as a potential point 5 (hereafter - point 5 or t.5).<br /> :: '''2.2.1.''' If the analyzed bar is not an extreme according to N1 requirement (as a potential point 5), the program checks the next bar from the beginning of step 2.<br /> :: '''2.2.2.''' If the analyzed bar is determined as an extreme according to N1 requirement (as a potential point 5), then this bar is checked for reaching (but not necessarily overcoming) the level of point 3. There are 2 options:<br /> ::: '''2.2.2.1.''' If the level of point 3 is reached, the program analyzes the next bar according to this step (i.e., from the beginning of step 2).<br /> ::: '''2.2.2.2.''' If the level of point 3 is not reached, the analyzed bar is a potential point 5, and the program moves to substep 2.3.<br /> '''2.3. Search for Point 4.''' The program searches for a bar, which was the last to cross the level of the considered potential point 5. Let's denote this bar as lcb5 (line-crossing-bar-5). If lcb5 coincides with the bar of point 3, we denote the bar following lcb5 as look4. Otherwise, look4 = lcb5. The program searches for a bar with the maximum (if point 3 is low) or minimum (if point 3 is high) price in the interval from lcb5 to potential point 5. Then this bar is checked for being an extreme according to N1 requirement as a potential pont 4 (hereafter – point 4 or t.4). There are 2 options:<br /> :: '''2.3.1.''' The bar is an absolute extreme (as a potential point 4). In this case, potential point 4 is found.<br /> ::: '''2.3.1.1.''' If step 2 has already been determined (this is possible when this step is triggered during the search for an alternative model), the program checks the line chart for extra points in the section from step 2 to step 4. There are 2 options:<br /> :::: '''2.3.1.1.A.''' If extra points are found, the program processes the next bar after potential point 5 according to step 2.<br /> :::: '''2.3.1.1.B.''' Extra intersections are not found; the program moves to substep 2.4.<br /> ::: '''2.3.1.2.''' If substep 2.3.1. is triggered during the search for the basic model, the program moves to substep 2.4.<br /> :: '''2.3.2.''' The bar is not an absolute extreme (as a potential point 4). In this case, the program looks for another candidate for point 5 according to this step (i.e., according to step 2).<br /> If the program has processed 50 bars in a row according to this step (step 2), and the program has not moved to another step of the algorithm, then this potential point 3 is discarded.<br /> <br /> If there are 150 or more bars between potential point 3 and the analyzed bar, and potential points 4 and 5 are not found, then this potential point 3 is discarded.</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_II&diff=179 2023-08-25T19:35:05Z

<p>Admin: Adding Step 2</p> <hr /> <div>This article is not finished<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with UMG General Concepts.<br /> <br /> ==='''Step I. Search For Point 3 of the External Attraction Model (EAM) and the Sarting Point of the Previous Trend.'''===<br /> <br /> : '''1.1.''' The program looks for the first possible extreme, satisfying Single Bar Rule. Such an extreme is a candidate for potential point 3 ( potential t.3).<br /> <br /> : '''1.2.''' Next, the program checks the bars from right to left (i.e., in the past) from the bar containing the extreme candidate for point 3 to one of the following events:<br /> <br /> :: '''1.2.1.''' Found the last intersection (breakthrough) point by the price level of the candidate for point 3.<br /> ::In this case, the report displays: <br /> :: PREVdata: FullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.2.''' The program reached the starting point of the chart (i.e., the price did not intersect the level of point 3 after the starting point of the chart).<br /> ::In this case, the report displays: <br /> :: PREVdata: NoFullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.1.''' The price checked 300 bars preceding point 3, but the level of step 3 did not intersect at this segment. The program looks for an absolute extreme (opposite to step 3) on the segment from the 300th bar before point 3 to point 3. The program proceeds to substep 1.3.<br /> <br /> : '''1.3.''' The program looks for an absolute extreme (opposite to point 3 extreme) on the segment:<br /> ::- from the last intersection by the price level of the candidate for point 3 (inclusive) (if came from 1.2.1.), or :: - from the starting point of the chart (if came from 1.2.2.), or <br /> :: - from 300 bars(if came from 1.2.3.) <br /> :: to point 3 (excluding).<br /> :: '''1.3.1.''' Absolute extreme found. The candidate for point 3 is confirmed; moreover, the found confirming extreme is the assumed (if coming from 1.2.2. or 1.2.3.) starting point of the preceding trend.'''<br /> ::The program checks for the absence of extremes equal to point 3 between the assumed starting point of the previous trend and point 3. <br /> :::'''1.3.1.1.''' If such an extreme is found, this candidate for point 3 is discarded, and this point 3 is discarded. <br /> :::'''1.3.1.2.''' If such an extreme is not found, the program proceeds to step 2.<br /> ::'''1.3.2.''' Absolute extreme not found. This point 3 is discarded.'''<br /> ::Simultaneously with step 1, the program launches the search for the next potential point 3.<br /> <br /> <br /> ==='''Step II. Search For Potentioal Points 5 and 4 ''' ===<br /> <br /> '''The Orientation rule (N1 requirement) for Algorithm II is as follows:'''<br /> If point 3 is low, then the level of point 5 should be higher than point 3. <br /> If point 3 is high, then the level of point 5 should be lower than point 3.<br /> <br /> '''Search for Point 5.''' The bar following the bar of Point 3 (and in repeated applications of this step - the bar specified in this algorithm) is checked for not overcoming the level of point 3 (since N1 requirement for Algorithm II must be observed).<br /> <br /> : '''2.1.''' If the price has overcome the level of point 3, the program discards the considered step 3 (due to N1 requirement).<br /> :: '''2.2.''' If N1 requirement is met for the analyzed bar, it is checked for compliance with N1 requirement as a potential point 5 (hereafter - point 5 or t.5).<br /> :: '''2.2.1.''' If the analyzed bar is not an extreme according to N1 requirement (as a potential point 5), the program checks the next bar from the beginning of step 2.<br /> :: '''2.2.2.''' If the analyzed bar is determined as an extreme according to N1 requirement (as a potential point 5), then this bar is checked for reaching (but not necessarily overcoming) the level of point 3. There are 2 options:<br /> ::: '''2.2.2.1.''' If the level of point 3 is reached, the program analyzes the next bar according to this step (i.e., from the beginning of step 2).<br /> ::: '''2.2.2.2.''' If the level of point 3 is not reached, the analyzed bar is a potential point 5, and the program moves to substep 2.3.<br /> '''2.3. Search for Point 4.''' The program searches for a bar, which was the last to cross the level of the considered potential point 5. Let's denote this bar as lcb5 (line-crossing-bar-5). If lcb5 coincides with the bar of point 3, we denote the bar following lcb5 as look4. Otherwise, look4 = lcb5. The program searches for a bar with the maximum (if point 3 is low) or minimum (if point 3 is high) price in the interval from lcb5 to potential point 5. Then this bar is checked for being an extreme according to N1 requirement as a potential pont 4 (hereafter – point 4 or t.4). There are 2 options:<br /> :: '''2.3.1.''' The bar is an absolute extreme (as a potential point 4). In this case, potential point 4 is found.<br /> ::: '''2.3.1.1.''' If step 2 has already been determined (this is possible when this step is triggered during the search for an alternative model), the program checks the line chart for extra points in the section from step 2 to step 4. There are 2 options:<br /> :::: '''2.3.1.1.A.''' If extra points are found, the program processes the next bar after potential point 5 according to step 2.<br /> :::: '''2.3.1.1.B.''' Extra intersections are not found; the program moves to substep 2.4.<br /> ::: '''2.3.1.2.''' If substep 2.3.1. is triggered during the search for the basic model, the program moves to substep 2.4.<br /> :: '''2.3.2.''' The bar is not an absolute extreme (as a potential point 4). In this case, the program looks for another candidate for point 5 according to this step (i.e., according to step 2).<br /> If the program has processed 50 bars in a row according to this step (step 2), and the program has not moved to another step of the algorithm, then this potential point 3 is discarded.<br /> <br /> If there are 150 or more bars between potential point 3 and the analyzed bar, and potential points 4 and 5 are not found, then this potential point 3 is discarded.</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_II&diff=178 2023-08-25T04:46:18Z

<p>Admin: </p> <hr /> <div>This article is not finished<br /> <br /> '''The N1 rule (N1 requirement) for Algorithm II is as follows:'''<br /> If point 3 is low, then the level of point 5 should be higher than point 3. <br /> If point 3 is high, then the level of point 5 should be lower than point 3.<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with UMG General Concepts.<br /> <br /> ==='''Step I. Search For Point 3 of the External Attraction Model (EAM) and the Sarting Point of the Previous Trend.'''===<br /> <br /> : '''1.1.''' The program looks for the first possible extreme, satisfying Single Bar Rule. Such an extreme is a candidate for potential point 3 ( potential t.3).<br /> <br /> : '''1.2.''' Next, the program checks the bars from right to left (i.e., in the past) from the bar containing the extreme candidate for point 3 to one of the following events:<br /> <br /> :: '''1.2.1.''' Found the last intersection (breakthrough) point by the price level of the candidate for point 3.<br /> ::In this case, the report displays: <br /> :: PREVdata: FullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.2.''' The program reached the starting point of the chart (i.e., the price did not intersect the level of point 3 after the starting point of the chart).<br /> ::In this case, the report displays: <br /> :: PREVdata: NoFullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.1.''' The price checked 300 bars preceding point 3, but the level of step 3 did not intersect at this segment. The program looks for an absolute extreme (opposite to step 3) on the segment from the 300th bar before point 3 to point 3. The program proceeds to substep 1.3.<br /> <br /> : '''1.3.''' The program looks for an absolute extreme (opposite to point 3 extreme) on the segment:<br /> ::- from the last intersection by the price level of the candidate for point 3 (inclusive) (if came from 1.2.1.), or :: - from the starting point of the chart (if came from 1.2.2.), or <br /> :: - from 300 bars(if came from 1.2.3.) <br /> :: to point 3 (excluding).<br /> :: '''1.3.1.''' Absolute extreme found. The candidate for point 3 is confirmed; moreover, the found confirming extreme is the assumed (if coming from 1.2.2. or 1.2.3.) starting point of the preceding trend.'''<br /> ::The program checks for the absence of extremes equal to point 3 between the assumed starting point of the previous trend and point 3. <br /> :::'''1.3.1.1.''' If such an extreme is found, this candidate for point 3 is discarded, and this point 3 is discarded. <br /> :::'''1.3.1.2.''' If such an extreme is not found, the program proceeds to step 2.<br /> ::'''1.3.2.''' Absolute extreme not found. This point 3 is discarded.'''<br /> ::Simultaneously with step 1, the program launches the search for the next potential point 3.</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_II&diff=177 2023-08-25T04:45:20Z

<p>Admin: </p> <hr /> <div>This article is not finished<br /> <br /> '''The N1 rule (N1 requirement) for Algorithm II is as follows:'''<br /> If point 3 is low, then the level of point 5 should be higher than point 1. <br /> If point 3 is high, then the level of point 5 should be lower than point 1.<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with UMG General Concepts.<br /> <br /> ==='''Step I. Search For Point 3 of the External Attraction Model (EAM) and the Sarting Point of the Previous Trend.'''===<br /> <br /> : '''1.1.''' The program looks for the first possible extreme, satisfying Single Bar Rule. Such an extreme is a candidate for potential point 3 ( potential t.3).<br /> <br /> : '''1.2.''' Next, the program checks the bars from right to left (i.e., in the past) from the bar containing the extreme candidate for point 3 to one of the following events:<br /> <br /> :: '''1.2.1.''' Found the last intersection (breakthrough) point by the price level of the candidate for point 3.<br /> ::In this case, the report displays: <br /> :: PREVdata: FullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.2.''' The program reached the starting point of the chart (i.e., the price did not intersect the level of point 3 after the starting point of the chart).<br /> ::In this case, the report displays: <br /> :: PREVdata: NoFullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.1.''' The price checked 300 bars preceding point 3, but the level of step 3 did not intersect at this segment. The program looks for an absolute extreme (opposite to step 3) on the segment from the 300th bar before point 3 to point 3. The program proceeds to substep 1.3.<br /> <br /> : '''1.3.''' The program looks for an absolute extreme (opposite to point 3 extreme) on the segment:<br /> ::- from the last intersection by the price level of the candidate for point 3 (inclusive) (if came from 1.2.1.), or :: - from the starting point of the chart (if came from 1.2.2.), or <br /> :: - from 300 bars(if came from 1.2.3.) <br /> :: to point 3 (excluding).<br /> :: '''1.3.1.''' Absolute extreme found. The candidate for point 3 is confirmed; moreover, the found confirming extreme is the assumed (if coming from 1.2.2. or 1.2.3.) starting point of the preceding trend.'''<br /> ::The program checks for the absence of extremes equal to point 3 between the assumed starting point of the previous trend and point 3. <br /> :::'''1.3.1.1.''' If such an extreme is found, this candidate for point 3 is discarded, and this point 3 is discarded. <br /> :::'''1.3.1.2.''' If such an extreme is not found, the program proceeds to step 2.<br /> ::'''1.3.2.''' Absolute extreme not found. This point 3 is discarded.'''<br /> ::Simultaneously with step 1, the program launches the search for the next potential point 3.</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_II&diff=176 2023-08-24T20:30:53Z

<p>Admin: </p> <hr /> <div>This article is not finished<br /> <br /> '''The N1 rule (N1 requirement) for Algorithm II is as follows:'''<br /> If point 3 is low, then the level of point 5 should be higher than point 1. <br /> If point 3 is high, then the level of point 5 should be lower than point 1.<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with UMG General Concepts.<br /> <br /> ==='''Step I. Search For Point 3 of the External Attraction Model (EAM) and the Sarting Point of the Previous Trend.'''===<br /> <br /> : '''1.1.''' The program looks for the first possible extreme, satisfying Single Bar Rule. Such an extreme is a candidate for potential point 3 ( potential t.3).<br /> <br /> : '''1.2.''' Next, the program checks the bars from right to left (i.e., in the past) from the bar containing the extreme candidate for point 3 to one of the following events:<br /> <br /> :: '''1.2.1.''' Found the last intersection (breakthrough) point by the price level of the candidate for point 3.<br /> ::In this case, the report displays: <br /> :: PREVdata: FullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.2.''' The program reached the starting point of the chart (i.e., the price did not intersect the level of point 3 after the starting point of the chart).<br /> ::In this case, the report displays: <br /> :: PREVdata: NoFullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.1.''' The price checked 300 bars preceding point 3, but the level of step 3 did not intersect at this segment. The program looks for an absolute extreme (opposite to step 3) on the segment from the 300th bar before point 3 to point 3. The program proceeds to substep 1.3.<br /> <br /> : '''1.3.''' The program looks for an absolute extreme (opposite to point 3 extreme) on the segment:<br /> ::- from the last intersection by the price level of the candidate for point 3 (inclusive) (if coming from 1.2.1.), or :: - from the starting point of the chart (if coming from 1.2.2.), or :: - from 300 bars to point 3 (if coming from 1.2.3.) :: to point 3 (excluding).<br /> :: '''1.3.1.''' Absolute extreme found. The candidate for point 3 is confirmed; moreover, the found confirming extreme is the assumed (if coming from 1.2.2. or 1.2.3.) starting point of the preceding trend.'''<br /> ::The program checks for the absence of extremes equal to point 3 between the assumed starting point of the previous trend and point 3. <br /> :::'''1.3.1.1.''' If such an extreme is found, this candidate for point 3 is discarded, and this point 3 is discarded. <br /> :::'''1.3.1.2.''' If such an extreme is not found, the program proceeds to step 2.<br /> ::'''1.3.2.''' Absolute extreme not found. This point 3 is discarded.'''<br /> ::Simultaneously with step 1, the program launches the search for the next potential point 3.</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_II&diff=175 2023-08-24T20:30:39Z

<p>Admin: </p> <hr /> <div>This article is not finished<br /> <br /> '''The N1 rule (N1 requirement) for Algorithm II is as follows:'''<br /> If point 3 is low, then the level of point 5 should be higher than point 1. <br /> If point 3 is high, then the level of point 5 should be lower than point 1.<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with UMG General Concepts.<br /> <br /> ==='''Step I. Search For Point 3 of the External Attraction Model (EAM) and the Sarting Point of the Previous Trend.'''===<br /> <br /> : '''1.1.''' The program looks for the first possible extreme, satisfying Single Bar Rule. Such an extreme is a candidate for potential point 3 ( potential t.3).<br /> <br /> : '''1.2.''' Next, the program checks the bars from right to left (i.e., in the past) from the bar containing the extreme candidate for point 3 to one of the following events:<br /> <br /> :: '''1.2.1.''' Found the last intersection (breakthrough) point by the price level of the candidate for point 3.<br /> ::In this case, the report displays: <br /> :: PREVdata: FullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.2.''' The program reached the starting point of the chart (i.e., the price did not intersect the level of point 3 after the starting point of the chart).<br /> ::In this case, the report displays: <br /> :: PREVdata: NoFullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.1.''' The price checked 300 bars preceding point 3, but the level of step 3 did not intersect at this segment. The program looks for an absolute extreme (opposite to step 3) on the segment from the 300th bar before point 3 to point 3. The program proceeds to substep 1.3.<br /> <br /> : '''1.3.'''T he program looks for an absolute extreme (opposite to point 3 extreme) on the segment:<br /> ::- from the last intersection by the price level of the candidate for point 3 (inclusive) (if coming from 1.2.1.), or :: - from the starting point of the chart (if coming from 1.2.2.), or :: - from 300 bars to point 3 (if coming from 1.2.3.) :: to point 3 (excluding).<br /> :: '''1.3.1.''' Absolute extreme found. The candidate for point 3 is confirmed; moreover, the found confirming extreme is the assumed (if coming from 1.2.2. or 1.2.3.) starting point of the preceding trend.'''<br /> ::The program checks for the absence of extremes equal to point 3 between the assumed starting point of the previous trend and point 3. <br /> :::'''1.3.1.1.''' If such an extreme is found, this candidate for point 3 is discarded, and this point 3 is discarded. <br /> :::'''1.3.1.2.''' If such an extreme is not found, the program proceeds to step 2.<br /> ::'''1.3.2.''' Absolute extreme not found. This point 3 is discarded.'''<br /> ::Simultaneously with step 1, the program launches the search for the next potential point 3.</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_II&diff=174 2023-08-24T20:29:47Z

<p>Admin: </p> <hr /> <div>This article is not finished<br /> <br /> '''The N1 rule (N1 requirement) for Algorithm II is as follows:'''<br /> If point 3 is low, then the level of point 5 should be higher than point 1. <br /> If point 3 is high, then the level of point 5 should be lower than point 1.<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with UMG General Concepts.<br /> <br /> ==='''Step I. Search For Point 3 of the External Attraction Model (EAM) and the Sarting Point of the Previous Trend.'''===<br /> <br /> : '''1.1.''' The program looks for the first possible extreme, satisfying Single Bar Rule. Such an extreme is a candidate for potential point 3 ( potential t.3).<br /> <br /> : '''1.2.''' Next, the program checks the bars from right to left (i.e., in the past) from the bar containing the extreme candidate for point 3 to one of the following events:<br /> <br /> :: '''1.2.1.'''Found the last intersection (breakthrough) point by the price level of the candidate for point 3.<br /> ::In this case, the report displays: <br /> :: PREVdata: FullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.2.'''The program reached the starting point of the chart (i.e., the price did not intersect the level of point 3 after the starting point of the chart).<br /> ::In this case, the report displays: <br /> :: PREVdata: NoFullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.1.'''The price checked 300 bars preceding point 3, but the level of step 3 did not intersect at this segment. The program looks for an absolute extreme (opposite to step 3) on the segment from the 300th bar before point 3 to point 3. The program proceeds to substep 1.3.<br /> <br /> : '''1.3.'''The program looks for an absolute extreme (opposite to point 3 extreme) on the segment:<br /> ::- from the last intersection by the price level of the candidate for point 3 (inclusive) (if coming from 1.2.1.), or :: - from the starting point of the chart (if coming from 1.2.2.), or :: - from 300 bars to point 3 (if coming from 1.2.3.) :: to point 3 (excluding).<br /> :: '''1.3.1.'''Absolute extreme found. The candidate for point 3 is confirmed; moreover, the found confirming extreme is the assumed (if coming from 1.2.2. or 1.2.3.) starting point of the preceding trend.'''<br /> ::The program checks for the absence of extremes equal to point 3 between the assumed starting point of the previous trend and point 3. <br /> :::'''1.3.1.1.''' If such an extreme is found, this candidate for point 3 is discarded, and this point 3 is discarded. <br /> :::'''1.3.1.2.''' If such an extreme is not found, the program proceeds to step 2.<br /> ::'''1.3.2.'''Absolute extreme not found. This point 3 is discarded.'''<br /> ::Simultaneously with step 1, the program launches the search for the next potential point 3.</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_I&diff=173 2023-08-24T20:21:48Z

<p>Admin: /* Step VII. Determination of SP and Model Type. */</p> <hr /> <div> '''The N1 rule (N1 requirement) for Algorithm I is as follows:'''<br /> If point 1 is low, then the level of point 3 should be equal to or higher than point 1. <br /> If point 1 is high, then the level of point 3 should be equal to or lower than point 1.<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with [[UMG General Concepts]].<br /> <br /> <br /> ==='''Step I. Find Point 1. Search for a Confirming Extreme.'''===<br /> : '''1.1.''' The program searches for the first possible extreme that satisfies Single Bar Rule. This extreme is a candidate for point 1.<br /> : '''1.2.''' When a candidate for point 1 (hereinafter referred to as t.1 candifate) is found, all bars to the left (i.e., in the past) of the bar containing the t.1 candidate extreme are checked until one of the following events occurs:<br /> :: '''1.2.1.''' The place of the last intersection of the price level of the t.1 candidate is found &lt;ref&gt;High or low equal to high or low of t.1 is an intersection&lt;/ref&gt;. In this case, the program searches for an absolute extreme that confirms point 1 from the intersection of the price with the t.1 candidate level (inclusive) to the bar of t.1 candidate (exclusive). There are two possibilities:<br /> ::: '''1.2.1.1.''' If the extreme is not found, the program searches for a new candidate for point 1.<br /> ::: '''1.2.1.2.''' If the absolute extreme is found, it is the beginning of the preceding trend. The point 1 is confirmed. <br /> ::: The program checks for the absence of extremes equal to point 1 from the Beginning of the preceding trend. <br /> :::: '''1.2.1.2.1.''' If such an extreme is found, this candidate for point 1 is discarded (the program continues to process other t.1 candidates).<br /> :::: '''1.2.1.2.2.''' If such an extreme is not found, the program proceeds to process the next bar after point 1 according to point 2 of the Algorithm.<br /> :: '''1.2.2.''' The program has reached the starting point of the chart (i.e., after the starting point of the chart, the levels of points 1 and 2 have never intersected). The program searches for a confirming extreme from right to left to the starting point of the chart. The options are similar to the sub-steps 1.2.1.1. and 1.2.1.2.<br /> :: '''1.2.3.''' The program has checked 50 bars &lt;ref&gt;The depth of the search for the extreme confirming point 1&lt;/ref&gt; preceding the bar of the potential point 1, and none of the above events have occurred. The program searches for a confirming extreme from right to left in the area of 50 bars before the potential point 1. The options are similar to the sub-steps 1.2.1.1. and 1.2.1.2.<br /> <br /> ==='''Step II. Searching for Points 3 and 2.'''===<br /> If the program returns to this step during the construction of an alternative model, this branch of the algorithm stops.<br /> <br /> The bar being analyzed after point 1 (or in cases of repeated application of the step specified in the algorithm) is checked for non-exceedance of the level of point 1.<br /> : '''2.1.''' If the level of point 1 is exceeded, the program discards this point 1.<br /> : '''2.2. Searching for Point 3.''' If the level of point 1 is not exceeded, the bar being analyzed is checked by rule N1 as an extreme.<br /> :: '''2.2.1.''' If this bar is not an extreme according to rule N1 (as a potential point 3)&lt;ref&gt; Here and further under the formulation (as a potential T.3) a reminder is implied that this extremum should be aligned with the potential T.1. (see the Rule of alternating extremes).&lt;/ref&gt;, the program checks the next bar in accordance with step 2.<br /> :: '''2.2.2.''' If this bar is an extreme according to rule N1 (as a potential point 3), then<br /> ::: '''2.2.2.1.''' If this step (step 2) is applied again after confirmed candidates for point 3 have been found (i.e., such point 3, for which there is a point 2 between point 3 and point 1), but for one reason or another they were rejected, and the algorithm returned to the search for point 3, then the exceedance of the level of the previous candidate for point 3 by this extreme is checked.<br /> :::: '''2.2.2.1.A.''' If the check is not passed (i.e., if the level of the previous candidate for point 3 is not exceeded), then the program processes the next bar in accordance with this step (step 2) and further according to the algorithm.<br /> :::: '''2.2.2.1.B.''' If the check is passed, then the program proceeds to sub-step 2.2.2.2.<br /> ::: '''2.2.2.2. Searching for Point 2.''' The program searches for an absolute minimum (if point 1 and point 3 are high) or maximum (if point 1 and point 3 are low) in the range from point 1 to point 3 (hereinafter segment 1-3) as point 2 (hereinafter point 2). Then this bar is checked for &quot;extremity&quot; according to N1 rule. Two variants are possible &lt;ref&gt;As part of this particular check, it should be noted that bars T.1 and T.3 should not reach the level of T.2&lt;/ref&gt;:<br /> :::: '''2.2.2.2.A.''' If the bar is an extreme, then this is a potential point 2, and the potential point 3 becomes a confirmed point 3. In this case, the program proceeds to step 3.<br /> :::: '''2.2.2.2.B.''' The bar is not an extreme. In this case, the program begins to search for another candidate for point 3, for which it returns to the beginning of step 2.<br /> <br /> If the program has processed 50 bars &lt;ref&gt;The range of continuous search is t.3 in one iteration for all models except EAM&lt;/ref&gt; in a row in accordance with this step (step 2), and potential points 2 and 3 have not been found (i.e., the program has not yet moved to another step of the algorithm), then this potential point 1 is discarded.<br /> <br /> If there are 150 or more bars &lt;ref&gt;Maximum search range t3 for all models except EAM&lt;/ref&gt; between the potential point 1 and the bar being analyzed, and the program has not yet moved to another step of the algorithm, this potential point 1 is discarded.<br /> <br /> ==='''Step III. Building TL. Search for t.4'''===<br /> : '''3.1. Checking for Fragmentation of the Base:''' After finding candidates for points 1, 2, and 3, a check is performed for the fragmentation of the Base. This means that there should be no extremes, co-directed with t.1, between the levels of t.1 and t.3 (Extremes that Fragment the Base, hereinafter referred to as EFB).<br /> <br /> :: '''3.1.1:''' If such extremes are present, the program checks each EFB for the presence of a confirming counter-directed extreme on the section from the last intersection of the price level of the EFB to the EFB (analogous to the search for a confirming extreme of a potential t.1 in sub-step 1.2.1). If the EFB does not have a confirming extreme, then such an EFB is no longer considered (i.e., if there are no EFBs with confirming extremes, then the check is passed). If there is at least 1 EFB with a confirming extreme, then:<br /> :: - The Base is fragmented;<br /> :: - The confirmed t.3 becomes a cancelled t.3;<br /> :: The program searches for a new t.3, for which it processes the next bar after the bar of the last cancelled t.3 according to step 2 of the algorithm.<br /> :: '''3.1.2:''' If the check is successful and no EFBs are found (including if there are no confirmed EFBs), then the program proceeds to sub-step 3.2.<br /> <br /> <br /> :'''3.2. Building and Checking TL on the 1-3 Section'''<br /> : '''Determining the Section on Which t.3' Can Be Found'''<br /> : '''Searching for t.3'.'''<br /> :The parameters of the Trend Line passing through t.1 and t.3 (hereinafter TL) are calculated. TL is checked for breakthroughs on the 1-3 section.<br /> :: '''3.2.1.''' TL is Broken<br /> :: The bar of the confirmed t.3 is checked for breaking the level of t.2.<br /> ::: '''3.2.1.1.''' If the level of t.2 is broken by the bar of the confirmed t.3, the confirmed t.3 becomes a cancelled t.3. The program searches for a new t.3. To do this, the bar that broke the level of t.2 is processed according to sub-step 3.4.<br /> ::: '''3.2.1.2.''' If the level of t.2 is not broken by the bar of the confirmed t.3, then the next bar is processed according to sub-step 3.2.3.<br /> :: '''3.2.2.''' TL is Not Broken - the bar following the bar of the confirmed t.3 is processed according to sub-step 3.3.<br /> <br /> ::'''3.2.3. Determining the Section on Which t.3' Can Be Found'''<br /> ::The analyzed bar is checked for breaking the level of the confirmed t.3.<br /> ::: '''3.2.3.1.''' If the level of the confirmed t.3 is broken, the confirmed t.3 becomes a cancelled t.3. The program searches for a new t.3. For this, the bar that broke the level of the confirmed t.3 is processed according to step 2 and further according to the algorithm.<br /> ::: '''3.2.3.2.''' If the level of t.3 is not broken, the program checks the analyzed bar for breaking the level of t.2.<br /> :::: '''3.2.3.2.1.''' If the level of t.2 is not broken, the program analyzes the next bar according to sub-step 3.2.3.<br /> :::: '''3.2.3.2.2. Searching for t.3'.'''<br /> :::: If it breaks the level of t.2, then the program looks for such a point 3' (hereinafter t.3') through which a line can be drawn from t.1 to t.3', which will not contain extra touches by the price on the section from the bar of t.1 to the bar following the bar of t.3' (inclusive), and this line should not contain extra breakthroughs (not touches) by the price on the section to the bar that broke the level of t.2 (not inclusive).<br /> ::::: '''3.2.3.2.2.A.''' If t.3' is found, then the TL is rebuilt through t.3' (i.e., TL is now the line from t.1 to t.3'), and the algorithm searches for a potential t.4, for which it processes the bar that broke the level of t.2 (but if the bar that broke the level of t.2 coincides with the bar of t.3', then the program immediately proceeds to process the next bar) according to sub-step 3.4.<br /> ::::: '''3.2.3.2.2.B.''' If the point t.3' is not found, then the confirmed t.3 becomes a cancelled t.3. The program searches for a new t.3, for which it processes each previously unprocessed bar for the cancelled t.3 according to step 2 and further according to the algorithm. <br /> <br /> : If between t.1 and the analyzed bar there are 150 or more bars, and the program has not yet moved to another step of the algorithm, this potential t.1 is discarded.<br /> <br /> :'''3.3. Checking TL on the Section After t.3.'''<br /> : The analyzed bar is checked for overcoming TL.<br /> :: '''3.3.1. TL is not overcome''' - the analyzed bar is processed according to sub-step 3.4.<br /> :: '''3.3.2. TL is overcome.''' In this case, there are 2 options:<br /> ::: '''3.3.2.1.''' If between the analyzed bar (not inclusive) and the bar of t.3 (inclusive) the level of t.2 was not reached, the program performs a search for t.3', for which it moves to sub-step 3.2.3.<br /> ::: '''3.3.2.2.''' If between the analyzed bar (not inclusive) and the bar of t.3 (inclusive) the level of t.2 was reached, the program performs a search for a new candidate for t.3. For this, the analyzed bar is processed according to step 2 and further according to the algorithm.<br /> <br /> :'''3.4: Searching for Potential or Alternative t.4'''<br /> : If the program is searching for t.4 and the analyzed bar is further from t.1 than 5 times the distance between t.1 and t.3, then this potential t.1 is discarded.<br /> : If the program is searching for an alternative t.4 and the analyzed bar is further from t.1 than 10 times the number of bars between t.1 and t.3, then the search for an alternative t.4 is terminated.<br /> : The analyzed bar is checked for being an extreme according to rule N1 (as a potential t.4).<br /> <br /> ::'''Step 3.4.1: If the Bar is not an Extreme'''<br /> :: The program checks the analyzed bar for breaking through (in this case, not touching) the TL.<br /> ::: '''Step 3.4.1.1:''' If the TL is not reached (not broken), then the program processes the next bar according to step 3.4.<br /> ::: '''Step 3.4.1.2:''' If the TL is broken, then the analyzed bar is processed similarly to step 3.3.2.<br /> <br /> ::'''Step 3.4.2: If the Bar is an Extreme'''<br /> :: This is potentially t.4, proceed to step 3.5.<br /> <br /> :'''3.5. Checking the Position of t.4'''<br /> : The program checks the position of the potential t.4 relative to the extreme of t.2. There are 3 possible scenarios:<br /> :: '''3.5.1.''' The level of the potential t.4 is closer to the level of t.1 than the level of t.2. A candidate for t.4 for the Wedge model is found. In this case:<br /> ::: '''3.5.1.0.''' The bar of the potential t.4 is checked for the presence between it and the bar of t.3 of bars containing price values<br /> :::: more distant from t.3 than the value of the potential t.4, or<br /> :::: equal to t.4.<br /> :::: This is a check for the potential absoluteness of the extreme of the potential t.4. Possible options are:<br /> ::::: '''3.5.1.0.1.''' The potential t.4 is not a potentially absolute extreme (there are bars more distant from t.3). In this case, the next bar is processed according to sub-step 3.4.<br /> ::::: '''3.5.1.0.2.''' The potential t.4 is a potentially absolute extreme. In this case checking if t.2-t.4 line (this is the Aims Line, hereinafter - AL) is crossed by the price in the section between t.2 and t.4 (hereinafter - section 2-4). There are 2 options – 3.5.1.1. and 3.5.1.2.<br /> :::::: '''3.5.1.1.''' If AL is crossed, the program checks the analyzed bar for reaching the TL.<br /> :::::::: '''3.5.1.1.1.''' If the TL is not reached - the next bar is processed according to sub-step 3.4.<br /> :::::::: '''3.5.1.1.2.''' If the TL is reached, the program searches for a new candidate in t.3/t.3'. To do this, the analyzed bar is processed according to sub-step 3.2.3 and further according to the algorithm.<br /> :::::: '''3.5.1.2.''' If there is no linecrossing, the bar t.4 is checked for reaching the TL. The following options are possible:<br /> :::::::: '''3.5.1.2.1.''' If the bar t.4 reached the TL, then the [Wedge Found] Wedge model is fixed, for which the level of intersection of the TL and the AL is calculated, after which the program searches for t.3’ with the same points 1,2,3, or searches for a new t.3. To do this, the program processes the analyzed bar (in this case, the bar t.4, while reaching the TL) starting from sub-step 3.2.3. Model's Type (parameter G1) = WEDGE . <br /> :::::::: '''3.5.1.2.2.''' If the t.4 bar did not reach the TL, then the next bar after it (and when reapplying this step - the next bar after the previously analyzed bar) is analyzed for reaching the TL. At the same time, a check is made for not overcoming the distance equal to (t.1-t.3)*10. If the distance is overcome, then we return (go in a cycle) to the search for t.3. The following options are possible:<br /> :::::::::: '''3.5.1.2.2.1.''' If the analyzed bar reached the TL, then the program acts in analogy with sub-step 3.5.1.2.1. (i.e., the [Wedge Found] Wedge model is fixed and in a new branch of the algorithm the program processes the analyzed bar (in this case, the bar that reached the TL) starting from sub-step 3.2.3.<br /> :::::::::: '''3.5.1.2.2.2.''' If the TL is not reached, then the analyzed bar is checked for reaching the level of t.4. The following options are possible:<br /> :::::::::::: '''3.5.1.2.2.2.A.''' If the level of t.4 is not reached, the program analyzes the next bar for reaching the TL, options are similar to sub-steps 3.5.1.2.2.1. and 3.5.1.2.2.2.<br /> :::::::::::: '''3.5.1.2.2.2.B.''' If the level of t.4 is reached, then the program checks the analyzed bar according to sub-step 3.4.<br /> :: '''3.5.2.''' The level of the potential t.4 is further from the level of t.1 than the level of the potential t.2 - transition to step 4.<br /> :: '''3.5.3.''' The level of the potential t.4 is equal to the level of the potential t.2 - the program checks whether the bar of the considered candidate in t.4 has broken through (touched) the Trend Line (TL).<br /> ::: '''3.5.3.1. If not''' - the program searches for the next candidate for t.4. For this, the program processes the next bar according to sub-step 3.4.<br /> ::: '''3.5.3.2. If yes''' – the program searches for a new t.3, for which it analyzes the next bar according to step 2 and further according to the algorithm.<br /> <br /> <br /> ==='''Step IV. Checking for Intersection of the Aim Line (AL) by Price on Section 2-4'''===<br /> The program checks for intersections of the Aim Line by price on the section from t.2 to t.4 (hereafter - section 2-4).<br /> : '''4.1.''' If the AL is intersected by price on section 2-4 the program checks the analyzed bar (which is also the bar of the potential t.4) for a breakout (in this case, not a touch) of the Trend Line (TL).<br /> :: '''4.1.1.''' If the TL is not reached, the program processes the next bar according to step 3.4.<br /> :: '''4.1.2.''' If the TL is broken,<br /> ::: - t.3 becomes the cancelled t.3;<br /> ::: - the program searches for a new candidate for t.3. To do this, the analyzed bar is processed according to step 2.<br /> : '''4.2.''' If the AL is not intersected by price on section 2-4 the program proceeds to step 5.<br /> <br /> <br /> ==='''Step V. Model Fixation at the TL Breakthrough. Search for t.5. Search for t.6.'''===<br /> <br /> 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:<br /> <br /> : '''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.<br /> :: '''5.1.1.''' If the level of t.4 is not surpassed, then the model is considered formed [The model is formed without 6];<br /> :: Then the program proceeds to step 6.<br /> <br /> :: '''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).<br /> :: 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).<br /> <br /> ::: '''5.1.2.1.''' If the extreme is found - this is a potential t.5.<br /> ::: There are 2 scenarios:<br /> :::: '''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:<br /> ::::: '''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.<br /> ::::: There are 2 scenarios:<br /> ::::::: '''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.<br /> ::::::: '''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.<br /> <br /> ::::: '''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.<br /> <br /> :::: '''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.<br /> <br /> ::: '''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.<br /> <br /> : '''5.2.''' LT 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:<br /> <br /> : for extremity according to rule N1 (as t.5);<br /> : 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<br /> :-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).<br /> :: '''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:<br /> ::: '''5.2.1.1.''' If the level of t.4 is reached (confirmed by the bar of the potential t.5)<br /> ::: 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:<br /> ::: There are 2 scenarios:<br /> :::: '''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:<br /> ::::: '''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.<br /> ::::: '''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.<br /> <br /> :::: '''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. <br /> :::: The program proceeds to step 6. (there was an idea to redo to step 5.3.)<br /> <br /> ::: '''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.<br /> <br /> :: '''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.<br /> ::: '''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:<br /> :::: '''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.)<br /> :::: '''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.<br /> <br /> ::: '''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).<br /> <br /> '''5.3.''' Algorithm for determining the presumed real p.6:<br /> <br /> : '''5.3.1.''' Apply Algorithm I to the models, excluding AM.<br /> : 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.<br /> :The extremum identified in step 2 is considered the real t.6.<br /> :Instead of x's representing price value or time and date, the report displays the following:<br /> : P6: xxxxx (price value)<br /> : P6t: xx:xx:xxxx (time and date)<br /> <br /> :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.<br /> :P6supp: -<br /> :P6suppt: -<br /> <br /> : '''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.<br /> :: '''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.<br /> :: The report should display the following information:<br /> :: P6: --<br /> :: P6t: -- <br /> :: P6supp: --<br /> :: P6suppt: --<br /> <br /> ::: '''5.3.2.2.''' If the number of bars formed after t.4 does not exceed 300, several scenarios are possible.<br /> :::: '''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.<br /> :::: 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.<br /> :::: The program then checks if the price has surpassed this level in the section after t.4 of the analyzed model.<br /> <br /> :::: '''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. The report shows the following data:<br /> <br /> :::: P6: --<br /> :::: P6t: -- <br /> :::: P6supp: --<br /> :::: P6suppt: --<br /> <br /> :::: '''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. In this situation, the report will show the following information instead of x's (which represent either price value or time and date):<br /> <br /> :::: P6: --<br /> :::: P6t: -- <br /> :::: Additionally, the report will display the following details related to the presumed real p.6:<br /> :::: P6supp (the price value)<br /> :::: P6suppt (a specific time and date in the format xx:xx:xxxx)<br /> <br /> ::: '''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. In this scenario, the report displays the following:<br /> ::: P6: --<br /> ::: P6t: -- <br /> ::: Additionally, the report will display the following details related to the presumed real p.6:<br /> ::: P6supp (the price value)<br /> ::: P6suppt (a specific time and date in the format xx:xx:xxxx)<br /> <br /> :: '''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.<br /> <br /> : '''5.4.''' Algorithm for Determining Whether the Model is from the Start of the Trend Model or Along the Trend (Trend-Following) Model<br /> <br /> :: '''5.4.1.''' For main models except for EAM <br /> :: 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 .<br /> <br /> ::* 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.<br /> ::* If the intersection lies to the left of the (presumed) starting point of the preceding trend (related to this model), the report displays: <br /> :: G3: HTModel<br /> :: * 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: <br /> :: G3: BTModel<br /> :: * 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: <br /> :: G3: NoData<br /> <br /> :: '''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.<br /> <br /> :The program proceeds to step 6.<br /> <br /> <br /> <br /> ==='''Step VI. Search for Tangents and Construction of the Auxiliary Attraction Model'''===<br /> <br /> : '''6.1.''' Search for t.2’<br /> <br /> : The program conducts a search for t.2’ (tangent, i.e., the rule N1 is removed for it), which will yield the LC, without any intersections with the price in the section between T.1 and T.2. Bars are checked from right to left starting from the bar t.2 to the bar t.1 inclusive (further – section 1-2). Point 2’ (further – t.2’) can coincide with t.2, if the LC through t.2 does not have extra price intersections on 1-2, however t.2’ cannot belong to the bar t.1.<br /> <br /> :: '''6.1.1.''' If t.2’ is found <br /> <br /> :: If t.2’ is found (including if t.2’ coincides with t.2), then the program calculates the Line of goals by the tangent from t.2’ to t.4 (further -AL’). It is then checked whether the considered model has the status [The model is formed without point 6].<br /> <br /> ::: '''6.1.1.1.''' The model has the status [The model is formed without point 6] <br /> <br /> ::: If the model has the status [The model is formed without point 6], the program proceeds to step 7.<br /> <br /> ::: '''6.1.1.2.''' The model does not have the status [The model is formed without point 6] <br /> <br /> ::: If the model does not have the status [The model is formed without point 6], the program proceeds to sub-step 6.2.<br /> <br /> ::: '''6.1.2.''' If T.2’ is not found <br /> <br /> ::: If t.2’ is not found (i.e., it is impossible to build such a line through points t.2’ and t.4, which will not contain extra points on section 1-2), then this is a model without an Auxiliary AM. Theprogram proceeds to step 7.<br /> <br /> :: '''6.2.''' Search for t.3’ of the Auxiliary AM <br /> <br /> :: The program constructs a line from t.3 (or t.3’ if it exists) to t.5 (Trend Line of the Auxiliary Attraction Model, further - TLam) and checks it for the presence of price intersections in the section between t.3 and t.5.<br /> <br /> ::: '''6.2.1.''' Intersections are found <br /> <br /> ::: If intersections are found, the line t.3/t.3’-t.5 in this case is not displayed on the chart. The program searches for such point 3’ of the Auxiliary Attraction Model (further t.3’am), through which it is possible to construct a line, which will not have price intersections on the section from t.3/t.3’ to t.5.<br /> <br /> :::: '''6.2.1.1.''' If t.3’am is found<br /> <br /> :::: If t.3’am is found, then the program constructs the Line of trend of the auxiliary model of attraction by the tangent from t.3’am to t.5 (further – TLam’) and calculates the level of intersection of AL’ and TLmp’ (further – calculated t.6). There are 2 options:<br /> <br /> :::: '''6.2.1.1.1.''' If the calculated t.6 is found<br /> <br /> :::: If the calculated t.6 is found, then a check is carried out for the minimum ratio of the time segment t.2-t.4 to the segment t.4-t.6 for the Auxiliary AM (should be within 0.5). If the check is not passed, then the model does not have an auxiliary MP (in this case LTmp is not displayed on the chart), the algorithm proceeds to sub-step 6.3. If the check is passed, the program checks whether the bar t.5 breaks through the level of the calculated p.6.<br /> <br /> ::::: '''6.2.1.1.1.A.''' If the bar t.5 does not break through the level of the calculated p.6 <br /> <br /> ::::: If the t.5 bar does not break through the level of the calculated p.6, then the program proceeds to sub-step 6.3. In the report is displayed: AUX AM<br /> <br /> ::::: '''6.2.1.1.1.B.''' If the t.5 bar breaks through the level of the calculated p.6<br /> <br /> ::::: If the t.5 bar breaks through the level of the calculated p.6, then this AM cannot be built and the program is looking for a new t.4. for this the next bar is checked according to sub-step 3.4., or in case if the model has a mark draw_flag this branch of the algorithm stops.<br /> <br /> :::: '''6.2.1.1.2.''' The calculated point 6-th is not found<br /> <br /> :::: The calculated 6-th is not found (i.e., the lines do not intersect). In this case TLam is not displayed on the chart. In the report is displayed: AUX NoAM The program proceeds to sub-step 6.3.<br /> <br /> ::: '''6.2.1.2.''' If t.3’am is not found<br /> <br /> ::: If t.3’am is not found, then in the report is displayed: AUX NoAM The program proceeds to step 7.<br /> <br /> :: '''6.2.2.''' Intersections are not found <br /> <br /> :: Intersections are not found. In this case, the program calculates the level of intersection of TLam and AL’ (this is the level of the calculated p.6). There are 2 options according to sub-steps 6.2.1.1.1. and 6.2.1.1.2.<br /> <br /> : '''6.3.''' Construction of the Auxiliary AM through t.5<br /> <br /> : The program checks for the presence of t.5’ (the first possible local extremum in time on the section T.4-T.5). If T.5’ is found, in the report is displayed: AimsBlock5’ 5' If t.5’ is not, then in the report is displayed: AimsBlock5’ No5'<br /> <br /> : If t.5' is present, the program will follow a similar process as sub-step 6.2 to construct the Trend Line for the Auxiliary Attraction Model. However, this time it will start from t.5' and, if necessary, use another suitable t.3' (referred to as t.3'am5'). If the program successfully constructs a Auxiliary AM through t.5' (indicating convergence of the lines), the model will be labeled as [The AM is built through t.5'] in the report. <br /> : The report will display: <br /> : AUX5’: AUX5’<br /> : Alternatively, if the MP is not built through t.5', the program will display: <br /> : AUX5’: NoAUX5’ <br /> : After this, the program will proceed to step.7.<br /> <br /> <br /> ===''' Step VII. Determination of SP and Model Type.'''===<br /> The program recalls whether the model was built through t.2 or through t.2’<br /> : '''7.1.''' In case if AL is built through t.2 does not have intersection with the price on the section t.1-t.2, or if there is ALam, built through t.2’. Here and further it is assumed that if the line, built through t.2 to t.4 does not have intersections with the price on the section t.1-t.2, then it is considered that t.2’=t.2 and AL’=AL.<br /> <br /> : The type of the model is determined by the position of the intersection point of TL and AL’ (this is the line built from t.2’ to t.4) in relation to t.4:<br /> <br /> :: '''7.1.1.''' The intersection point of TL and AL’ lies to the right of t.4. In this case the intersection point of the lines is the calculated point 6 (further - calculated t.6).), then the program calculates the ratio of time segments from t.1 to t.4 and from t.4 to calculated point 6 for AM.<br /> <br /> ::: '''7.1.1.1.''' If the section from t.1 to t.4, multiplied by 3 is greater than the section from t.4 to the calculated point 6 for CMP, this model's type is AM.<br /> ::: G1: AM<br /> <br /> ::: If the model under consideration is AM and at the same time it is formed (i.e. after t.4 the TL is broken through), the program checks each bar after the t.4 bar, until one of the following events:<br /> <br /> :::: '''7.1.1.1.1.''' A bar is found that has reached the level of t.3 (but has not reached the level of t.4). In this case, this branch of the algorithm is completed.<br /> <br /> :::: '''7.1.1.1.2.''' A bar is found that has reached the level of t.4 (while either not reaching or reaching the level of t.3).<br /> <br /> :::: -in case of the presence of the draw_flag label – this branch stops;<br /> :::: -in another case, the program checks for the presence on the section from t.4 (not including) to the bar, which reached the level of t.4 (inclusive) of the extremum, opposite to the extremum t.4 (i.e. co-directed with the extremum t.1 of the analyzed model. There are 2 options:<br /> <br /> ::::: '''7.1.1.1.2.A.''' The extremum is found. In this case, the algorithm proceeds to step 8.<br /> <br /> ::::: '''7.1.1.1.2.B.''' The extremum is not found. In this case the status of the formed model is canceled (the model is discarded);<br /> ::::: -t.3 becomes the canceled t.3;<br /> ::::: -the program searches for the next candidate for t.3. For this, the program processes the bar that broke through the TL according to step 2.<br /> ::: '''7.1.1.2.''' If<br /> ::: -the section from t.1 to t.4, multiplied by 3 is less than or equal to the section from t.4 to the calculated t.6 (for converging lines) and at the same time<br /> ::: -the section from t.1 to t.4 multiplied by 12 is greater than the section t.4-t.6, this model is AM/DBM<br /> ::: G1: AM/DBM<br /> <br /> ::: '''7.1.1.3.''' The section from t.1 to t.4 multiplied by 12 is less than or equal to the section from SP to t.1 (for TL and AL converging to the left), then this model is DBM. <br /> ::: G1: DBM<br /> <br /> :: '''7.1.2.''' The intersection point of TL and AL’ (AL’ – this is the line from t.2’ – t.4) lies to the left of t.4 —this point is qualified as the Sacral Point (further – SP).<br /> <br /> ::: '''7.1.2.1.''' If<br /> ::: -the section from t.1 to t.4 multiplied by 3 is less than or equal to the section from SP to t.1, and at the same time;<br /> ::: -the section from t.1 to t.4 multiplied by 12 is greater than the section from SP to t.1 then this is EM/DBM <br /> ::: G1: EM/DBM<br /> <br /> ::: '''7.1.2.2.''' If the section from t.1 to t.4 multiplied by 3 is greater than the section from SP to t.1, this is eng. - EM.<br /> ::: G1: EM<br /> <br /> ::: '''7.1.2.3.''' If<br /> ::: -TL and AL of the model are parallel, or<br /> ::: -the section from t.1 to t.4 multiplied by 12 is less than or equal to the section t.4-t.6 (for TL and AL converging to the right);<br /> ::: -the section from t.1 to t.4 multiplied by 12 is less than or equal to the section from SP to t.1 (for TL and AL converging to the left), then this model is eng. - DBM <br /> ::: G1: DBM<br /> <br /> ::: The program proceeds to step 8.<br /> <br /> : '''7.2.''' If for this model it was impossible to construct AL (AL’) in such a way that there were no extra intersections on the section t.1 (inclusive) - t.2, then the program checks where TL and AL from t.2 intersect.<br /> <br /> :: '''7.2.1.''' If the lines intersect to the right (i.e. after t.4), then<br /> ::: '''7.2.1.1.''' if the section from t.1 to t.4, multiplied by 3 is greater than the section from t.4 to the calculated t.6 (for converging lines), then this model is incorrect.<br /> ::: There are one of 2 options:<br /> <br /> :::: '''7.2.1.1.1''' If the TL of the incorrect AM is broken through by the t.4 bar or the bar immediately following t.4, then<br /> <br /> :::: -in case of the presence of the draw_flag label – this branch stops;<br /> :::: -in another case t.3 becomes the canceled t.3 and the program searches for a new t.3, for this it processes the bar that broke through the TL AM according to step 2.<br /> :::: '''7.2.1.1.2.''' If the TL of the incorrect CMP is not broken through by the t.4 bar or the bar immediately following it, then the program searches for a new t.4, for this the next bar is checked according to sub-step 3.4.<br /> <br /> ::: '''7.2.1.2.''' -the section from t.1 to t.4, multiplied by 12 is greater than the section from t.4 to the calculated t.6, then this model is AM/DBM .<br /> ::: G1: AM/DBM<br /> <br /> ::: '''7.2.1.3.''' the section from t.1 to t.4 multiplied by 12 is less than or equal to the section from t.4 to t.6 then this model is DBM .<br /> ::: G1: DBM<br /> <br /> :: '''7.2.2.''' If TL and AL intersect to the left (i.e. in the past) relative to t.4, the program performs an indirect check for the Strength of the trend. For this, a pseudo SP is used – this is the intersection point of AL (built through t.2) and TL in case it is impossible to build AL through t.2 so that there are no extra points on it. The following options are possible:<br /> <br /> ::: '''7.2.2.1.''' If the pseudo SP lies to the right (i.e. later) of t.1 to t.3 (or t.3’, if the model is built on it), then the type of this model is determined as EM, moreover, the model is strong by pseudo SP.<br /> <br /> ::: G1: EM<br /> <br /> ::: SP: strongpseudoSP<br /> <br /> ::: '''7.2.2.2.''' Otherwise<br /> ::: If the lines intersect to the left of t.1 (i.e. earlier), the following options are possible:<br /> <br /> :::: '''7.2.2.2.1.''' If the section from t.1 to t.3 (3’) is greater than the section from the intersection of TL and AL to t.1, the model is assigned the type EM, while the Strength of the model is not determined.<br /> :::: G1: EM<br /> <br /> :::: SP: undef<br /> <br /> :::: '''7.2.2.2.2.''' If<br /> :::: -the section from T.1 to t.3(3’) is less than or equal to the section from the intersection of TL and AL to t.1 and up to<br /> :::: -the section from T.1 to t.3(3’) multiplied by 3 is greater than the section from the intersection of TL and AL to t.1, the model is assigned the type is EM. At the same time, the model is weak.<br /> <br /> :::: G1: EM<br /> <br /> :::: SP: weakpseudoST<br /> <br /> :::: '''7.2.2.2.3.''' If the section from t.1 to t.3(3’) multiplied by 3 is less than the section from the intersection of TL and AL to t.1, then the model type is EM/DBM.<br /> :::: G1: EM/DBM<br /> <br /> : '''7.3.''' Also, occasionally there are cases when the model for some reason does not fall under any of the above options. Then the model type is not determined.<br /> <br /> === '''Step VIII: Search for Alternative Models. Launching a New Branch from the Previous t.1 but with a Different t.3 '''===<br /> <br /> The program initiates a search for the subsequent model with the same t.1, but a new t.3. The bar following t.3/t.3’, according to step 2, is analyzed for this purpose. Concurrently, the program initiates a search for an alternative model in relation to the one already found. For this, it analyzes the bar that has broken through the level of t.4 as a potential t.4, according to step 3.4, and continues further according to the algorithm.<br /> <br /> <br /> ==References==<br /> &lt;references /&gt;</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_II&diff=172 2023-08-24T20:17:09Z

<p>Admin: </p> <hr /> <div>This article is not finished<br /> <br /> '''The N1 rule (N1 requirement) for Algorithm II is as follows:'''<br /> If point 3 is low, then the level of point 5 should be higher than point 1. <br /> If point 1 is high, then the level of point 5 should be lower than point 1.<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with UMG General Concepts.<br /> <br /> ==='''Step I. Search For Point 3 of the External Attraction Model (EAM) and the Sarting Point of the Previous Trend.'''===<br /> <br /> : '''1.1.''' The program looks for the first possible extreme, satisfying Single Bar Rule. Such an extreme is a candidate for potential point 3 ( potential t.3).<br /> <br /> : '''1.2.''' Next, the program checks the bars from right to left (i.e., in the past) from the bar containing the extreme candidate for point 3 to one of the following events:<br /> <br /> :: '''1.2.1.'''Found the last intersection (breakthrough) point by the price level of the candidate for point 3.<br /> ::In this case, the report displays: <br /> :: PREVdata: FullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.2.'''The program reached the starting point of the chart (i.e., the price did not intersect the level of point 3 after the starting point of the chart).<br /> ::In this case, the report displays: <br /> :: PREVdata: NoFullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.1.'''The price checked 300 bars preceding point 3, but the level of step 3 did not intersect at this segment. The program looks for an absolute extreme (opposite to step 3) on the segment from the 300th bar before point 3 to point 3. The program proceeds to substep 1.3.<br /> <br /> : '''1.3.'''The program looks for an absolute extreme (opposite to point 3 extreme) on the segment:<br /> ::- from the last intersection by the price level of the candidate for point 3 (inclusive) (if coming from 1.2.1.), or :: - from the starting point of the chart (if coming from 1.2.2.), or :: - from 300 bars to point 3 (if coming from 1.2.3.) :: to point 3 (excluding).<br /> :: '''1.3.1.'''Absolute extreme found. The candidate for point 3 is confirmed; moreover, the found confirming extreme is the assumed (if coming from 1.2.2. or 1.2.3.) starting point of the preceding trend.'''<br /> ::The program checks for the absence of extremes equal to point 3 between the assumed starting point of the previous trend and point 3. <br /> :::'''1.3.1.1.''' If such an extreme is found, this candidate for point 3 is discarded, and this point 3 is discarded. <br /> :::'''1.3.1.2.''' If such an extreme is not found, the program proceeds to step 2.<br /> ::'''1.3.2.'''Absolute extreme not found. This point 3 is discarded.'''<br /> ::Simultaneously with step 1, the program launches the search for the next potential point 3.</div>

Admin http://wiki.marketpawns.com/index.php?title=ALGORITHM_II&diff=171 2023-08-24T20:13:24Z

<p>Admin: </p> <hr /> <div>This article is not finished<br /> <br /> '''The N1 rule (N1 requirement) for Algorithm II is as follows:'''<br /> If point 3 is low, then the level of point 5 should be higher than point 1. <br /> If point 1 is high, then the level of point 5 should be lower than point 1.<br /> <br /> For an accurate understanding of the algorithm, you should get acquainted with UMG General Concepts.<br /> <br /> ==='''STEP I. SEARCH FOR POINT 3 OF THE EXTERNAL ATTRACTION MODEL (EAM) AND THE STARTING POINT OF THE PREVIOUS TREND.'''===<br /> <br /> : '''1.1.''' The program looks for the first possible extreme, satisfying Single Bar Rule. Such an extreme is a candidate for potential point 3 ( potential t.3).<br /> <br /> : '''1.2.''' Next, the program checks the bars from right to left (i.e., in the past) from the bar containing the extreme candidate for point 3 to one of the following events:<br /> <br /> :: '''1.2.1.'''Found the last intersection (breakthrough) point by the price level of the candidate for point 3.<br /> ::In this case, the report displays: <br /> :: PREVdata: FullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.2.'''The program reached the starting point of the chart (i.e., the price did not intersect the level of point 3 after the starting point of the chart).<br /> ::In this case, the report displays: <br /> :: PREVdata: NoFullDataPrev <br /> :: The program proceeds to substep 1.3.<br /> :: '''1.2.1.'''The price checked 300 bars preceding point 3, but the level of step 3 did not intersect at this segment. The program looks for an absolute extreme (opposite to step 3) on the segment from the 300th bar before point 3 to point 3. The program proceeds to substep 1.3.<br /> <br /> : '''1.3.'''The program looks for an absolute extreme (opposite to point 3 extreme) on the segment:<br /> ::- from the last intersection by the price level of the candidate for point 3 (inclusive) (if coming from 1.2.1.), or :: - from the starting point of the chart (if coming from 1.2.2.), or :: - from 300 bars to point 3 (if coming from 1.2.3.) :: to point 3 (excluding).<br /> :: '''1.3.1.'''Absolute extreme found. The candidate for point 3 is confirmed; moreover, the found confirming extreme is the assumed (if coming from 1.2.2. or 1.2.3.) starting point of the preceding trend.'''<br /> ::The program checks for the absence of extremes equal to point 3 between the assumed starting point of the previous trend and point 3. <br /> :::'''1.3.1.1.''' If such an extreme is found, this candidate for point 3 is discarded, and this point 3 is discarded. <br /> :::'''1.3.1.2.''' If such an extreme is not found, the program proceeds to step 2.<br /> ::'''1.3.2.'''Absolute extreme not found. This point 3 is discarded.'''<br /> ::Simultaneously with step 1, the program launches the search for the next potential point 3.</div>

Admin