예스스탁 | 전략 설계부터 자동매매까지

커뮤니티

1. 수식 1 ) 위에 있는 모든 종목 검색식 부탁드려요.

2. 수식 1 ) 위에 있는 0봉전~5봉전까지의 모든 종목 검색식 부탁드려요.

3. 수식 1 ) 이 전일보다 상승하는 종목 검색식 부탁드려요

4. 수식 1 ) 이 전일보다 상승하는 0봉전~5봉전 까지의 모든 종목 검색식 부탁드려요

5. 수식 1 ) 을 양봉 몸통으로 돌파하는 종목 검색식 부탁드려요.

6. 수식 1 ) 을 양봉 몸통으로 돌파하는 0봉전~5봉전까지의 종목 검색식 부탁드려요.

7. 일봉차트에서 주봉 10일선을 긋고,

수식 1 ) 이 주봉 10 일선을 돌파할때 종목 검색식 부탁드려요.

8. 일봉차트에서 주봉 10일선을 긋고,

수식 1 ) 이 주봉 10 일선을 돌파할때 0봉전~5봉전까지의 모든 종목 검색식 부탁드려요.

--아래-

수식 1)

Conv1 = (highest(H, Conv기간1) + lowest(L, Conv기간1)) / 2;

Base1 = (highest(H, Base기간1) + lowest(L, Base기간1)) / 2;

Span1_1 = (Conv1 + Base1) / 2;

Span1_2 = (highest(H, Span기간1) + lowest(L, Span기간1)) / 2;

Cloud1_Upper = if(Span1_1 > Span1_2, Span1_1, Span1_2);

Cloud1_Upper

수식2)

Cloud1_Lower = if(Span1_1 > Span1_2, Span1_2, Span1_1);

Cloud1_Lower

수식 3 )

Conv2 = (highest(H, Conv기간2) + lowest(L, Conv기간2)) / 2;

Base2 = (highest(H, Base기간2) + lowest(L, Base기간2)) / 2;

Span2_1 = (Conv2 + Base2) / 2;

Span2_2 = (highest(H, Span기간2) + lowest(L, Span기간2)) / 2;

Cloud2_Upper = if(Span2_1 > Span2_2, Span2_1, Span2_2);

Cloud2_Upper

수식4)

Cloud2_Lower = if(Span2_1 > Span2_2, Span2_2, Span2_1);

Cloud2_Lower

지표변수 Conv기간1 10

Base기간1 23

Span기간1 36

Conv기간 2 16

Base기간2 45

Span기간2 66

--------------------------------------------------------------------------------

9. 아래수식을 참고하여,

수식 1) 위에 있는 모든 종목 검색식 부탁드려요.

10. 아래수식을 참고하여,

수식 1) 위에 있는 0봉전~5봉전까지의 모든 종목 검색식 부탁드려요.

11. 아래수식을 참고하여,

수식 1) 이 전일보다 상승한 종목 검색식 부탁드려요

12. 아래수식을 참고하여,

수식 1 ) 이 전일보다 상승한 0봉전 ~5봉전까지의 모든종목 검색식 부탁드립니다.

--아래--

수식1) src=(H+L+C)/3;

sumPV=sum(src*V,WinLen);

sumVol=sum(V,WinLen);

sumPV/sumVol

수식2) src=(H+L+C)/3;

sumPV=sum(src*V,WinLen);

sumVol=sum(V,WinLen);

VW=sumPV/sumVol;

Var1=sum(src*src*V,WinLen)/sumVol-VW*VW;

VW+sqrt(max(Var1,1))*Mult1

수식3) src=(H+L+C)/3;

sumPV=sum(src*V,WinLen);

sumVol=sum(V,WinLen);

VW=sumPV/sumVol;

Var1=sum(src*src*V,WinLen)/sumVol-VW*VW;

VW+sqrt(max(Var1,1))*Mult2

수식4) src=(H+L+C)/3;

sumPV=sum(src*V,WinLen);

sumVol=sum(V,WinLen);

VW=sumPV/sumVol;

Var1=sum(src*src*V,WinLen)/sumVol-VW*VW;

VW+sqrt(max(Var1,1))*Mult3

수식5) src=(H+L+C)/3;

sumPV=sum(src*V,WinLen);

sumVol=sum(V,WinLen);

VW=sumPV/sumVol;

Var1=sum(src*src*V,WinLen)/sumVol-VW*VW;

VW-sqrt(max(Var1,1))*Mult1

수식6) src=(H+L+C)/3;

sumPV=sum(src*V,WinLen);

sumVol=sum(V,WinLen);

VW=sumPV/sumVol;

Var1=sum(src*src*V,WinLen)/sumVol-VW*VW;

VW-sqrt(max(Var1,1))*Mult2

수식7) src=(H+L+C)/3;

sumPV=sum(src*V,WinLen);

sumVol=sum(V,WinLen);

VW=sumPV/sumVol;

Var1=sum(src*src*V,WinLen)/sumVol-VW*VW;

VW-sqrt(max(Var1,1))*Mult3

지표변수 WinLen 60

Mult1 5

Mult2 8

Mult3 10

종목검색

답변 1

예스스탁 예스스탁 답변

2026-06-29 12:49:04

안녕하세요
예스스탁입니다.

1
input : conv기간1(10),base기간1(23),span기간1(36);
var : conv1(0),base1(0),Span1_1(0),Span1_2(0);
var : Cloud1_Upper(0);


Conv1 = (highest(H, Conv기간1) + lowest(L, Conv기간1)) / 2;
Base1 = (highest(H, Base기간1) + lowest(L, Base기간1)) / 2;
Span1_1 = (Conv1 + Base1) / 2;
Span1_2 = (highest(H, Span기간1) + lowest(L, Span기간1)) / 2;
Cloud1_Upper = iff(Span1_1 > Span1_2, Span1_1, Span1_2);


if C > Cloud1_Upper Then	
	Find(1);


2
input : conv기간1(10),base기간1(23),span기간1(36),N(5);
var : conv1(0),base1(0),Span1_1(0),Span1_2(0);
var : Cloud1_Upper(0);


Conv1 = (highest(H, Conv기간1) + lowest(L, Conv기간1)) / 2;
Base1 = (highest(H, Base기간1) + lowest(L, Base기간1)) / 2;
Span1_1 = (Conv1 + Base1) / 2;
Span1_2 = (highest(H, Span기간1) + lowest(L, Span기간1)) / 2;
Cloud1_Upper = iff(Span1_1 > Span1_2, Span1_1, Span1_2);


if CountIf( C > Cloud1_Upper,N) >= 1 Then	
	Find(1);


3
input : conv기간1(10),base기간1(23),span기간1(36);
var : conv1(0),base1(0),Span1_1(0),Span1_2(0);
var : Cloud1_Upper(0);


Conv1 = (highest(H, Conv기간1) + lowest(L, Conv기간1)) / 2;
Base1 = (highest(H, Base기간1) + lowest(L, Base기간1)) / 2;
Span1_1 = (Conv1 + Base1) / 2;
Span1_2 = (highest(H, Span기간1) + lowest(L, Span기간1)) / 2;
Cloud1_Upper = iff(Span1_1 > Span1_2, Span1_1, Span1_2);


if Cloud1_Upper > Cloud1_Upper[1] Then	
	Find(1);


4
input : conv기간1(10),base기간1(23),span기간1(36),N(5);
var : conv1(0),base1(0),Span1_1(0),Span1_2(0);
var : Cloud1_Upper(0);


Conv1 = (highest(H, Conv기간1) + lowest(L, Conv기간1)) / 2;
Base1 = (highest(H, Base기간1) + lowest(L, Base기간1)) / 2;
Span1_1 = (Conv1 + Base1) / 2;
Span1_2 = (highest(H, Span기간1) + lowest(L, Span기간1)) / 2;
Cloud1_Upper = iff(Span1_1 > Span1_2, Span1_1, Span1_2);


if CountIf(Cloud1_Upper > Cloud1_Upper[1],N) >= 1 Then	
	Find(1);


5
input : conv기간1(10),base기간1(23),span기간1(36);
var : conv1(0),base1(0),Span1_1(0),Span1_2(0);
var : Cloud1_Upper(0);


Conv1 = (highest(H, Conv기간1) + lowest(L, Conv기간1)) / 2;
Base1 = (highest(H, Base기간1) + lowest(L, Base기간1)) / 2;
Span1_1 = (Conv1 + Base1) / 2;
Span1_2 = (highest(H, Span기간1) + lowest(L, Span기간1)) / 2;
Cloud1_Upper = iff(Span1_1 > Span1_2, Span1_1, Span1_2);


if  C > Cloud1_Upper and Cloud1_Upper[1] > O Then	
	Find(1);


6
input : conv기간1(10),base기간1(23),span기간1(36),N(5);
var : conv1(0),base1(0),Span1_1(0),Span1_2(0);
var : Cloud1_Upper(0);


Conv1 = (highest(H, Conv기간1) + lowest(L, Conv기간1)) / 2;
Base1 = (highest(H, Base기간1) + lowest(L, Base기간1)) / 2;
Span1_1 = (Conv1 + Base1) / 2;
Span1_2 = (highest(H, Span기간1) + lowest(L, Span기간1)) / 2;
Cloud1_Upper = iff(Span1_1 > Span1_2, Span1_1, Span1_2);


if CountIf(C > Cloud1_Upper and Cloud1_Upper[1] > O,N) >= 1 Then	
	Find(1);


7
input : conv기간1(10),base기간1(23),span기간1(36);
input : WPeriod(10);
var : conv1(0),base1(0),Span1_1(0),Span1_2(0);
var : Cloud1_Upper(0);
var : cnt(0),sum(0),weekma(0);
Array : CC[100](0);

Conv1 = (highest(H, Conv기간1) + lowest(L, Conv기간1)) / 2;
Base1 = (highest(H, Base기간1) + lowest(L, Base기간1)) / 2;
Span1_1 = (Conv1 + Base1) / 2;
Span1_2 = (highest(H, Span기간1) + lowest(L, Span기간1)) / 2;
Cloud1_Upper = iff(Span1_1 > Span1_2, Span1_1, Span1_2);

if Bdate != Bdate[1] and
	(DayOfWeek(Bdate)< DayOfWeek(Bdate[1]) or
	DateToJulian(Bdate) >= DateToJulian(Bdate[1])+7) Then
{
	for cnt = 99 downto 1
	{
    	CC[cnt] = CC[cnt-1];
	}
}

CC[0] = C;

if CC[WPeriod-1] > 0 Then
{
	sum = 0;
	for cnt = 0 to WPeriod-1
	{
		sum = sum+CC[cnt];
	}
	weekma = sum/WPeriod;

	if CrossUp(Cloud1_Upper, weekma) Then
		Find(1);
}

8
input : conv기간1(10),base기간1(23),span기간1(36);
input : WPeriod(10),N(5);
var : conv1(0),base1(0),Span1_1(0),Span1_2(0);
var : Cloud1_Upper(0);
var : cnt(0),sum(0),weekma(0);
Array : CC[100](0);

Conv1 = (highest(H, Conv기간1) + lowest(L, Conv기간1)) / 2;
Base1 = (highest(H, Base기간1) + lowest(L, Base기간1)) / 2;
Span1_1 = (Conv1 + Base1) / 2;
Span1_2 = (highest(H, Span기간1) + lowest(L, Span기간1)) / 2;
Cloud1_Upper = iff(Span1_1 > Span1_2, Span1_1, Span1_2);

if Bdate != Bdate[1] and
	(DayOfWeek(Bdate)< DayOfWeek(Bdate[1]) or
	DateToJulian(Bdate) >= DateToJulian(Bdate[1])+7) Then
{
	for cnt = 99 downto 1
	{
    	CC[cnt] = CC[cnt-1];
	}
}

CC[0] = C;

if CC[WPeriod-1] > 0 Then
{
	sum = 0;
	for cnt = 0 to WPeriod-1
	{
		sum = sum+CC[cnt];
	}
	weekma = sum/WPeriod;

	if CountIf( CrossUp(Cloud1_Upper, weekma),N) >= 1 Then
		Find(1);
}

9
input : WinLen(60);
var : src(0),sumpv(0),sumvol(0);

src=(H+L+C)/3;
sumPV=AccumN(src*V,WinLen);
sumVol=AccumN(V,WinLen);
var1 = sumPV/sumVol;

if var1 > 0 and C > var1 Then
	Find(1);


10
input : WinLen(60),N(5);
var : src(0),sumpv(0),sumvol(0);

src=(H+L+C)/3;
sumPV=AccumN(src*V,WinLen);
sumVol=AccumN(V,WinLen);
var1 = sumPV/sumVol;

if CountIf( var1 > 0 and C > var1,N) >= 1 Then
	Find(1);


11
input : WinLen(60);
var : src(0),sumpv(0),sumvol(0);

src=(H+L+C)/3;
sumPV=AccumN(src*V,WinLen);
sumVol=AccumN(V,WinLen);
var1 = sumPV/sumVol;

if var1 > 0 and var1 > var1[1] Then
	Find(1);


12
input : WinLen(60),N(5);
var : src(0),sumpv(0),sumvol(0);

src=(H+L+C)/3;
sumPV=AccumN(src*V,WinLen);
sumVol=AccumN(V,WinLen);
var1 = sumPV/sumVol;

if CountIf(var1 > 0 and var1 > var1[1],N) >= 1 Then
	Find(1);

즐거운 하루되세요

안녕하세요 예스스탁입니다. 1 input : conv기간1(10),base기간1(23),span기간1(36); var : conv1(0),base1(0),Span1_1(0),Span1_2(0); var : Cloud1_Upper(0); Conv1 = (highest(H, Conv기간1) + lowest(L, Conv기간1)) / 2; Base1 = (highest(H, Base기간1) + lowest(L, Base기간1)) / 2; Span1_1 = (Conv1 + Base1) / 2; Span1_2 = (highest(H, Span기간1) + lowest(L, Span기간1)) / 2; Cloud1_Upper = iff(Span1_1 > Span1_2, Span1_1, Span1_2); if C > Cloud1_Upper Then Find(1); 2 input : conv기간1(10),base기간1(23),span기간1(36),N(5); var : conv1(0),base1(0),Span1_1(0),Span1_2(0); var : Cloud1_Upper(0); Conv1 = (highest(H, Conv기간1) + lowest(L, Conv기간1)) / 2; Base1 = (highest(H, Base기간1) + lowest(L, Base기간1)) / 2; Span1_1 = (Conv1 + Base1) / 2; Span1_2 = (highest(H, Span기간1) + lowest(L, Span기간1)) / 2; Cloud1_Upper = iff(Span1_1 > Span1_2, Span1_1, Span1_2); if CountIf( C > Cloud1_Upper,N) >= 1 Then Find(1); 3 input : conv기간1(10),base기간1(23),span기간1(36); var : conv1(0),base1(0),Span1_1(0),Span1_2(0); var : Cloud1_Upper(0); Conv1 = (highest(H, Conv기간1) + lowest(L, Conv기간1)) / 2; Base1 = (highest(H, Base기간1) + lowest(L, Base기간1)) / 2; Span1_1 = (Conv1 + Base1) / 2; Span1_2 = (highest(H, Span기간1) + lowest(L, Span기간1)) / 2; Cloud1_Upper = iff(Span1_1 > Span1_2, Span1_1, Span1_2); if Cloud1_Upper > Cloud1_Upper[1] Then Find(1); 4 input : conv기간1(10),base기간1(23),span기간1(36),N(5); var : conv1(0),base1(0),Span1_1(0),Span1_2(0); var : Cloud1_Upper(0); Conv1 = (highest(H, Conv기간1) + lowest(L, Conv기간1)) / 2; Base1 = (highest(H, Base기간1) + lowest(L, Base기간1)) / 2; Span1_1 = (Conv1 + Base1) / 2; Span1_2 = (highest(H, Span기간1) + lowest(L, Span기간1)) / 2; Cloud1_Upper = iff(Span1_1 > Span1_2, Span1_1, Span1_2); if CountIf(Cloud1_Upper > Cloud1_Upper[1],N) >= 1 Then Find(1); 5 input : conv기간1(10),base기간1(23),span기간1(36); var : conv1(0),base1(0),Span1_1(0),Span1_2(0); var : Cloud1_Upper(0); Conv1 = (highest(H, Conv기간1) + lowest(L, Conv기간1)) / 2; Base1 = (highest(H, Base기간1) + lowest(L, Base기간1)) / 2; Span1_1 = (Conv1 + Base1) / 2; Span1_2 = (highest(H, Span기간1) + lowest(L, Span기간1)) / 2; Cloud1_Upper = iff(Span1_1 > Span1_2, Span1_1, Span1_2); if C > Cloud1_Upper and Cloud1_Upper[1] > O Then Find(1); 6 input : conv기간1(10),base기간1(23),span기간1(36),N(5); var : conv1(0),base1(0),Span1_1(0),Span1_2(0); var : Cloud1_Upper(0); Conv1 = (highest(H, Conv기간1) + lowest(L, Conv기간1)) / 2; Base1 = (highest(H, Base기간1) + lowest(L, Base기간1)) / 2; Span1_1 = (Conv1 + Base1) / 2; Span1_2 = (highest(H, Span기간1) + lowest(L, Span기간1)) / 2; Cloud1_Upper = iff(Span1_1 > Span1_2, Span1_1, Span1_2); if CountIf(C > Cloud1_Upper and Cloud1_Upper[1] > O,N) >= 1 Then Find(1); 7 input : conv기간1(10),base기간1(23),span기간1(36); input : WPeriod(10); var : conv1(0),base1(0),Span1_1(0),Span1_2(0); var : Cloud1_Upper(0); var : cnt(0),sum(0),weekma(0); Array : CC[100](0); Conv1 = (highest(H, Conv기간1) + lowest(L, Conv기간1)) / 2; Base1 = (highest(H, Base기간1) + lowest(L, Base기간1)) / 2; Span1_1 = (Conv1 + Base1) / 2; Span1_2 = (highest(H, Span기간1) + lowest(L, Span기간1)) / 2; Cloud1_Upper = iff(Span1_1 > Span1_2, Span1_1, Span1_2); if Bdate != Bdate[1] and (DayOfWeek(Bdate)< DayOfWeek(Bdate[1]) or DateToJulian(Bdate) >= DateToJulian(Bdate[1])+7) Then { for cnt = 99 downto 1 { CC[cnt] = CC[cnt-1]; } } CC[0] = C; if CC[WPeriod-1] > 0 Then { sum = 0; for cnt = 0 to WPeriod-1 { sum = sum+CC[cnt]; } weekma = sum/WPeriod; if CrossUp(Cloud1_Upper, weekma) Then Find(1); } 8 input : conv기간1(10),base기간1(23),span기간1(36); input : WPeriod(10),N(5); var : conv1(0),base1(0),Span1_1(0),Span1_2(0); var : Cloud1_Upper(0); var : cnt(0),sum(0),weekma(0); Array : CC[100](0); Conv1 = (highest(H, Conv기간1) + lowest(L, Conv기간1)) / 2; Base1 = (highest(H, Base기간1) + lowest(L, Base기간1)) / 2; Span1_1 = (Conv1 + Base1) / 2; Span1_2 = (highest(H, Span기간1) + lowest(L, Span기간1)) / 2; Cloud1_Upper = iff(Span1_1 > Span1_2, Span1_1, Span1_2); if Bdate != Bdate[1] and (DayOfWeek(Bdate)< DayOfWeek(Bdate[1]) or DateToJulian(Bdate) >= DateToJulian(Bdate[1])+7) Then { for cnt = 99 downto 1 { CC[cnt] = CC[cnt-1]; } } CC[0] = C; if CC[WPeriod-1] > 0 Then { sum = 0; for cnt = 0 to WPeriod-1 { sum = sum+CC[cnt]; } weekma = sum/WPeriod; if CountIf( CrossUp(Cloud1_Upper, weekma),N) >= 1 Then Find(1); } 9 input : WinLen(60); var : src(0),sumpv(0),sumvol(0); src=(H+L+C)/3; sumPV=AccumN(src*V,WinLen); sumVol=AccumN(V,WinLen); var1 = sumPV/sumVol; if var1 > 0 and C > var1 Then Find(1); 10 input : WinLen(60),N(5); var : src(0),sumpv(0),sumvol(0); src=(H+L+C)/3; sumPV=AccumN(src*V,WinLen); sumVol=AccumN(V,WinLen); var1 = sumPV/sumVol; if CountIf( var1 > 0 and C > var1,N) >= 1 Then Find(1); 11 input : WinLen(60); var : src(0),sumpv(0),sumvol(0); src=(H+L+C)/3; sumPV=AccumN(src*V,WinLen); sumVol=AccumN(V,WinLen); var1 = sumPV/sumVol; if var1 > 0 and var1 > var1[1] Then Find(1); 12 input : WinLen(60),N(5); var : src(0),sumpv(0),sumvol(0); src=(H+L+C)/3; sumPV=AccumN(src*V,WinLen); sumVol=AccumN(V,WinLen); var1 = sumPV/sumVol; if CountIf(var1 > 0 and var1 > var1[1],N) >= 1 Then Find(1); 즐거운 하루되세요

다음글

문의 드립니다.

이전글

수식 문의 드립니다

목록