# Silent Duels--Constructing the Solution part 1

DevFeed: [Silent Duels--Constructing the Solution part 1](<https://devfeed.tech/articles/silent-duels-constructing-the-solution-part-1-40430.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/2019/06/30/silent-duels-constructing-the-solution-part-1/>)

Published: 2019-06-30T07:00:14Z

Content type: tutorial

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [Algorithm](<https://devfeed.tech/topics/algorithm.md>), [Code](<https://devfeed.tech/topics/code.md>), [Parsing](<https://devfeed.tech/topics/parsing.md>)

Tags: [algorithm](<https://devfeed.tech/tags/algorithm.md>), [code](<https://devfeed.tech/tags/code.md>), [code-quality](<https://devfeed.tech/tags/code-quality.md>), [parsing](<https://devfeed.tech/tags/parsing.md>), [plotting](<https://devfeed.tech/tags/plotting.md>)

## AI overview

This tutorial begins implementing the algorithm for constructing an optimal strategy in Restrepo's silent duel paper. It starts with a simplified symmetric game as a test case and plans a later post for the generic solution and code-quality details.

## Source excerpt

Previous posts in this series: Silent Duels and an Old Paper of Restrepo Silent Duels--Parsing the Construction Last time we waded into Restrepo's silent duel paper. You can see the original and my re-typeset version on Github along with all of the code in this series. We digested Section 2 and a bit further, plotting some simplified examples of the symmetric version of the game. I admit, this paper is not an easy read.