所有案件
蒂卡爾古城 的案件
#132000: "Shortest path (Movement between forward camps)"
這是關於哪方面的案件？
發生什麼事? 請從下方選擇
建議：依我所見，有些調整將大幅增進遊戲完成度
細節描述
• 請簡明精確地解釋你的建議，以便讓人一目了然。
On page 4 of the rules it says:
"Once placed, you may travel between any camp of the same color, or the Base Camp for 1AP per explorer."
The shortest path from one tile to another may be through camp-to-camp travel. This is not calculated automatically. Attempting to move manually step-by-step also does not work.
• 你的瀏覽器是什麼？
Firefox
案件沿革
2024年 7月28日 18:01 • prabbit • 開發者尚未重現這項錯誤:
As currently implemented, to move the Blue Expedition Leader Column 6, Row 2 to Column 2, Row 3 costs 6 AP. The shortest path (through Blue's camps) is 3 AP.
imgur.com/a/tl75S9K
imgur.com/a/tl75S9K
2024年10月10日 18:05 • Sir Heo • 此建議尚未被開發者分析過:
Hi, the system calculates the shortest path without using the camps just to help in the Move action. I initially thought that using the camp should be something the player should consider, also not to overcomplicate the shortest path calculation. However I think it's a valid point and I'll consider it. I'll reclassify this as a suggestion and not as a bug.
And thanks for playing Tikal!
And thanks for playing Tikal!
為本案件添加內容
任何可能重現這項錯誤或了解你的建議之相關資訊，都請在此填寫:
- 其他同樣狀況的桌號／步數
- 按 F5 是否解決了這個問題？
- 問題是否發生了好幾次？每次都發生？時好時壞？
- 建議將此錯誤的螢幕截圖上傳到 Imgur.com 並轉貼連結。
