格斗码格局在锦标赛中？ [英] Gray code pattern in tournament chart?

问题描述

在从底部到顶部的比赛图表中，有一个获胜者，我被告知，它以某种方式与灰色代码相关联。我知道灰色代码是一个替代代码，它是递归的，有用的是找到各种游戏，空格填充曲线，纠错码，硬盘定位的最佳解决方案，是钢琴演奏者的缩写，但是这个代码如何与锦标赛图表有关吗？

In a tournament chart from the bottom to the top where there is a winner I've been told that it is somehow connected with the gray-code. I know that the grey code is an alternative code, it's recursive and is useful to find the best solution in various games, space-filling-curves, error correction codes, harddisk positioning and is a shorthand for the piano player but how is this code is related with a tournament chart?

推荐答案

从 here ：

二叉树中的一个节点。每个
节点中的值包含
锦标赛树中最佳排名队伍的排名。事实证明，排名-1的灰色代码有
一个有点模式，方便地帮助我们将二叉树下降到
在适当的地方放置队伍。当
下降3时，排名从最低有效
到最重要的灰色代码中的位表示要采取哪个分支。

A tournament is really a node in a binary tree. The value in each node contains the ranking of the best ranking team contained in the tournament tree. It turns out that the gray code of the ranking-1 has a bit pattern that conveniently helps us descend the binary tree to the appropriate place at which to put the team. When descending the three, the bits in the gray code of the ranking from least-significant to most-significant indicate which branch to take.

这篇关于格斗码格局在锦标赛中？的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！