exercism / exercism/problem-specifications

About Robot name

オープン
#1,673 コメント 3 件 リアクション 0 件 担当者 0 名 GitHub で見る
主要言語
Ruby
スター
358
フォーク
563
平均マージ
18時間 41分
マージ済み PR(30日)
2

説明

Instructions for the "Robot name" problem ask for two independant things:
- at any time, each robot name has to be unique;
- when reset, a robot gets a new random name.

From that, what I understand is that:
- when creating a robot, we have to check for *current* names of robots *currently* up;
- when reseting a robot, we do the same, given that obviously this one is currently up and has a current name.

Most solutions I saw are checking against all already given names: they not only ensure that names are unique in "space", but also in "time".
We may think that's not a big deal, but something else makes this kind of solution unsatisfying. From instruction, we may deduce there are 676000 possibles names:
- so a right implementation should handle the case were there is no more name to give, to avoid bad things;
- in a strict interpretation, that means 676000 possible different robots, while in the mainstream one it's about 676000 names attribution, which makes a big difference.

To me, the strict interpretation is more interesting. Anyway, instructions should be refined to help people to get it, or they should be reformulated to reflect how most people currently understand them (still an interesting problem).

コントリビューションガイド

このリポジトリのコントリビューションガイドは索引されていません

評価

この issue はまだ評価されていません。

新しい issue をメールで受け取る

初心者向けの GitHub issue を短くまとめたダイジェスト。