<p>In this study, we have chosen the computer network with the shape of a king’s graph. The king’s graph <i>G</i> is defined as a set of edges, that is <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(E=\{((i,j),(p,q))|i,p \in [0,M], j,q \in [0,N], M,N \in \textbf{Z},((i,j),(p,q))~{is\, an\, edge}\,\iff i = p \quad {and} \quad j = q\pm 1 \quad {or} \quad i = p\pm 1 \quad {and} \quad j = q \quad {or} \quad i = p\pm 1 \quad {and} \quad j = q\pm 1\}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>E</mi> <mo>=</mo> <mo stretchy="false">{</mo> <mo stretchy="false">(</mo> <mo stretchy="false">(</mo> <mi>i</mi> <mo>,</mo> <mi>j</mi> <mo stretchy="false">)</mo> <mo>,</mo> <mo stretchy="false">(</mo> <mi>p</mi> <mo>,</mo> <mi>q</mi> <mo stretchy="false">)</mo> <mo stretchy="false">)</mo> <mo stretchy="false">|</mo> <mi>i</mi> <mo>,</mo> <mi>p</mi> <mo>∈</mo> <mo stretchy="false">[</mo> <mn>0</mn> <mo>,</mo> <mi>M</mi> <mo stretchy="false">]</mo> <mo>,</mo> <mi>j</mi> <mo>,</mo> <mi>q</mi> <mo>∈</mo> <mo stretchy="false">[</mo> <mn>0</mn> <mo>,</mo> <mi>N</mi> <mo stretchy="false">]</mo> <mo>,</mo> <mi>M</mi> <mo>,</mo> <mi>N</mi> <mo>∈</mo> <mi mathvariant="bold">Z</mi> <mo>,</mo> <mo stretchy="false">(</mo> <mo stretchy="false">(</mo> <mi>i</mi> <mo>,</mo> <mi>j</mi> <mo stretchy="false">)</mo> <mo>,</mo> <mo stretchy="false">(</mo> <mi>p</mi> <mo>,</mo> <mi>q</mi> <mo stretchy="false">)</mo> <mo stretchy="false">)</mo> <mspace width="3.33333pt" /> <mrow> <mi>i</mi> <mi>s</mi> <mspace width="0.166667em" /> <mi>a</mi> <mi>n</mi> <mspace width="0.166667em" /> <mi>e</mi> <mi>d</mi> <mi>g</mi> <mi>e</mi> </mrow> <mspace width="0.166667em" /> <mo>⟺</mo> <mi>i</mi> <mo>=</mo> <mi>p</mi> <mspace width="1em" /> <mrow> <mi mathvariant="italic">and</mi> </mrow> <mspace width="1em" /> <mi>j</mi> <mo>=</mo> <mi>q</mi> <mo>±</mo> <mn>1</mn> <mspace width="1em" /> <mrow> <mi mathvariant="italic">or</mi> </mrow> <mspace width="1em" /> <mi>i</mi> <mo>=</mo> <mi>p</mi> <mo>±</mo> <mn>1</mn> <mspace width="1em" /> <mrow> <mi mathvariant="italic">and</mi> </mrow> <mspace width="1em" /> <mi>j</mi> <mo>=</mo> <mi>q</mi> <mspace width="1em" /> <mrow> <mi mathvariant="italic">or</mi> </mrow> <mspace width="1em" /> <mi>i</mi> <mo>=</mo> <mi>p</mi> <mo>±</mo> <mn>1</mn> <mspace width="1em" /> <mrow> <mi mathvariant="italic">and</mi> </mrow> <mspace width="1em" /> <mi>j</mi> <mo>=</mo> <mi>q</mi> <mo>±</mo> <mn>1</mn> <mo stretchy="false">}</mo> </mrow> </math></EquationSource> </InlineEquation>. We also set a delivery rule, in which the shortest paths in the graph are used for the message deliveries, to restrict the source consumption. Then, the paths are encoded in a way that we discover using binary arrays based on other well-known encoding methods. We prove that the path-coding method we present prevents errors denoted by false positives from the graph. Data transfer issues from computer science served as the motivation for this study.</p>