øõTRiLOGI Ver 5.0 ~ ~ 0,Relay01B00 1,Relay01B01 2,Relay01B02 3,Relay01B03 4,Relay01B04 5,Relay01B05 6,Relay01B06 7,Relay01B07 8,LT1_5 9,LessThan 16,Relay02B00 17,Relay02B01 18,Relay02B02 19,Relay02B03 20,Relay02B04 21,Relay02B05 22,Relay02B06 23,Relay02B07 ~ ~ ~ $BitPosition Ladder Logic.PC6 1/13/2020 Gary DickinsonþþLadder logic solution for Lorne Van DusenþþThis code only solves the are there bits in RELAY[2] that are less thanþthe value in RELAY[1]. This code takes 3 ladder rungs and 50 ladderþdiagram words.þþThe 1/2 of the code that I did not write has the same structure but theþcontacts will have to be renamed.þþ $The following rungs handle all of the testing for bits in RELAY[2] beingþ"less than" the single bit in RELAY[1].þþThe code could not be coded as a single ladder logic rung hand had to be splitþacross two rungs.þ LT1_5=(Relay01B01*Relay02B00+(Relay01B02*(Relay02B00+Relay02B01)+(Relay01B03*(Relay02B00+(Relay02B01+Relay02B02))+(Relay01B04*(Relay02B00+(Relay02B01+(Relay02B02+Relay02B03)))+Relay01B05*(Relay02B00+(Relay02B01+(Relay02B02+(Relay02B03+Relay02B04)))))))) LessThan=(Relay01B06*(Relay02B00+(Relay02B01+(Relay02B02+(Relay02B03+(Relay02B04+Relay02B05)))))+(Relay01B07*(Relay02B00+(Relay02B01+(Relay02B02+(Relay02B03+(Relay02B04+(Relay02B05+Relay02B06))))))+LT1_5)) ~END_CIRCUIT~ ~END_CUSTFN~ ~END_CUSTFNLABEL~ 0,0, 1,0, 2,0, 3,0, 4,0, ~END_QUICKTAGS~ ~END_DEFINES~ ~END_BREAKPOINTS~ 192.168.1.16:9080 ~END_LASTIPADDR~