ALGORITHM I - Revision history

46.39.45.129: small fix

2025-10-05T16:19:38Z

small fix

← Older revision		Revision as of 19:19, 5 October 2025
Line 293:		Line 293:
	:: '''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.		:: '''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.

	::: '''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.		::: '''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 AM, this model's type is AM.
	::: G1: AM		::: G1: AM

Admin: /* Step V. Model Fixation at the TL Breakthrough. Search for t.5. Search for t.6. */

2024-01-04T20:59:18Z

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

← Older revision		Revision as of 23:59, 4 January 2024
Line 179:		Line 179:
	: 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.		: Identify the price value that is farthest from the t.1 level, which is the level the price reached from t.3 to the first time the price touches the TL (referred to as the touch of TL). The touch of ЛТ occurs after t.4, indicating the moment when the model is formed.
	:The extremum identified in step 2 is considered the real t.6.		:The extremum identified in step 2 is considered the real t.6.
	~~:Instead of x's representing price value or time and date, the report displays the following:~~
	~~: P6: xxxxx (price value)~~
	~~: P6t: xx:xx:xxxx (time and date)~~

	: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.		: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.
	~~:P6supp: -~~
	~~:P6suppt: -~~

	: '''5.3.2.''' If the price has not touched ЛТ after t.4 of the analyzed model at the moment of determining the presumed real p.6, the program will check if the number of bars formed after t.4 is more than 300.		: '''5.3.2.''' 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.

Admin: /* Step V. Model Fixation at the TL Breakthrough. Search for t.5. Search for t.6. */

2024-01-04T20:57:27Z

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

← Older revision		Revision as of 23:57, 4 January 2024
Line 149:		Line 149:
	::: '''5.1.2.2.''' The extreme is not found, the program is looking for the next candidate for t.4. To do this, the program processes the bar that has surpassed the level of the potential t.4 according to step 3.4.		::: '''5.1.2.2.''' The extreme is not found, the program is looking for the next candidate for t.4. To do this, the program processes the bar that has surpassed the level of the potential t.4 according to step 3.4.

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

	: for extremity according to rule N1 (as t.5);		: for extremity according to rule N1 (as t.5);

Admin: /* Step V. Model Fixation at the TL Breakthrough. Search for t.5. Search for t.6. */

2024-01-04T20:56:52Z

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

← Older revision		Revision as of 23:56, 4 January 2024
Line 189:		Line 189:
	: '''5.3.2.''' If the price has not touched ЛТ after t.4 of the analyzed model at the moment of determining the presumed real p.6, the program will check if the number of bars formed after t.4 is more than 300.		: '''5.3.2.''' If the price has not touched ЛТ after t.4 of the analyzed model at the moment of determining the presumed real p.6, the program will check if the number of bars formed after t.4 is more than 300.
	:: '''5.3.2.1.''' If the number of bars formed after t.4 exceeds 300, the presumed real p.6 for this model will not be determined.		:: '''5.3.2.1.''' If the number of bars formed after t.4 exceeds 300, the presumed real p.6 for this model will not be determined.
	~~:: The report should display the following information:~~
	~~:: P6: --~~
	~~:: P6t: --~~
	~~:: P6supp: --~~
	~~:: P6suppt: --~~

	::: '''5.3.2.2.''' If the number of bars formed after t.4 does not exceed 300, several scenarios are possible.		::: '''5.3.2.2.''' If the number of bars formed after t.4 does not exceed 300, several scenarios are possible.
Line 200:		Line 195:
	:::: The program then checks if the price has surpassed this level in the section after t.4 of the analyzed model.		:::: The program then checks if the price has surpassed this level in the section after t.4 of the analyzed model.

	:::: '''5.3.2.2.2.''' If the price has reached t.4 level, the report does not provide information on the presumed real p.6. ~~The report shows the following data:~~		:::: '''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.

	:::: ~~P6: --~~		:::: '''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.
	~~:::: P6t: --~~
	~~:::: P6supp: --~~
	~~:::: P6suppt: --~~

	:::: '''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):		::: '''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.

	~~:::: P6: --~~
	~~:::: P6t: --~~
	~~:::: Additionally, the report will display the following details related to the presumed real p.6:~~
	~~:::: P6supp (the price value)~~
	~~:::: P6suppt (a specific time and date in the format xx:xx:xxxx)~~

	::: '''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:~~
	~~::: P6: --~~
	~~::: P6t: --~~
	~~::: Additionally, the report will display the following details related to the presumed real p.6:~~
	~~::: P6supp (the price value)~~
	~~::: P6suppt (a specific time and date in the format xx:xx:xxxx)~~

	:: '''5.3.3.''' For AM the process is similar, but with one key difference. The TL is not used when determining the real or presumed p.6. Instead, the level of t.3 of the model under consideration is used to determine the real or presumed p.6.		:: '''5.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.
Line 240:		Line 219:

	:The program proceeds to step 6.		:The program proceeds to step 6.



	==='''Step VI. Search for Tangents and Construction of the Auxiliary Attraction Model'''===		==='''Step VI. Search for Tangents and Construction of the Auxiliary Attraction Model'''===

Admin at 20:20, 25 August 2023

2023-08-25T20:20:07Z

← Older revision		Revision as of 23:20, 25 August 2023
Line 1:		Line 1:
	'''The N1 rule (N1 requirement) for Algorithm I is as follows:'''		'''The Orientaion rule (N1 requirement) for Algorithm I is as follows:'''
	If point 1 is low, then the level of point 3 should be equal to or higher than point 1.		If point 1 is low, then the level of point 3 should be equal to or higher than point 1.
	If point 1 is high, then the level of point 3 should be equal to or lower than point 1.		If point 1 is high, then the level of point 3 should be equal to or lower than point 1.

Admin: /* Step VII. Determination of SP and Model Type. */

2023-08-24T20:21:48Z

Step VII. Determination of SP and Model Type.

← Older revision		Revision as of 23:21, 24 August 2023
Line 315:		Line 315:
	===''' Step VII. Determination of SP and Model Type.'''===		===''' Step VII. Determination of SP and Model Type.'''===
	The program recalls whether the model was built through t.2 or through t.2’		The program recalls whether the model was built through t.2 or through t.2’
	: '''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’=t2 and AL’=AL.		: '''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.

	: 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:		: 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:

	:: '''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 t.6 for AM.		:: '''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.

	::: '''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 T.6 for CMP, this model is AM.		::: '''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.
	::: G1: AM		::: G1: AM

Admin at 20:10, 24 August 2023

2023-08-24T20:10:06Z

← Older revision		Revision as of 23:10, 24 August 2023
Line 7:		Line 7:

	==='''Step I. Find Point 1. Search for a Confirming Extreme.'''===		==='''Step I. Find Point 1. Search for a Confirming Extreme.'''===
	: '''1.1.''' The program searches for the first possible extreme that satisfies ~~N1 rule~~. This extreme is a candidate for point 1.		: '''1.1.''' The program searches for the first possible extreme that satisfies Single Bar Rule. This extreme is a candidate for point 1.
	: '''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:		: '''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:
	:: '''1.2.1.''' The place of the last intersection of the price level of the t.1 candidate is found <ref>High or low equal to high or low of t.1 is an intersection</ref>. 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:		:: '''1.2.1.''' The place of the last intersection of the price level of the t.1 candidate is found <ref>High or low equal to high or low of t.1 is an intersection</ref>. 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:

Admin: /* Step I. Find Point 1. Search for a Confirming Extreme. */

2023-08-05T07:59:45Z

Step I. Find Point 1. Search for a Confirming Extreme.

← Older revision		Revision as of 10:59, 5 August 2023
Line 13:		Line 13:
	::: '''1.2.1.2.''' If the absolute extreme is found, it is the beginning of the preceding trend. The point 1 is confirmed.		::: '''1.2.1.2.''' If the absolute extreme is found, it is the beginning of the preceding trend. The point 1 is confirmed.
	::: The program checks for the absence of extremes equal to point 1 from the Beginning of the preceding trend.		::: The program checks for the absence of extremes equal to point 1 from the Beginning of the preceding trend.
	:::: '''1.2.1.2.1.''' If such an extreme is found, this candidate for point 1 is discarded (the program continues to process other candidates ~~for point 1~~).		:::: '''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).
	:::: '''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.		:::: '''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.
	:: '''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.		:: '''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.

Admin: /* Step I. Find Point 1. Search for a Confirming Extreme. */

2023-08-05T07:58:54Z

Step I. Find Point 1. Search for a Confirming Extreme.

Admin: /* Step I. Find Point 1. Search for a Confirming Extreme. */

2023-08-05T07:43:01Z

Step I. Find Point 1. Search for a Confirming Extreme.

← Older revision		Revision as of 10:43, 5 August 2023
Line 8:		Line 8:
	==='''Step I. Find Point 1. Search for a Confirming Extreme.'''===		==='''Step I. Find Point 1. Search for a Confirming Extreme.'''===
	: '''1.1.''' The program searches for the first possible extreme that satisfies N1 rule. This extreme is a candidate for point 1.		: '''1.1.''' The program searches for the first possible extreme that satisfies N1 rule. This extreme is a candidate for point 1.
	: '''1.2.''' When a candidate for point 1 is found, all bars to the left (i.e., in the past) of the bar containing the candidate extreme are checked until one of the following events occurs:		: '''1.2.''' When a candidate for point 1 is found, all bars to the left (i.e., in the past) of the bar containing the p.1 candidate extreme are checked until one of the following events occurs:
	:: '''1.2.1.''' The ~~point~~ of the last intersection of the price level with the candidate for point 1 is found <ref>High or low equal to high or low of t.1 is an intersection</ref>. In this case, the program searches for an absolute extreme that confirms point 1 from the intersection of the price level with the candidate for point 1 (inclusive) to the bar of point 1 (exclusive). There are two possibilities:		:: '''1.2.1.''' The place of the last intersection of the price level with the candidate for point 1 is found <ref>High or low equal to high or low of t.1 is an intersection</ref>. In this case, the program searches for an absolute extreme that confirms point 1 from the intersection of the price level with the candidate for point 1 (inclusive) to the bar of point 1 (exclusive). There are two possibilities:
	::: '''1.2.1.1.''' If the extreme is not found, the program searches for a new candidate for point 1.		::: '''1.2.1.1.''' If the extreme is not found, the program searches for a new candidate for point 1.
	::: '''1.2.1.2.''' If the extreme is found, the candidate for point 1 is confirmed. The program then checks for the absence of extremes equal to point 1 from the beginning of the preceding to point 1.		::: '''1.2.1.2.''' If the extreme is found, the candidate for point 1 is confirmed. The program then checks for the absence of extremes equal to point 1 from the beginning of the preceding to point 1.

← Older revision		Revision as of 10:58, 5 August 2023
Line 8:		Line 8:
	==='''Step I. Find Point 1. Search for a Confirming Extreme.'''===		==='''Step I. Find Point 1. Search for a Confirming Extreme.'''===
	: '''1.1.''' The program searches for the first possible extreme that satisfies N1 rule. This extreme is a candidate for point 1.		: '''1.1.''' The program searches for the first possible extreme that satisfies N1 rule. This extreme is a candidate for point 1.
	: '''1.2.''' When a candidate for point 1 is found, all bars to the left (i.e., in the past) of the bar containing the p.1 candidate extreme are checked until one of the following events occurs:		: '''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:
	:: '''1.2.1.''' The place of the last intersection of the price level ~~with~~ the candidate ~~for point 1~~ is found <ref>High or low equal to high or low of t.1 is an intersection</ref>. In this case, the program searches for an absolute extreme that confirms point 1 from the intersection of the price ~~level~~ with the candidate ~~for point 1~~ (inclusive) to the bar of ~~point~~ 1 (exclusive). There are two possibilities:		:: '''1.2.1.''' The place of the last intersection of the price level of the t.1 candidate is found <ref>High or low equal to high or low of t.1 is an intersection</ref>. 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:
	::: '''1.2.1.1.''' If the extreme is not found, the program searches for a new candidate for point 1.		::: '''1.2.1.1.''' If the extreme is not found, the program searches for a new candidate for point 1.
	::: '''1.2.1.2.''' If the extreme is found, the ~~candidate for~~ point 1 is confirmed. The program ~~then~~ checks for the absence of extremes equal to point 1 from the ~~beginning~~ of the preceding ~~to point 1~~.		::: '''1.2.1.2.''' If the absolute extreme is found, it is the beginning of the preceding trend. The point 1 is confirmed.
			::: The program checks for the absence of extremes equal to point 1 from the Beginning of the preceding trend.
	:::: '''1.2.1.2.1.''' If such an extreme is found, this candidate for point 1 is discarded (the program continues to process other candidates for point 1).		:::: '''1.2.1.2.1.''' If such an extreme is found, this candidate for point 1 is discarded (the program continues to process other candidates for point 1).
	:::: '''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.		:::: '''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.
Line 37:		Line 38:

	==='''Step III. Building TL. Search for t.4'''===		==='''Step III. Building TL. Search for t.4'''===
	: '''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).		: '''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).

	:: '''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:		:: '''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: