Jump to content

H2O

Members
  • Content count

    76
  • Joined

  • Last visited

  • Days Won

    9

H2O last won the day on April 28

H2O had the most liked content!

Community Reputation

14 Paramecium

About H2O

  • Rank
    CELLBLOCKED

Country

  • Country
    Austria

Profile Information

  • Favourite Set
    N/A

Recent Profile Visitors

314 profile views
  1. Recording time probably isn't the culprit, just tested it with a roughly 10 minute solution (mainly randomly moving around for quite a while several times and standing next to the exit in between before finishing) and everything worked fine I never had problems as described by you recording any solutions, so not quite sure what could be responsible...
  2. Sorry to cause confusion already Yet I'm pretty sure there are just 122 levels in Mind Games ++ (or my program to extract them doesn't work properly ) even though there probably are zombie c2m files in the folders and the Relaxation Vault in Test Subject Chip and Melinda is just a gimmick together with the c2g script, which means as well here can just be found 4 instead of 5 levels... To avoid those problems I uploaded the 138 levels now including as well 4 new ones here on cczone in a proper way to be easier to work with:
  3. cc2lp1_submissions_H

    Version 0.142

    6 downloads

    plain c2m files - not a set
  4. Count to 1,000

    12310_⁵⁄₁ = 210110001120101_³⁄₂ = 30997_¹²⁄₃ = 450339_¹¹⁄₄
  5. Double the Last Number

    Most of the time, Haskell, but pretty much everything will do GHCi: > 2^163 11692013098647223345629478661730264157247460343808 tclsh: % expr {2**163} 11692013098647223345629478661730264157247460343808 bc: 2^163 11692013098647223345629478661730264157247460343808 C: #include <stdio.h> #include <stdlib.h> #include <gmp.h> int main(int argc, char **argv){ if(argc!=2){ fprintf(stderr, "%s int\n", argv[0]); return EXIT_FAILURE;} unsigned long int e = strtoul(argv[1], NULL, 10); mpz_t r; mpz_init(r); mpz_ui_pow_ui(r,2ul,e); gmp_printf("%Zd\n",r); return EXIT_SUCCESS;} ./prog 163 11692013098647223345629478661730264157247460343808
  6. Double the Last Number

    2707685248164858261307045101702230179137145581421695874189921465443966120903931272499975005961073806735733604454495675614232576 -------------------------------------------------------------------------------------------------------------------------------------------------------------------- 463168356949264781694283940034751631413079938662562256157830336031652518559744
  7. CC2LP1 Project WIP

  8. Great to see CC2LP1 progressing and take shape I can help as far as far as my time allows it, if you want me to
  9. CC2 Community Pack Survey

    As far as I can see, nothing is expected to be patched at all yet especially nothing which will break existing levels - in your example a new button tile which is always visible or a new semi hidden logic mode could easily be introduced without breaking dozens of existing levels, otherwise we'll end in a catch-22, e.g. what if Chip in some version will be able to go on fire tiles without fire boots...
  10. Count to 1,000

    io.write(950)
  11. Count to 1,000

    Which language is used to calculate 943 and 945? > flip runReader language $ asks id "Haskell" pack [label .l -text 948]
  12. CC2 Community Pack Survey

    What should the set be named? A catchy name would be good (we can do better than CC2LPx). How many levels? 200 levels sounds fine, just include enough easy and short levels. Allow levels with CC1 boot rules? Mixing the boot rules could be confusing for players, so I tend to no, yet it might not be necessary to categorically exclude them. Consistent viewport size (9x9 or 10x10)? Probably it's preferable for all levels to use 10x10, but again, not sure if rules regarding this have to be made. Map size limit? No strict arbitrary limit is required. Should any tiles or techniques be banned? No haphazardly chosen global restrictions are needed, as long as a level is solvable in CC2 and can be made purely with the build in game editor things should be fine in general, everything else has to be judged on a case-by-case basis.
  13. Count to 1,000

    foldl1 (-) (ap map (ap ((:) . sum . ap map ((: [succ 1, 1, 1]) . succ . ($ succ 1))) (return . ($ succ 1))) (length . mapM id . replicate (succ 1) . enumFromTo 1))
  14. Count to 1,000

    liftM2 (*) ((succ (succ 0) +) . (`div` succ (succ 0))) pred (product (((:) =<< sum . (++ [succ (succ 0)])) [succ (succ 0), succ (succ (succ 0))]))
  15. Count to 1,000

    √(215²+912²)
×