Conditionless Bots - Revision history

PhiNotPi: Fixed typos

2014-02-15T01:03:55Z

Fixed typos

PhiNotPi: Fixed typos

2014-02-15T01:02:12Z

Fixed typos

Endy: page about as complete as it'll ever get...

2008-09-10T13:34:25Z

page about as complete as it'll ever get...

Rsucoop: /* Expert */

2008-01-04T23:35:25Z

‎Expert

Endy: updating

2007-06-09T07:54:20Z

updating

Jez: A negative memory location is read as a normal memory location, edited 'greater or less'

2006-08-29T15:10:35Z

A negative memory location is read as a normal memory location, edited 'greater or less'

Jez: changed line .refeye .myeye sub sgn abs mult 1 sub -1 mult mult to .refeye .myeye sub sgn abs 1 sub -1 mult mult

2006-08-29T14:50:30Z

changed line *.refeye *.myeye sub sgn abs mult 1 sub -1 mult mult to *.refeye *.myeye sub sgn abs 1 sub -1 mult mult

Ollj at 22:12, 31 January 2006

2006-01-31T22:12:34Z

Endy: fixing links

2006-01-23T06:03:44Z

fixing links

66.91.141.218: Conditionless bots complete for now

2006-01-23T05:52:09Z

Conditionless bots complete for now

@@ Line 112: / Line 112: @@
 Y1 Y2 add ~ X2 store
-This will create a R/S latch with high-level activation. A low level activation would require AND gates instead of or gates. THe ~ needs to be there for the NOT function, or NOR/NAND in this case. As you can see, when Y1 goes high, the output of the NOR gate on the bottom must be 0 (because when either NOR input is high, the output is 0). This sets Y2 to 0. This same 0 goes to the lower input on the NOR gate at the top; Since X2 must be low (since Y2 is high), both inputs to the NOR gate at the top are 0. Therefore, since both inputs are 0, it outputs a 1. This 1 hits the top input of the bottom gate, keeping the gate on (and setting Q to 1), and the latch remains stable in this state until Reset goes high. Similarly, the opposite happens when Reset goes high. The workings of this latch may seem confusing at first, but if you follow the logic paths you should be able to understand it clearly. This makes for an excellent operator for a search algorithm, or even a 'drive/go' gene. Basically makes two comparisons at once.
+This will create a R/S latch with high-level activation. A low level activation would require AND gates instead of or gates. The ~ needs to be there for the NOT function, or NOR/NAND in this case. As you can see, when Y1 goes high, the output of the NOR gate on the bottom must be 0 (because when either NOR input is high, the output is 0). This sets Y2 to 0. This same 0 goes to the lower input on the NOR gate at the top; Since X2 must be low (since Y2 is high), both inputs to the NOR gate at the top are 0. Therefore, since both inputs are 0, it outputs a 1. This 1 hits the top input of the bottom gate, keeping the gate on (and setting Q to 1), and the latch remains stable in this state until Reset goes high. Similarly, the opposite happens when Reset goes high. The workings of this latch may seem confusing at first, but if you follow the logic paths you should be able to understand it clearly. This makes for an excellent operator for a search algorithm, or even a 'drive/go' gene. Basically makes two comparisons at once.
 Something like: Y2 X2 add 20 mult .vel store
@@ Line 128: / Line 128: @@
 The write value would be denoted by the user as some sort of sensor preferably. Such as eye5.vsnd would take either X1 or Y1's place, but should be a different variable from the Enabler, unless the gene calls for instant activation when the Enable says 1.
-If you want Enable to be compared with Write, an AND function between the two variables assigned to them would create a comparison between 3 or 4 things. More development would be to create several genes like this and link them together between outputs and inputs. THis would require a decoder if you only using two checkpoints or inputs.
+If you want Enable to be compared with Write, an AND function between the two variables assigned to them would create a comparison between 3 or 4 things. More development would be to create several genes like this and link them together between outputs and inputs. This would require a decoder if you only using two checkpoints or inputs.
 The gene would look something like this:

@@ Line 1: / Line 1: @@
-These are bots that use boolean style logic gates, created from basic math rules and equations.
+These are bots that use Boolean style logic gates, created from basic math rules and equations.
 Typically this is done to reduce costs associated with normal conditions. These are most likely found in [[Single Bot| Single Gene]] bots, but can also be used in more normal bots.
@@ Line 5: / Line 5: @@
 ==True or False==
-True conditions result in the memory location being multiplied by 1. A false results in a 0 or -1 multipliation, stoping the action.
+True conditions result in the memory location being multiplied by 1. A false results in a 0 or -1 multiplication, stopping the action.
 == Basic ==
-The simpliest memory locations to use are those that are already either a one or zero; .hit, .edge, and .fixed are prime examples.
+The simplest memory locations to use are those that are already either a one or zero; .hit, .edge, and .fixed are prime examples.
 .up *.hit mult store
@@ Line 35: / Line 35: @@
 '''Equal or Not?'''
-The next step is to allow the bots to determine wether or not a sysvar is equal or not equal, to a particular value or another sysvar.
+The next step is to allow the bots to determine whether or not a sysvar is equal or not equal, to a particular value or another sysvar.
 This is easily accomplished by reducing the sysvar to a more usable value in this case zero or one.
@@ Line 43: / Line 43: @@
   store
-Similar to the previous dna this will cause a bot to turn, however this dna will only activate if the bots are related(hopefully).
+Similar to the previous DNA this will cause a bot to turn, however this DNA will only activate if the bots are related(hopefully).
-First refeye is subtracted(sub) from myeye, resulting in a zero or a variable X. Since X could be positive or negative we find the sign and absolute of it, resulting in our favorite 1. With help from our conversion dna, they flip and we have our true statement of one that we multiply by allowing the bot to avoid kin.
+First refeye is subtracted(sub) from myeye, resulting in a zero or a variable X. Since X could be positive or negative we find the sign and absolute of it, resulting in our favorite 1. With help from our conversion DNA, they flip and we have our true statement of one that we multiply by allowing the bot to avoid kin.
 '''Greater or Less?'''
@@ Line 55: / Line 55: @@
   store
-This dna allows a bot to reproduce whenever it's energy level is greater than 5000. When this occurs the sign returns one and the bot reproduces. As a negative memory location is seen by the program the same as a normal memory location we use (0 floor) to make sure the result is either a 1 or 0.
+This DNA allows a bot to reproduce whenever it's energy level is greater than 5000. When this occurs the sign returns one and the bot reproduces. As a negative memory location is seen by the program the same as a normal memory location we use (0 floor) to make sure the result is either a 1 or 0.
 ''Caution: When using sgn care should be taken with the negative results, compound use of solitary sgns can result in false results.''
-If we wanted a less than we would flip 5000 and nrg or if necessary use the conversion dna to obtain the values we want.
+If we wanted a less than we would flip 5000 and nrg or if necessary use the conversion DNA to obtain the values we want.
 == Hard ==
@@ Line 71: / Line 71: @@
 In this pseudo code X, Y, and Z represents expressions evaluating to a one or zero. If all are 1 or true the action occurs. If even one of the expressions is zero or false the action is canceled.
-Suppose we want to shorten the dna by using OR allowing an action even if one of the expressions is false? To do this we can add the numbers then find their sign and absolute value to obtain our one.
+Suppose we want to shorten the DNA by using OR allowing an action even if one of the expressions is false? To do this we can add the numbers then find their sign and absolute value to obtain our one.
   X Y add Z add sgn abs mult
@@ Line 83: / Line 83: @@
   store
-Combining two of the dna's we've seen before this will cause the bot to turn whenver nothing or kin are seen. Useful in terms of shortening dna length and allowing similar actions to be activated by different conditions.
+Combining two of the DNAs we've seen before this will cause the bot to turn whenever nothing or kin are seen. Useful in terms of shortening DNA length and allowing similar actions to be activated by different conditions.
 == Expert ==
@@ Line 103: / Line 103: @@
 A equals 1 if no value is zero and if an even number or none of evaluations are negative.
-It is possible to create 'extra memory' or 'long term memory' for your bot using two or opperators and the ~
+It is possible to create 'extra memory' or 'long term memory' for your bot using two or operators and the ~
 For X1, Y1, X2, Y2, allowing for only a 1 or 0 value
-set X1 and Y1 to a value of 0 or 1 as two inputs. X2 and Y1 have to be dependent on the return value of the operatore.
+set X1 and Y1 to a value of 0 or 1 as two inputs. X2 and Y1 have to be dependent on the return value of the operator.
 X1 X2 add ~ Y2 store
 Y1 Y2 add ~ X2 store
-This will create a R/S latch with high-level activation. A low level activation would require AND gates instead of or gates. THe ~ needs to be there for the NOT function, or NOR/NAND in this case. As you can see, when Y1 goes high, the output of the NOR gate on the bottom must be 0 (because when either NOR input is high, the output is 0). This sets Y2 to 0. This same 0 goes to the lower input on the NOR gate at the top; Since X2 must be low (since Y2 is high), both inputs to the NOR gate at the top are 0. Therefore, since both inputs are 0, it outputs a 1. This 1 hits the top input of the bottom gate, keeping the gate on (and setting Q to 1), and the latch remains stable in this state until Reset goes high. Similarly, the opposite happens when Reset goes high. The workings of this latch may seem confusing at first, but if you follow the logic paths you should be able to understand it clearly. This makes for an excelant operator for a search algorithm, or even a 'drive/go' gene. Basically makes two comparisons at once.
+This will create a R/S latch with high-level activation. A low level activation would require AND gates instead of or gates. THe ~ needs to be there for the NOT function, or NOR/NAND in this case. As you can see, when Y1 goes high, the output of the NOR gate on the bottom must be 0 (because when either NOR input is high, the output is 0). This sets Y2 to 0. This same 0 goes to the lower input on the NOR gate at the top; Since X2 must be low (since Y2 is high), both inputs to the NOR gate at the top are 0. Therefore, since both inputs are 0, it outputs a 1. This 1 hits the top input of the bottom gate, keeping the gate on (and setting Q to 1), and the latch remains stable in this state until Reset goes high. Similarly, the opposite happens when Reset goes high. The workings of this latch may seem confusing at first, but if you follow the logic paths you should be able to understand it clearly. This makes for an excellent operator for a search algorithm, or even a 'drive/go' gene. Basically makes two comparisons at once.
 Something like: Y2 X2 add 20 mult .vel store
@@ Line 126: / Line 126: @@
 E *.hit and X1 mult Y1 store
-The write value would be denoted by the user as some sort of senosr preferably. Such as eye5.vsnd would take either X1 or Y1's place, but should be a different variable from the Enabler, unless the gene calls for instant activation when the Enable says 1.
+The write value would be denoted by the user as some sort of sensor preferably. Such as eye5.vsnd would take either X1 or Y1's place, but should be a different variable from the Enabler, unless the gene calls for instant activation when the Enable says 1.
-If you want Enable to be compared with Write, an AND function between th two variables assigned to them would create a comparison between 3 or 4 things. More development would be to create several genes like this and link them together between outputs and inputs. THis would require a decoder if you only using two checkpoints or inputs.
+If you want Enable to be compared with Write, an AND function between the two variables assigned to them would create a comparison between 3 or 4 things. More development would be to create several genes like this and link them together between outputs and inputs. THis would require a decoder if you only using two checkpoints or inputs.
 The gene would look something like this:
@@ Line 136: / Line 136: @@
 E ~ E^ store
-For an eight bit arrary of 'ram' genes all of these points of data stored become Enable values for the array. A Write Enabler, such as .refeye or refpoison would have to be denoted the variable which actived the write gene or X1 (Y1 for NAND R/S Latches). Comparisons between the Write Enabler and Enable would create a greater comparison complex. Please note that the Decoder, and Enabler used are for NOR R/S Latches, which only remember bits when the Y1 value is 'High' or 1.
+For an eight bit array of 'ram' genes all of these points of data stored become Enable values for the array. A Write Enabler, such as .refeye or refpoison would have to be denoted the variable which actived the write gene or X1 (Y1 for NAND R/S Latches). Comparisons between the Write Enabler and Enable would create a greater comparison complex. Please note that the Decoder, and Enabler used are for NOR R/S Latches, which only remember bits when the Y1 value is 'High' or 1.
 [[Category:Bottype]]

← Older revision		Revision as of 13:34, 10 September 2008
Line 137:		Line 137:

	For an eight bit arrary of 'ram' genes all of these points of data stored become Enable values for the array. A Write Enabler, such as .refeye or refpoison would have to be denoted the variable which actived the write gene or X1 (Y1 for NAND R/S Latches). Comparisons between the Write Enabler and Enable would create a greater comparison complex. Please note that the Decoder, and Enabler used are for NOR R/S Latches, which only remember bits when the Y1 value is 'High' or 1.		For an eight bit arrary of 'ram' genes all of these points of data stored become Enable values for the array. A Write Enabler, such as .refeye or refpoison would have to be denoted the variable which actived the write gene or X1 (Y1 for NAND R/S Latches). Comparisons between the Write Enabler and Enable would create a greater comparison complex. Please note that the Decoder, and Enabler used are for NOR R/S Latches, which only remember bits when the Y1 value is 'High' or 1.
−
−	~~More to come as I'm still working on this myself.--[[User:Endy]] 22:51, 22 Jan 2006 (MST)~~

	[[Category:Bottype]]		[[Category:Bottype]]

@@ Line 102: / Line 102: @@
 A equals 1 if no value is zero and if an even number or none of evaluations are negative.
 More to come as I'm still working on this myself.--[[User:Endy]] 22:51, 22 Jan 2006 (MST)
 [[Category:Bottype]]

← Older revision		Revision as of 07:54, 9 June 2007
Line 23:		Line 23:

	The middle is the code we're interested in. First the sign(sgn) of eye5 is found, then one is subtracted(sub) from it; resulting in zero(positive value) or -1(no value). Next it is multiplied by -1, perhaps the most important step this takes advantage of zero remaining the same and -1 becoming a positive one. At last we have our true value which we multiply by aimdx to make the bot turn only when it doesn't see anything.		The middle is the code we're interested in. First the sign(sgn) of eye5 is found, then one is subtracted(sub) from it; resulting in zero(positive value) or -1(no value). Next it is multiplied by -1, perhaps the most important step this takes advantage of zero remaining the same and -1 becoming a positive one. At last we have our true value which we multiply by aimdx to make the bot turn only when it doesn't see anything.
		+
		+	== New ==
		+
		+	The "-" operator can be used now instead of "-1 mult" to negate a value.
		+
		+	Possibly the Compliment operator "~" could be used for direct bit flipping,
		+	ie. zero to one or one to zero.

	== Moderate ==		== Moderate ==

@@ Line 45: / Line 45: @@
 300
-  *.nrg 5000 sub sgn mult
+  *.nrg 5000 sub sgn 0 floor mult
   store
-This dna allows a bot to reproduce whenever it's energy level is greater than 5000. When this occurs the sign returns one and the bot reproduces. The values of -1 and 0 result in a null storage location costing the bot nothing.
+This dna allows a bot to reproduce whenever it's energy level is greater than 5000. When this occurs the sign returns one and the bot reproduces. As a negative memory location is seen by the program the same as a normal memory location we use (0 floor) to make sure the result is either a 1 or 0.
 ''Caution: When using sgn care should be taken with the negative results, compound use of solitary sgns can result in false results.''

@@ Line 33: / Line 33: @@
 rnd .aimdx
-  *.refeye *.myeye sub sgn abs mult 1 sub -1 mult mult
+  *.refeye *.myeye sub sgn abs 1 sub -1 mult mult
   store

← Older revision		Revision as of 22:12, 31 January 2006
Line 97:		Line 97:

	More to come as I'm still working on this myself.--[[User:Endy]] 22:51, 22 Jan 2006 (MST)		More to come as I'm still working on this myself.--[[User:Endy]] 22:51, 22 Jan 2006 (MST)
		+
		+	[[Category:Bottype]]

← Older revision		Revision as of 05:52, 23 January 2006
Line 96:		Line 96:
	A equals 1 if no value is zero and if an even number or none of evaluations are negative.		A equals 1 if no value is zero and if an even number or none of evaluations are negative.

−	More to come as I'm still working on this myself.--[[User:~~66.91.141.218\|66.91.141.218~~]] 22:51, 22 Jan 2006 (MST)	+	More to come as I'm still working on this myself.--[[User:Endy]] 22:51, 22 Jan 2006 (MST)

Conditionless Bots - Revision history

PhiNotPi: Fixed typos

PhiNotPi: Fixed typos

Endy: page about as complete as it'll ever get...

Rsucoop: /* Expert */

Endy: updating

Jez: A negative memory location is read as a normal memory location, edited 'greater or less'

Jez: changed line *.refeye *.myeye sub sgn abs mult 1 sub -1 mult mult to *.refeye *.myeye sub sgn abs 1 sub -1 mult mult

Ollj at 22:12, 31 January 2006

Endy: fixing links

66.91.141.218: Conditionless bots complete for now

Jez: changed line .refeye .myeye sub sgn abs mult 1 sub -1 mult mult to .refeye .myeye sub sgn abs 1 sub -1 mult mult