商店頁面
EXAPUNKS
全部 討論區 螢幕擷圖 藝術作品 實況直播 影片 工作坊 新聞 指南 評論
EXAPUNKS >  工作坊 > Corax 的工作坊
評價次數不足
MACHINE LEARNING CRASH COURSE (CAN EXAS® LEARN?)
介紹 討論區0 留言8 更新註記
   
獎勵
加入最愛
已加入最愛
移除最愛
檔案大小
發佈於
更新時間
8.681 KB
2018 年 8 月 29 日 上午 9:04
2018 年 8 月 29 日 下午 11:30
6 項更新註記 （檢視）
建立者
Corax
離線
2,851 不重複訪客人數
692 目前訂閱人數
9 目前最愛人數

訂閱以下載
MACHINE LEARNING CRASH COURSE (CAN EXAS® LEARN?)

描述
The UC berkeley department of machine learning is quite literal-minded. To research EXA® machine learning, they have built a miniaturized university setting!

Are your EXAS® capable of a good old last minute cram?

Copy 13 values from the #STDY register to the #RSPN register in reverse, then write to the #AUDT register to start the security audit process. Remember, no cheating!;


Note: This is a very difficult level, intended to take your EXAs to the absolute limit. If you feel it's unsolvable, keep at it! There's no "trick", it's all comp sci and patience. There is a Reddit Gold challenge for whomever solves it before September 5th 2018: https://www.reddit.com/r/exapunks/comments/9baqap/i_made_a_pretty_hard_custom_level_1_month_of/
8 則留言
< >
surzhykKorektor 2020 年 9 月 14 日 上午 10:38 
Actually... I think I do have an idea how to do it without access to that file's host... but I'd need at least one more cycle of the first Audit host being open, to do one more REPL...
surzhykKorektor 2020 年 9 月 13 日 下午 9:05 
Looking at the puzzle's .js file (okay, now I'm being a meta dirty cheating alpaca), it seems to want the file ID of the file in the "Security" host, the one that explains the supposed NoMake system, which is either ID 401 or 400. Two problems: said host is entirely isolated from the entire network and can't be reached at all to check the file ID via the usual means, and... it's weird, but it seems to want the opposite file ID. If the NoMake-explainer is ID 401, then it's actually writing 400 to #CHCK that "solves" it, and vice versa. That literally does not help with finding what the ID is on a given test run, but...
surzhykKorektor 2020 年 9 月 13 日 下午 9:05 
I'm officially stumped at this point... I've got a solution that MAKEs it in 61 lines (yup, dirty cheating alpaca because I literally don't know how I'm supposed to do it otherwise... the links to #STDY and #RSPN close after exactly three cycles, enough to REPL precisely once... the only way I see to do it without MAKE would require a third exa to be left in the home host, requiring at least four cycles before the links die ), and it goes all the way to the end of the audit... except I have no idea how to get the third value for #CHCK.
isaac.wass (aaaaaaaa) 2019 年 1 月 23 日 下午 8:31 
Was able to MAKE it in 68 lines (my solution scored 134/68/7). The NoMake protocol is still exploitable :mean_creep:

Still, fun puzzle, and neat idea!
Profile 2018 年 10 月 26 日 下午 5:47 
Why exactly there's a "machine learning" term? I don't get it...
Harald B 2018 年 10 月 1 日 下午 1:51 
Managed to MAKE it with 94/100 :happy_creep:. I imagine the "legitimate" solution involves something similar to what I've had to do but uglier, but I may be way off.
World's Only Lesbian 2018 年 9 月 25 日 下午 10:47 
This puzzle is serously amazing. I felt like a genius for finally getting a solution that works.

Unfortunately, my solution is 102 lines long. I've already cut it down a lot by finding ways to not have to use @REP 13, but it wasn't quite enough. Looking forward to optimizing that down a bit!
kotek900 2018 年 9 月 21 日 上午 10:48 
Omg so great! It uses something that I thought will never work but it did! If I knew it before I woud solve some lavels way faster! Amazing! :KSmiley::UltimateRaccoon: