題目 Minecraft???
I’ve placed a lectern near this village, and there’s a book here - I definitely did not hide the Flag here :D
Objective
Find the lectern location shown in the image. Once you get there, you’ll definitely be able to find the Flag… maybe?
Facing Direction
I’m facing southeast.
Coordinate Range
- X: 100000 ~ 150000
- Y: 60 ~ 75
- Z: -1000 ~ 1000
You’re free to wander around and survive on my server, but you must not grief the server or interfere with other players’ progress while solving.
Server Connection Info
- Version:
Java 1.21.11 - IP:
mc.pg72.tw - Password:
THJCC_3rd_Summer_CTF
If you’ve already figured out some of the coordinates, I don’t think you need to try them one by one - I believe you’ll know what to do with them :D!
Rule: No plugins, cheat clients, mods, or automation tools are allowed. Violations result in an immediate ban.
題目設計發想:
這題靈感來自這部影片:
簡單來說,Minecraft 生成地形的時候,他有一個 seed 可以算說每個方塊要怎麼朝向(草地、石頭…etc),這樣可以增加多樣性,避免太統一顯得無聊。
那我就想到可以使用這個特性去搞一個 CTF 題目,最後把他分類在 Forensic 中,(應該挺數位鑑識的吧 :thinking:)
解題步驟:
解法一
首先我們先分析這張照片,特別關注草地的生成規則,會找到他每個方塊的朝向:

安裝特定材質包 Manual texture rotations,然後把照片中的地形復刻過一次(用特定的方塊,例如草是淺綠色釉陶方塊),到一個空白地圖中:
復刻完畢後再切換成另外一個材質包 Textures to numbers,就可以看到一堆黑色方塊和數字。

接下來打開這個網站:
將相對關係座標輸入進去,以下提供數據可以給匯入:
110 collapsed lines
[ { "pos": { "x": 0, "y": 0, "z": -1 }, "rotation": 0, "side": false }, { "pos": { "x": -1, "y": 0, "z": -1 }, "rotation": 2, "side": false }, { "pos": { "x": -1, "y": 0, "z": 0 }, "rotation": 3, "side": false }, { "pos": { "x": -2, "y": 0, "z": 1 }, "rotation": 3, "side": false }, { "pos": { "x": -3, "y": 1, "z": 1 }, "rotation": 0, "side": false }, { "pos": { "x": -3, "y": 1, "z": 0 }, "rotation": 1, "side": false }, { "pos": { "x": -3, "y": 1, "z": -1 }, "rotation": 0, "side": false }, { "pos": { "x": -3, "y": 2, "z": -2 }, "rotation": 3, "side": false }, { "pos": { "x": -2, "y": 1, "z": -2 }, "rotation": 3, "side": false }, { "pos": { "x": -1, "y": 1, "z": -2 }, "rotation": 2, "side": false }, { "pos": { "x": 0, "y": 1, "z": -3 }, "rotation": 1, "side": false }, { "pos": { "x": 1, "y": 1, "z": -4 }, "rotation": 2, "side": false }]
匯入後選擇版本並將題目所敘述之限制填入欄位後就可以爆破出一些結果了:
20 collapsed lines
100487, 61, -69100839, 63, -962100929, 65, 655102309, 65, 893102597, 72, 600102957, 60, 467104694, 71, -382105235, 73, 666106664, 75, -833107175, 62, -968108539, 65, -251109007, 64, -275111078, 70, -567111095, 64, -641111505, 75, 190111621, 72, -676112598, 60, 72112597, 72, 746113914, 67, 736114330, 61, 90114514, 72, 81075 collapsed lines
116394, 67, 412116546, 62, -936116914, 72, -414117346, 71, -980117446, 68, 175117516, 69, -635117718, 66, -781117873, 65, -547118466, 66, 911118705, 66, 931121658, 74, -726121780, 65, -972122226, 62, -671122326, 65, 630122329, 74, 926122590, 70, 57123085, 66, -949124372, 61, -267124435, 75, -833124490, 68, 770124510, 61, -426125368, 61, 356126032, 62, -686126732, 72, 56127139, 65, 216128696, 75, 113128786, 70, -348129062, 69, -517130169, 66, 785130190, 62, 407130259, 61, 862130836, 74, -634130895, 72, -564130979, 71, 120131230, 71, -316131920, 63, 177132368, 71, -49132577, 61, -437133408, 70, -685133517, 65, 74134227, 63, 321135657, 64, 114135661, 62, -748135769, 69, -673135919, 64, 31135952, 67, 890136500, 74, -802136934, 67, 476138271, 62, 679138775, 67, -976139086, 62, 460140178, 67, 185141305, 68, -466143029, 60, 230143066, 73, 720143084, 69, 604143140, 66, 90143575, 64, -875143656, 72, 620143814, 71, 679144843, 63, 671144869, 75, -166145111, 61, 861145311, 66, 318145353, 75, 66145787, 68, -887146533, 64, 287147247, 73, -728147575, 71, 244148474, 68, 634149209, 71, -58149318, 62, 445149563, 71, 926149609, 71, 536149627, 74, 228這些結果中有一筆特定的數字,114514, 72, 810,非常的臭www 所以直接 TP 過去看書就可以找到 Flag 了!
Flag:THJCC{M1n3Cr@f7_15_S0_FuNnY:D}
方法二
自己一格一格慢慢走慢慢跑就可以找到答案囉:D
後記:
這題我其實花了很多時間設計,不過還是防不住有小孩子亂搞,炸地圖、洩漏座標、惡意殺死參賽者不讓他解題…etc 最後導致整題被我們下架。
其實還蠻難過的,這題是真的很有趣,在生活中的 CTF 題目。
但當然,會有這些狀況並非參賽者的錯,而是題目並沒有設計好,例如可以有一些好設計像是使用 instance、開冒險模式、動態座標/flag 等,這些都可以有效的防止一些事情發生,只不過我經驗不足沒想到 QwQ
我這裡也會提供地圖檔案可以給你們下載來玩,希望這題會讓你們喜歡!