Difference between revisions of "BotProgramming Basics"
Line 20: | Line 20: | ||
|Connector node||The diamond-shaped connector node is always evaluated valid during AI check. It connects every node linked to the top of the connector node with every node linked from the bottom of the connector node. A connector node can be used to simplify the layout of the AI. | |Connector node||The diamond-shaped connector node is always evaluated valid during AI check. It connects every node linked to the top of the connector node with every node linked from the bottom of the connector node. A connector node can be used to simplify the layout of the AI. | ||
|- | |- | ||
− | |Sub-AI node ||One can reuse an AI inside another one, by using a Sub-AI node. When evaluating this node the whole sub-AI is checked for a valid action. A sub-AI can again contain its own sub-AIs. | + | |Sub-AI node ||One can reuse an AI inside another one, by using a Sub-AI node. When evaluating this node the whole sub-AI is checked for a valid action. A sub-AI can again contain its own sub-AIs. Dividing the AI in sub-AIs also improves performance when viewing or editing the AI. |
|- | |- | ||
|Link ||Nodes can be connected with a link. A link is a directed connection from the bottom of {{Tooltip|one node|Could be a root node, a condition node or a connector node.}} to the top of {{Tooltip|another node|Could be an action node, a condition node, a connector node or a sub-AI node.}}. | |Link ||Nodes can be connected with a link. A link is a directed connection from the bottom of {{Tooltip|one node|Could be a root node, a condition node or a connector node.}} to the top of {{Tooltip|another node|Could be an action node, a condition node, a connector node or a sub-AI node.}}. | ||
Line 51: | Line 51: | ||
Some best coding practices from software development also apply to AIs in ''Gladiabots''. The following rules can help improve the quality of AIs, enhancing both the initial development and subsequent maintenance of the AI. | Some best coding practices from software development also apply to AIs in ''Gladiabots''. The following rules can help improve the quality of AIs, enhancing both the initial development and subsequent maintenance of the AI. | ||
− | {{InformationCollapsed|1=Divide and conquer|2=Break down a problem into two or more sub-problems and solve each of them separately. Complex sub-problems can again be divided. In ''Gladiabots'' this could be done by creating sub-AIs for each sub-problem. The complexity is reduced leading to a better maintainability.}} | + | {{InformationCollapsed|1=Divide and conquer.|2=Break down a problem into two or more sub-problems and solve each of them separately. Complex sub-problems can again be divided. In ''Gladiabots'' this could be done by creating sub-AIs for each sub-problem. The complexity is reduced leading to a better maintainability.}} |
− | {{InformationCollapsed|1=Readability|2=AIs are written once, but read many times. Overlapping nodes | + | {{InformationCollapsed|1=Readability first.|2=AIs are written once, but read many times. Overlapping nodes, links crossing each other and great distances between linked nodes are difficult to read and should be avoided. AIs and sub-AIs should have meaningful names revealing the purpose of the AI. One should consider to align nodes to the grid.}} |
{{InformationCollapsed|1=Don't repeat yourself.|2=Avoid using the exact same nodes in several places. Sometimes duplicate nodes can be prevented by using bot specific filters or additional conditions. If its not possible to prevent duplicate nodes in the first place one can try to move them to sub AIs.}} | {{InformationCollapsed|1=Don't repeat yourself.|2=Avoid using the exact same nodes in several places. Sometimes duplicate nodes can be prevented by using bot specific filters or additional conditions. If its not possible to prevent duplicate nodes in the first place one can try to move them to sub AIs.}} | ||
− | + | {{InformationCollapsed|1=Keep it simple.|2=The size of an AI has a significant effect on the error rate. A simple solution should be preferred over a complex one leading to the same or very similar results. One should ask the question: "Has this AI been implemented with the least amount of nodes necessary?". The more complex the AI is the more likely it is to be buggy.}} | |
+ | {{InformationCollapsed|1=Test, test, test.|2="If debugging is the process of removing bugs, then programming must be the process of putting them in." (Edsger Wybe Dijkstra) As no developer is perfect, new nodes should be tested and debugged right after they were added. | ||
− | + | == Debugging AIs == | |
− | + | {{Warning|The rest of the page is a work in progress.}} | |
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | {{Warning| | + | |
− | + | ||
− | + | ||
== Combining condition nodes == | == Combining condition nodes == | ||
Line 99: | Line 70: | ||
− | + | <!-- | |
== Debugging AIs == | == Debugging AIs == |
Revision as of 17:50, 21 October 2017
![]() |
This page needs improvement, you are welcome to contribute. |
Contents
[hide]Basics
The robots in Gladiabots are autonomous and obey their Artificial Intelligence (AI). Bots can only execute one of the possible actions at a time. The AIs task is to determine what action to use in the current situation. Each bot checks its AI counterclockwise, searching for the first valid branch leading to an action.
The AI of a bot is shaped like an upside down tree. It can be composed of the following elements:
Element | Description |
---|---|
Root node | Each AI contains exactly one root node that defines the starting point of the AI check. Nodes linked from the bottom of the root node are evaluated counterclockwise. The root node indicates the name of the AI. |
Action node | If a rectangular-shaped action node is evaluated valid during AI check, the described action is executed for the current tick. An action node is considered invalid if the bot cannot perform it![]() |
Condition node | If an oval-shaped condition node is evaluated valid during AI check, the nodes linked from the bottom of the condition node are evaluated counterclockwise. A condition node is considered invalid if the current situation doesn't fit it![]() |
Connector node | The diamond-shaped connector node is always evaluated valid during AI check. It connects every node linked to the top of the connector node with every node linked from the bottom of the connector node. A connector node can be used to simplify the layout of the AI. |
Sub-AI node | One can reuse an AI inside another one, by using a Sub-AI node. When evaluating this node the whole sub-AI is checked for a valid action. A sub-AI can again contain its own sub-AIs. Dividing the AI in sub-AIs also improves performance when viewing or editing the AI. |
Link | Nodes can be connected with a link. A link is a directed connection from the bottom of one node![]() ![]() |
AI checking process
To determine the action a bot should use in the current situation, the valid nodes are traversed by a depth-first search algorithm beginning with the root node:
![]() |
|
![]() |
Branches are not executed counterclockwise but checked counterclockwise. |
![]() |
The evaluation of nodes is instant and is not wasting any time from the current tick. |
Best practices for AI design
Some best coding practices from software development also apply to AIs in Gladiabots. The following rules can help improve the quality of AIs, enhancing both the initial development and subsequent maintenance of the AI.
![]() |
|
![]() |
|
![]() |
|
![]() |
|
{{InformationCollapsed|1=Test, test, test.|2="If debugging is the process of removing bugs, then programming must be the process of putting them in." (Edsger Wybe Dijkstra) As no developer is perfect, new nodes should be tested and debugged right after they were added.
Debugging AIs
![]() |
The rest of the page is a work in progress. |