{"id":1393,"date":"2020-03-19T17:41:11","date_gmt":"2020-03-19T20:41:11","guid":{"rendered":"https:\/\/www.blogs.unicamp.br\/zero\/?p=1393"},"modified":"2022-05-23T17:27:01","modified_gmt":"2022-05-23T20:27:01","slug":"non-deterministic-chess","status":"publish","type":"post","link":"https:\/\/www.blogs.unicamp.br\/zero\/1393\/","title":{"rendered":"Non-deterministic chess"},"content":{"rendered":"\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t

(Traduzir)<\/a><\/h4>\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t

In mathematics we say that a phenomenon is deterministic when, for a given entry in the system, all its results are always the same. For example, in the classic chess system, when we decide to advance the rook to take the opposing bishop the action will clearly lead to the taking of the opposing bishop, there is no luck factor involved between the decision to move the rook and its result.<\/p>

On the other hand, a phenomenon is non-deterministic when, for a given entry in the system, its results vary uncertainly. For example, when tossing a coin, the upward tossing process can be repeated, but the result (heads or tails) varies in an unpredictable way.<\/p>

Note that the variation in the result does not always mean that the event is non-deterministic. For example: When throwing three coins, we are sure that at least two of your results will be the same (suppose no, we arrive that one of them must be expensive, another crown, and the third can be neither expensive nor expensive, therefore absurd ). Although we cannot say what the result of any of the three currencies will be, the statement itself is deterministic, because for the entry (throwing three coins), we always get the same result (at least two with equal values).<\/p>

Now that we have reviewed the basics of deterministic and non-deterministic phenomena, imagine classic chess, with one difference: when one piece attacks another, there is less than a 1 (or 100%) chance of it being destroyed. In a more metaphorical scenario, it would be like attacking someone from behind, but the chance that person will notice the attack and defeat us is greater than 0.<\/p>

It may seem complex, but we will make an example: In the game situation below, the white player started by advancing a pawn, so the black player also advanced a pawn. Leaving it aligned on the diagonal of the white bishop.<\/p>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t

\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\"\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t

The white player advances his bishop to the position of the black pawn. But unlike classic deterministic chess, there is now a non-deterministic factor on this occasion. Let P be the probability that one piece will attack the other and destroy it. Simply put, 0 <P <1, so the chance of the attacked piece to defeat the attacker is 1-P.<\/p>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t

\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\"\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t

Taking the luck of this phenomenon, if we get P, the white bishop occupies the space of the disappearing black pawn (figure below on the left). If we get 1-P, the white bishop disappears and the black pawn remains in its original position (figure below on the right).<\/p>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t

\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\"\"\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t

The interesting thing about this approach is the appearance of the risk factor when attacking any other piece. For unlike deterministic chess, in which we can attack confidently that we will destroy the target (deterministic action), in this version attacking also carries the risk of being destroyed, and letting it attack you brings the chance to destroy your opponent.<\/p>

It is not difficult to notice that the dynamics of this game changes a lot depending on the chosen P value. For example, if P = 0.5, then 1-P = 0.5. This means that each time a piece attacks another, there is a 50% chance that it will destroy the opponent and a 50% chance that it will be destroyed. In a situation like this, we have a game in which it makes no difference between being attacked or attacking. Both have the same practical effect.<\/p>

However, this does not rule out the presence of a game strategy. Since the objective is to defeat the opposing king, it is up to the players to develop strategies to cast their lot more often against the opposing king than the other will cast their lot against their king.<\/p>

Analyzing other contexts of this game, if P <(1-P), it becomes more interesting to be attacked than to attack. But again we have strategies that emerge from this context, such as limiting movement and a willingness to cast your luck against the opposing king more often.<\/p>

A situation in which P> (1-P) would be similar to deterministic chess, but with a greater risk of losing important pieces. For example, if the probability P were 80%, 1-P would be 20%. We can calculate from conditional probability, what would be the chances of a piece eliminating from 1 to 8 pieces (in this case the 8 pawns):<\/p><\/colgroup>

% destroy<\/b><\/i><\/p><\/td>

80%<\/i><\/p><\/td>

64%<\/i><\/p><\/td>

51%<\/i><\/p><\/td>

41%<\/i><\/p><\/td>

33%<\/i><\/p><\/td>

26%<\/i><\/p><\/td>

21%<\/i><\/p><\/td>

17%<\/i><\/p><\/td><\/tr>

Pawns<\/b><\/i><\/p><\/td>

1<\/b><\/i><\/p><\/td>

2<\/b><\/i><\/p><\/td>

3<\/b><\/i><\/p><\/td>

4<\/b><\/i><\/p><\/td>

5<\/b><\/i><\/p><\/td>

6<\/b><\/i><\/p><\/td>

7<\/b><\/i><\/p><\/td>

8<\/b><\/i><\/p><\/td><\/tr><\/tbody><\/table>

With this, if we consider a usual scoring system for the pieces, we arrive that pawns are worth 1 point and queens are worth 9 points. In these conditions, when risking to destroy the pawns lightly with the queen, we have a risk of approximately 50% of losing it when trying to destroy up to 3 pawns. Which is clearly a disadvantage (when eliminating a pawn is optional).<\/p>

In all these contexts, for any P <1, attacking using the king would be only a last option, since any attack performed by a king in non-deterministic chess can end with the same consequence as a checkmate.<\/p>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t

\n\t\t\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t

Back to main page<\/a><\/h4>\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t

Who writes the posts?<\/a><\/h4>\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<\/div>\n\t\t","protected":false},"excerpt":{"rendered":"

What would chess look like in which the outcome of the actions was uncertain? What would change, would the usual strategies remain?<\/p>\n","protected":false},"author":434,"featured_media":1390,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"colormag_page_container_layout":"default_layout","colormag_page_sidebar_layout":"default_layout","_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"pgc_sgb_lightbox_settings":"","_vp_format_video_url":"","_vp_image_focal_point":[],"footnotes":""},"categories":[1211],"tags":[],"class_list":["post-1393","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-v-3-ed-2"],"_links":{"self":[{"href":"https:\/\/www.blogs.unicamp.br\/zero\/wp-json\/wp\/v2\/posts\/1393","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.blogs.unicamp.br\/zero\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.blogs.unicamp.br\/zero\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.blogs.unicamp.br\/zero\/wp-json\/wp\/v2\/users\/434"}],"replies":[{"embeddable":true,"href":"https:\/\/www.blogs.unicamp.br\/zero\/wp-json\/wp\/v2\/comments?post=1393"}],"version-history":[{"count":6,"href":"https:\/\/www.blogs.unicamp.br\/zero\/wp-json\/wp\/v2\/posts\/1393\/revisions"}],"predecessor-version":[{"id":1874,"href":"https:\/\/www.blogs.unicamp.br\/zero\/wp-json\/wp\/v2\/posts\/1393\/revisions\/1874"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.blogs.unicamp.br\/zero\/wp-json\/wp\/v2\/media\/1390"}],"wp:attachment":[{"href":"https:\/\/www.blogs.unicamp.br\/zero\/wp-json\/wp\/v2\/media?parent=1393"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.blogs.unicamp.br\/zero\/wp-json\/wp\/v2\/categories?post=1393"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.blogs.unicamp.br\/zero\/wp-json\/wp\/v2\/tags?post=1393"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}