[B! algorithm] tetrylã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

tetryl id:tetryl

algorithmã«é–¢ã™ã‚‹tetrylã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (12)

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

${{author_name}}$
{{author_name}}{{created}}
{{ #comment }}{{ comment }}{{ /comment }}
- {{ label }}

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

ã‚¤ãƒ©ã‚¤ãƒ©è§£æ¶ˆã€ã‚¨ãƒ¬ãƒ™ãƒ¼ã‚¿ãƒ¼ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¯ã€Œä½•ã‚‰ã‹ã®å•é¡Œã‚’è§£æ±ºã™ã‚‹æ‰‹é †ã€ã‚’æŒ‡ã—ã€ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®è‰¯ã—ã‚ã—ã§ã‚½ãƒ•ãƒˆã‚¦ã‚¨ã‚¢ã®æ€§èƒ½ãŒæ±ºã¾ã‚‹ã¨è¨€ã£ã¦ã‚‚éŽè¨€ã§ã¯ãªã„ã€‚ç§ãŸã¡ã®ç”Ÿæ´»ã¯ã€é«˜åº¦ãªã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã§å®Ÿè£…ã•ã‚ŒãŸã‚½ãƒ•ãƒˆã‚¦ã‚¨ã‚¢ã«æ”¯ãˆã‚‰ã‚Œã¦ã„ã‚‹ã€‚ã‚¨ãƒ¬ãƒ™ãƒ¼ã‚¿ãƒ¼ã‚„ä¿¡å·æ©Ÿã®åˆ¶å¾¡ã‚½ãƒ•ãƒˆã‚’ä¾‹ã«ã€èº«è¿‘ãªã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®ä¸€ç«¯ã‚’è¦‹ã¦ã„ãã€‚ä»Šå›žã¯ã€ã‚¨ãƒ¬ãƒ™ãƒ¼ã‚¿ãƒ¼ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®åŸºæœ¬ç·¨ã ã€‚ æœã¯ã„ã¤ã‚‚ã‚¨ãƒ¬ãƒ™ãƒ¼ã‚¿ãƒ¼å‰ãŒå¤§æ¸‹æ»žã€ãƒœã‚¿ãƒ³ã‚’æŠ¼ã—ã¦ã‚‚ãªã‹ãªã‹æ¥ãªã„â€•â€•ã€‚ã“ã‚“ãªçµŒé¨“ã¯èª°ã—ã‚‚ã‚ã‚‹ã ã‚ã†ã€‚ã©ã†ã™ã‚Œã°ã‚¨ãƒ¬ãƒ™ãƒ¼ã‚¿ãƒ¼ã«ã‚¹ãƒ ãƒ¼ã‚ºã«ä¹—ã‚Œã‚‹ã®ã‹ã€‚ã“ã®ç”ãˆã¯ã‚¨ãƒ¬ãƒ™ãƒ¼ã‚¿ãƒ¼ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’ç†è§£ã§ãã‚Œã°ã€ãŠã®ãšã¨è¦‹ãˆã¦ãã‚‹ã€‚ ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¨ã¯ã€ã€Œä½•ã‚‰ã‹ã®å•é¡Œã‚’è§£æ±ºã™ã‚‹æ‰‹é †ã€ã‚’æŒ‡ã—ã€ã“ã®æ‰‹é †ã‚’ã‚³ãƒ³ãƒ”ãƒ¥ãƒ¼ã‚¿ãŒç†è§£ã§ãã‚‹ã‚ˆã†ã«è¨˜è¿°ã—ãŸã‚‚ã®ãŒãƒ—ãƒã‚°ãƒ©ãƒ ã ã€‚ã‚¨ãƒ¬ãƒ™ãƒ¼ã‚¿ãƒ¼ã¯ã€é«˜åº¦ãªã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã«ã‚ˆã£ã¦å®Ÿè£…ã•ã‚ŒãŸãƒ—ãƒã‚°ãƒ©ãƒ ã§å‹•ã„ã¦ã„ã‚‹ã€‚ãƒœã‚¿ãƒ³ã‚’æŠ¼ã—ã¦ã‚‚ãªã‹ãªã‹æ¥ãªã„ã‚¨ãƒ¬ãƒ™ãƒ¼ã‚¿ãƒ¼ã¯å®Ÿåœ¨ã™ã‚‹ã‚‚
tetryl 2018/06/21
algorithm
ãƒªãƒ³ã‚¯
Reddit - Dive into anything
The subreddit covers various game development aspects, including programming, design, writing, art, game jams, postmortems, and marketing. It serves as a hub for game creators to discuss and share their insights, experiences, and expertise in the industry. So today I'm going to be a little different and talk about one technical aspect of my game TinyKeep, that is random procedural dungeon generati
tetryl 2017/11/20
algorithm
ãƒªãƒ³ã‚¯
Algorithms that select which algorithm should play which game
This was meant to be a short post announcing some new papers of ours, but it grew. So what you get is a post announcing some new papers, with plenty of context. Video games are possibly the best way of testing artificial intelligence algorithms. At least I've argued this (at some length) before. One of the things that video games offer that for example robot probl ems don't offer, is to easily and
tetryl 2016/08/10
algorithm
ãƒªãƒ³ã‚¯
ã€Œå·¡å›žã‚»ãƒ¼ãƒ«ã‚¹ãƒžãƒ³å•é¡Œã€ã‚’è§£ãã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’å¯è¦–åŒ–ã—ãŸãƒ ãƒ¼ãƒ“ãƒ¼
by GaÃ«l SacrÃ© ã„ãã¤ã‚‚ã®éƒ½å¸‚ã‚’ç§»å‹•ã™ã‚‹ã‚»ãƒ¼ãƒ«ã‚¹ãƒžãƒ³ãŒã€ã™ã¹ã¦ã®éƒ½å¸‚ã‚’æœ€ã‚‚åŠ¹çŽ‡ã‚ˆã(æœ€å°ã®ç§»å‹•ã‚³ã‚¹ãƒˆã§)ç§»å‹•ã§ãã‚‹æ–¹æ³•ã‚’æ±‚ã‚ã‚‹å•é¡Œã‚’ã€Œå·¡å›žã‚»ãƒ¼ãƒ«ã‚¹ãƒžãƒ³å•é¡Œã€ã¨ã„ã„ã¾ã™ãŒã€ãã®è§£ãæ–¹ã‚’ãƒ“ã‚¸ãƒ¥ã‚¢ãƒ«åŒ–ã—ãŸãƒ ãƒ¼ãƒ“ãƒ¼ãŒYouTubeã§å…¬é–‹ã•ã‚Œã¦ã„ã¾ã™ã€‚ Traveling Salesman Probl em Visualization - YouTube ãŸã¨ãˆã°8ã¤ã®éƒ½å¸‚ãŒã‚ã‚‹ã¨ãã€ã“ã‚Œã‚’çµã¶ãƒ«ãƒ¼ãƒˆã¯5040é€šã‚ŠãŒè€ƒãˆã‚‰ã‚Œã¾ã™ã€‚ è§£æ³•ã®ä¸€ã¤ãŒã€Œæ¬²å¼µã‚Šæ³•(Greedy Algorithm)ã€ã¨ã„ã†ã€1ã¤ã®éƒ½å¸‚ã‹ã‚‰å¸¸ã«æœ€å¯„ã‚Šã®éƒ½å¸‚ã¸ç§»å‹•ã—ã‚ˆã†ã¨è€ƒãˆã‚‹æ–¹æ³•ã€‚ ã€Œæœ€é©ã€ã§ã¯ãªã„ã‚‚ã®ã®ã€æœ€é©ã«è¿‘ã„ç”ãˆã‚’å°Žãå‡ºã—ã¦ãã‚Œã¾ã™ã€‚ ã“ã“ã§ã€çµ„ã¿åˆã‚ã›ã¦ä½¿ã†ã®ãŒã€Œ2-optæ³•ã€ã¨ã„ã†æ–¹æ³•ã€‚ã‹ãªã‚Šå˜ç´”ãªã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã§ã€2è¾ºã‚’ç¹‹ãŽç›´ã—ã¦ã„ãã¾ã™ã€‚ã“ã®ã¨ãã€ãƒ«ãƒ¼ãƒˆã«é‡ãªã‚ŠãŒã‚ã‚‹ã¨è§£æ¶ˆã—ã¦æ–°ã—ã„ãƒ«ãƒ¼ãƒˆã‚’ä½œã‚Šã¾ã™ã€‚
tetryl 2016/05/13
algorithm

å¯è¦–åŒ–
ãƒªãƒ³ã‚¯
Bibliography: Encoding and generating videogame mechanics | Mark J. Nelson
Videogame generation is the artificial intelligence probl em of having computers design videogames. It can be seen as a generalization of procedural content generation (PCG), to cover things other than traditional "content" (levels, characters, it ems, terr ain, graphical elements), including gameplay mechanics. This annotated bibliography is intended to accompany my CIG 2012 tutorial, but will hopef
tetryl 2016/02/13
algorithm

game
ãƒªãƒ³ã‚¯
Sorting Algorithms Animations
KEY Black values are sorted. Gray values are unsorted. A red triangle marks the algorithm position. Dark gray values denote the current interval (shell, merge, quick). A pair of red triangles marks the left and right pointers (quick). DISCUSSIONThese pages show 8 different sorting algorithms on 4 different initial conditions. These visualizations are intended to: Show how each algorithm operates.
tetryl 2014/11/26
algorithm

å¯è¦–åŒ–
ãƒªãƒ³ã‚¯
Don't use bcrypt
Hi, I'm Tony Arcieri. You may rem ember me from such software projects as Celluloid, Reia, and Cool.io... If you're already using bcrypt, relax, you're fine, probably. However, if you're looking for a key derivation function (or in bcrypt's case, password encryption function) for a new project, bcrypt is probably not the best one you can pick. In fact, there are two algorithms which are each better
tetryl 2013/04/01
crypt

algorithm
ãƒªãƒ³ã‚¯
Crit-bit trees
Interface to crit-bit trees A crit-bit tree stores a prefix-free set of bit strings: a set of 64-bit integers, for example, or a set of variable-length 0-terminated byte strings. A crit-bit tree supports the following operations (and more!) at high speed: See whether a string x is in the tree. Add x to the tree. Remove x from the tree. Find the lexicographically smallest string in the tree larger
tetryl 2013/02/18
algorithm
ãƒªãƒ³ã‚¯
perl - Digest::SipHash released : 404 Blog Not Found
2013å¹´02æœˆ18æ—¥00:30 ã‚«ãƒ†ã‚´ãƒªLightweight Languagesã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ç™¾é¸ perl - Digest::SipHash released Digest::SipHash ã¨ã„ã†ãƒ¢ã‚¸ãƒ¥ãƒ¼ãƒ«ã‚’ãƒªãƒªãƒ¼ã‚¹ã—ãŸã®ã§ãŠã—ã‚‰ã›ã—ã¾ã™ã€‚ dankogai's p5-digest-siphash at master - GitHub Dan Kogai / Digest-SipHash - search.cpan.org ãªã«ã“ã‚Œ? SipHashã¨ã„ã†ãƒãƒƒã‚·ãƒ¥é–¢æ•°ã‚’å®Ÿè£…ã—ãŸã‚‚ã®ã§ã™ã€‚ SipHash: a fast short-input PRF SipHash is a family of pseudorandom functions (a.k.a. keyed hash functions) optimized for speed on short messages. Ta
tetryl 2013/02/18
djb

algorithm
ãƒªãƒ³ã‚¯
Beam search - Wikipedia
Beam search with width 3 (animation) In computer science, beam search is a heuristic search algorithm that explores a graph by expanding the most promising node in a limited set. Beam search is a modification of best-first search that reduces its memory requirements. Best-first search is a graph search which orders all partial solutions (states) according to some heuristic. But in beam search, onl
tetryl 2012/06/14
algorithm
ãƒªãƒ³ã‚¯
é«˜é€Ÿãªå®‰å®šã‚½ãƒ¼ãƒˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ "TimSort" ã®è§£èª¬ - Preferred Networks Research & Development
å…ˆæ—¥ã€TimSortã¨ã„ã†ã‚½ãƒ¼ãƒˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ãŒè©±é¡Œã«ãªã‚Šã¾ã—ãŸã€‚TimSortã¯ã€é«˜é€Ÿãªå®‰å®šã‚½ãƒ¼ãƒˆã§ã€Python(>=2.3)ã‚„Java SE 7ã€ãŠã‚ˆã³Androidã§ã®æ¨™æº–ã‚½ãƒ¼ãƒˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¨ã—ã¦æŽ¡ç”¨ã•ã‚Œã¦ã„ã‚‹ãã†ã§ã™ã€‚ C++ã®std::sort()ã‚ˆã‚Šã‚‚é«˜é€Ÿã§ã‚ã‚‹ã¨ã„ã†ãƒ™ãƒ³ãƒãƒžãƒ¼ã‚¯çµæžœ1ãŒè©±é¡Œã«ãªã‚Š(å¾Œã«ãƒ™ãƒ³ãƒãƒžãƒ¼ã‚¯ã®èª¤ã‚Šã¨åˆ¤æ˜Ž)ã€ç§ã‚‚ãã‚Œã§å˜åœ¨ã‚’çŸ¥ã‚Šã¾ã—ãŸã€‚å®Ÿéš›ã®ã¨ã“ã‚ã€ãƒ©ãƒ³ãƒ€ãƒ ãªãƒ‡ãƒ¼ã‚¿ã«å¯¾ã—ã¦ã¯ã‚¯ã‚¤ãƒƒã‚¯ã‚½ãƒ¼ãƒˆ(IntroSort)ã»ã©é€Ÿããªã„ã‚ˆã†ã§ã™ãŒã€ã‚½ãƒ¼ãƒˆã¨ã„ã†ã‚·ãƒ³ãƒ—ãƒ«ãªã‚¿ã‚¹ã‚¯ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ãŒä»Šã‚‚ãªãŠæ”¹è‰¯ã•ã‚Œç¶šã‘ã¦ã„ã¦ã€ãªãŠã‹ã¤äººã€…ã®é–¢å¿ƒã‚’å¼•ãã¨ã„ã†ã®ã¯èˆˆå‘³æ·±ã„ã‚‚ã®ã§ã™ã€‚ ã—ã‹ã—ãªãŒã‚‰ã€ã‚ªãƒªã‚¸ãƒŠãƒ«ã®TimSortã®ã‚³ãƒ¼ãƒ‰ã¯è‹¥å¹²è¤‡é›‘ã§ã€å®Ÿéš›ã®ã¨ã“ã‚ã©ã†ã„ã†ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ãªã®ã‹ã‚ã‹ã‚Šã¥ã‚‰ã„ã¨ã“ã‚ãŒã‚ã‚‹ã¨æ€ã„ã¾ã™ã€‚ãã“ã§ä»Šå›žã¯TimSortã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’ã§ãã‚‹ã ã‘ã‚ã‹ã‚Šã‚„ã™ãè§£
tetryl 2011/10/30
algorithm
ãƒªãƒ³ã‚¯
4chan BBS - Genius sorting algorithm: Sleep sort
1 Name: Anonymous : 2011-01-20 12:22 Man, am I a genius. Check out this sorting algorithm I just invented. #!/bin/bash function f() { sleep "$1" echo "$1" } while [ -n "$1" ] do f "$1" & shift done wait example usage: ./sleepsort.bash 5 3 6 3 6 3 1 4 7 2 Name: Anonymous : 2011-01-20 12:27 >>1 Oh god, it works. But I don't like to wait 218382 seconds to sort '(0 218382)
tetryl 2011/05/19
ã‚¢ã‚¤ãƒ‡ã‚¢

algorithm
ãƒªãƒ³ã‚¯
1