#1
2695
(由 Microsoft 翻譯) 我推薦一個叫做 Comparison Sorting 的新遊戲。
與 Coin Weighing 類似，我建議遊戲從一系列重量未知的物體開始，玩家可以使用有限數量的比較。但是，比較的每一側可能只有一個對象，並且這些物件都具有不同的權重。玩家必須按升序排列所有物件。在玩家進行比較並將物件放入清單後，遊戲會將物件分配為不同的數位，如果在某個時候其中一個物件大於清單中的下一個物件，遊戲會在錯誤的對上突出顯示一個紅色的“>”符號，然後顯示“你輸了”並提供使用 LIFE 道具的選項。 這將重新啟動該級別。如果所有物件都小於下一個對象，遊戲將在每個連續對之間顯示綠色的“<”符號，並繼續進入下一級別。
我建議 10 個級別，級別編號對應於對象的數量：
級別 1：0 個比較
第 2 級：1 個比較
第 3 級：3 次比較
第 4 級：5 次比較
第 5 級：7 個比較
第 6 級：10 次比較
第 7 級：13 個比較
第 8 級：16 個比較
第9級：19個比較
第 10 級：22 個比較
https://en.wikipedia.org/wiki/Comparison_sort#Number_of_comparisons_required_to_sort_a_list
如果遊戲檢測到比較沒有充分縮小可能的排列集，則遊戲將始終顯示錯誤的排列。例如，級別 10 開始時有 3628800 個可能的排列，還剩下 22 個比較。如果玩家比較 a 和 b，則 a>b 和 a<b 各有 1814400 次排列。如果第一次比較是 a<b，然後玩家比較 b 和 c，則情況 a<b<c 有 604800 次排列，情況 a<b>c 有 1209600 次排列，還剩下 20 次比較。由於 20 次比較理論上可以產生不超過 2^20 （1048576） 個不同的結果，因此遊戲將選擇 a<b>c 選項，該選項有 1209600 個排列，使得 20 次比較不可能總是確定排序列表，然後遊戲將以不縮小到 1 個排列的方式選擇比較結果， 然後遊戲將以未排序的方式用數位 1 到 10 填充物件，並顯示 'You lose'。
如果玩家完成所有 10 個級別，遊戲將顯示「您贏」，排行榜將顯示「全部清除」。。
ANSWER powerup 將顯示始終縮小到 1 種排列的比較。
精通標準應為：
2 星 — 5 級
3 星 — 7 級
4 星 — 9 級
5 星 — 全部清除
與 Coin Weighing 類似，我建議遊戲從一系列重量未知的物體開始，玩家可以使用有限數量的比較。但是，比較的每一側可能只有一個對象，並且這些物件都具有不同的權重。玩家必須按升序排列所有物件。在玩家進行比較並將物件放入清單後，遊戲會將物件分配為不同的數位，如果在某個時候其中一個物件大於清單中的下一個物件，遊戲會在錯誤的對上突出顯示一個紅色的“>”符號，然後顯示“你輸了”並提供使用 LIFE 道具的選項。 這將重新啟動該級別。如果所有物件都小於下一個對象，遊戲將在每個連續對之間顯示綠色的“<”符號，並繼續進入下一級別。
我建議 10 個級別，級別編號對應於對象的數量：
級別 1：0 個比較
第 2 級：1 個比較
第 3 級：3 次比較
第 4 級：5 次比較
第 5 級：7 個比較
第 6 級：10 次比較
第 7 級：13 個比較
第 8 級：16 個比較
第9級：19個比較
第 10 級：22 個比較
https://en.wikipedia.org/wiki/Comparison_sort#Number_of_comparisons_required_to_sort_a_list
如果遊戲檢測到比較沒有充分縮小可能的排列集，則遊戲將始終顯示錯誤的排列。例如，級別 10 開始時有 3628800 個可能的排列，還剩下 22 個比較。如果玩家比較 a 和 b，則 a>b 和 a<b 各有 1814400 次排列。如果第一次比較是 a<b，然後玩家比較 b 和 c，則情況 a<b<c 有 604800 次排列，情況 a<b>c 有 1209600 次排列，還剩下 20 次比較。由於 20 次比較理論上可以產生不超過 2^20 （1048576） 個不同的結果，因此遊戲將選擇 a<b>c 選項，該選項有 1209600 個排列，使得 20 次比較不可能總是確定排序列表，然後遊戲將以不縮小到 1 個排列的方式選擇比較結果， 然後遊戲將以未排序的方式用數位 1 到 10 填充物件，並顯示 'You lose'。
如果玩家完成所有 10 個級別，遊戲將顯示「您贏」，排行榜將顯示「全部清除」。。
ANSWER powerup 將顯示始終縮小到 1 種排列的比較。
精通標準應為：
2 星 — 5 級
3 星 — 7 級
4 星 — 9 級
5 星 — 全部清除
(原文) Comparison Sorting suggestion
I suggest a new game called Comparison Sorting.
Similarly to Coin Weighing, I suggest that the game starts with a series of objects of unknown weight, and the player may use a limited amount of comparisons. However, each side of the comparison may only have one object in it, and the objects are all of different weights. The player must put all of the objects in ascending order. After the player performs the comparisons and places the objects in the list, the game will then assign the objects as different numbers and if at some point one of the objects is greater than the next in the list, the game highlights a red '>' symbol at the wrong pair, then displays 'You lose' and offers the option to use LIFE power up, which restarts the level. If all the objects are less than the next, the game displays green '<' symbols between every consecutive pairs, and continues to the next level.
I suggest 10 levels, with the level number corresponding to the number of objects:
Level 1: 0 comparisons
Level 2: 1 comparisons
Level 3: 3 comparisons
Level 4: 5 comparisons
Level 5: 7 comparisons
Level 6: 10 comparisons
Level 7: 13 comparisons
Level 8: 16 comparisons
Level 9: 19 comparisons
Level 10: 22 comparisons
https://en.wikipedia.org/wiki/Comparison_sort#Number_of_comparisons_required_to_sort_a_list
If the game detects that the comparisons do not adequately narrow down the set of possible permutations, then the game will always display the wrong permutation. For example, level 10 starts with 3628800 possible permutations and 22 comparisons remaining. If the player compares a and b, then both a>b and a<b have 1814400 permutations each. If the first comparison was a<b, and the player then compares b and c, then there are 604800 permutations for the case a<b<c, and 1209600 permutations for the case a<b>c, and 20 comparisons remaining. Since 20 comparisons can theoretically have no more than 2^20 (1048576) different results, the game will choose the a<b>c option, which has 1209600 permutations, making it impossible for 20 comparisons to always determine the sorted list, the game will then choose comparison results in such a way that does not narrow down to 1 permutation, and the game will then fill in the objects with the numbers 1 to 10 in such a way that is not sorted, and display 'You lose'.
If the player completes all 10 levels, the game will display 'You win', and the leaderboard will display 'all clear'.
The ANSWER power up will display comparisons that always narrow down to 1 permutation.
Mastery criteria should be the following:
2 stars — level 5
3 stars — level 7
4 stars — level 9
5 stars — all clear
I suggest a new game called Comparison Sorting.
Similarly to Coin Weighing, I suggest that the game starts with a series of objects of unknown weight, and the player may use a limited amount of comparisons. However, each side of the comparison may only have one object in it, and the objects are all of different weights. The player must put all of the objects in ascending order. After the player performs the comparisons and places the objects in the list, the game will then assign the objects as different numbers and if at some point one of the objects is greater than the next in the list, the game highlights a red '>' symbol at the wrong pair, then displays 'You lose' and offers the option to use LIFE power up, which restarts the level. If all the objects are less than the next, the game displays green '<' symbols between every consecutive pairs, and continues to the next level.
I suggest 10 levels, with the level number corresponding to the number of objects:
Level 1: 0 comparisons
Level 2: 1 comparisons
Level 3: 3 comparisons
Level 4: 5 comparisons
Level 5: 7 comparisons
Level 6: 10 comparisons
Level 7: 13 comparisons
Level 8: 16 comparisons
Level 9: 19 comparisons
Level 10: 22 comparisons
https://en.wikipedia.org/wiki/Comparison_sort#Number_of_comparisons_required_to_sort_a_list
If the game detects that the comparisons do not adequately narrow down the set of possible permutations, then the game will always display the wrong permutation. For example, level 10 starts with 3628800 possible permutations and 22 comparisons remaining. If the player compares a and b, then both a>b and a<b have 1814400 permutations each. If the first comparison was a<b, and the player then compares b and c, then there are 604800 permutations for the case a<b<c, and 1209600 permutations for the case a<b>c, and 20 comparisons remaining. Since 20 comparisons can theoretically have no more than 2^20 (1048576) different results, the game will choose the a<b>c option, which has 1209600 permutations, making it impossible for 20 comparisons to always determine the sorted list, the game will then choose comparison results in such a way that does not narrow down to 1 permutation, and the game will then fill in the objects with the numbers 1 to 10 in such a way that is not sorted, and display 'You lose'.
If the player completes all 10 levels, the game will display 'You win', and the leaderboard will display 'all clear'.
The ANSWER power up will display comparisons that always narrow down to 1 permutation.
Mastery criteria should be the following:
2 stars — level 5
3 stars — level 7
4 stars — level 9
5 stars — all clear
作者 Piotr Grochowski
2024-12-19 00:59:52
讚好
回覆