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

hitode909 id:hitode909

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

${{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}}

ãƒšã‚¤ãƒ³ãƒˆãƒ»ãƒ«ãƒ¼ãƒãƒ³ (1)ã‚·ãƒ¼ãƒ‰ãƒ»ãƒ•ã‚£ãƒ« ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
ã“ã“ã§ã¯ã€ã‚·ãƒ¼ãƒ‰ãƒ»ãƒ•ã‚£ãƒ«(seed fill)ã«ã‚ˆã‚‹é–‰é ˜åŸŸã®å¡—ã‚Šæ½°ã—ã€ã„ã‚ã‚†ã‚‹ãƒšã‚¤ãƒ³ãƒˆãƒ»ãƒ«ãƒ¼ãƒãƒ³ã«ã¤ã„ã¦å–ã‚Šä¸Šã’ãŸã„ã¨æ€ã„ã¾ã™ã€‚ ã‚·ãƒ¼ãƒ‰ãƒ»ãƒ•ã‚£ãƒ« ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¯ã€ä»¥ä¸‹ã®ã‚ˆã†ãªæµã‚Œã«ãªã‚Šã¾ã™ã€‚ å¡—ã‚Šæ½°ã—ã®é–‹å§‹ç‚¹(ã‚·ãƒ¼ãƒ‰)ã¨ã—ã¦æŒ‡å®šã—ãŸ 1ãƒ”ã‚¯ã‚»ãƒ«ã‚’å¡—ã‚‹ ä»Šå¡—ã£ãŸã‚·ãƒ¼ãƒ‰ãƒ»ãƒ”ã‚¯ã‚»ãƒ«ã®å‘¨å›²ã‹ã‚‰å¡—ã‚Šæ½°ã™ã¹ããƒ”ã‚¯ã‚»ãƒ«ã‚’æŽ¢ã™ ãã®ãƒ”ã‚¯ã‚»ãƒ«ã‚’æ–°ãŸãªã‚·ãƒ¼ãƒ‰ã¨ã—ã¦ 1,2ã¨åŒæ§˜ã®å‡¦ç†ã‚’ç¹°ã‚Šè¿”ã™ æ–°ãŸãªã‚·ãƒ¼ãƒ‰ã¨ãªã‚‹ãƒ”ã‚¯ã‚»ãƒ«ãŒãªããªã£ãŸæ™‚ç‚¹ã§å¡—ã‚Šæ½°ã—ã¯å®Œäº†ã—ã¦ã„ã‚‹ 2ã®ã‚¹ãƒ†ãƒƒãƒ—ã§è¦‹ã¤ã‹ã‚‹ã‚·ãƒ¼ãƒ‰ã®å€™è£œã¯ä¸€ç‚¹ã ã‘ã¨ã¯é™ã‚‰ãªã„ã®ã§ã€è¦‹ã¤ã‘ãŸã‚·ãƒ¼ãƒ‰ã®å€™è£œã¯å…¨ã¦ã©ã“ã‹ã«è¨˜æ†¶ã—ã¦ãŠãå¿…è¦ãŒã‚ã‚Šã¾ã™ã€‚ãã®ã‚ãŸã‚Šã‚’è€ƒæ…®ã—ã¦ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’ç·´ã‚Šç›´ã™ã¨æ¬¡ã®ã‚ˆã†ã«ãªã‚Šã¾ã™ã€‚ ã‚·ãƒ¼ãƒ‰ã¨ã—ã¦æŒ‡å®šã—ãŸ 1ãƒ”ã‚¯ã‚»ãƒ«ã‚’å¡—ã‚‹ ä»Šå¡—ã£ãŸã‚·ãƒ¼ãƒ‰ãƒ”ã‚¯ã‚»ãƒ«ã®å‘¨å›²ã‹ã‚‰å¡—ã‚Šæ½°ã™ã¹ããƒ”ã‚¯ã‚»ãƒ«ã‚’æŽ¢ã—ã€ã‚·ãƒ¼ãƒ‰ã®å€™è£œã¨ã—ã¦ãã®åº§æ¨™ã‚’ãƒãƒƒãƒ•ã‚¡ã«è¨˜æ†¶ã™ã‚‹ ãƒãƒƒãƒ•ã‚¡ã‹ã‚‰ 1
hitode909 2012/02/23
algorithm

å¡—ã‚Šæ½°ã—

fill
ãƒªãƒ³ã‚¯
GameInternals - Understanding Pac-Man Ghost Behavior
GameInternals aims to spread knowledge of interesting game mechanics beyond the game-specific enthusiast communities. Each post focuses on a specific game mechanic that would normally only be known to high-level players of a particular game, and attempts to explain it in a manner that would be understandable even by readers unfamiliar with that game. GameInternals articles were researched and writ
hitode909 2011/03/26
ãƒ‘ãƒƒã‚¯ãƒžãƒ³

pacman

algorithm

game
ãƒªãƒ³ã‚¯
ä¸€ç•ªå³ç«¯ã®ç«‹ã£ã¦ã„ã‚‹ãƒ“ãƒƒãƒˆä½ç½®ã‚’æ±‚ã‚ã‚‹ã€Œã‚‚ã®ã™ã”ã„ã€ã‚³ãƒ¼ãƒ‰ - å½“é¢C#ã¨.NETãªè¨˜éŒ²
ä¸€ç•ªå³ç«¯ã®ç«‹ã£ã¦ã„ã‚‹ãƒ“ãƒƒãƒˆä½ç½®(RightMostBit)ã‚’æ±‚ã‚ã‚‹ã‚³ãƒ¼ãƒ‰ã§é€Ÿã„ã®ãªã„ã‹ãªãƒ¼ã¨æŽ¢ã—ã¦ã„ãŸã‚‰ã€ã‚‚ã®ã£ã£ã£ã™ã”ã„ã‚³ãƒ¼ãƒ‰ã«å‡ºä¼šã£ã¦ã—ã¾ã£ãŸã®ã§ã”ç´¹ä»‹ã€‚2ch ã®ãƒ“ãƒƒãƒˆæ¼”ç®—ã‚¹ãƒ¬ã§ 32bit å€¤ã®ã‚³ãƒ¼ãƒ‰ã«å‡ºä¼šã£ã¦è¡æ’ƒã‚’å—ã‘ã¦ã€ãã®å¾Œ 64bit å€¤ç‰ˆã®ãƒ’ãƒ³ãƒˆã‚’è¦‹ã¤ã‘ãŸã®ã§ã‚³ãƒ¼ãƒ‰ã‚’æ›¸ã„ã¦ã¿ã¾ã—ãŸã€‚ ã“ã®å•é¡Œã¯ ãƒãƒƒã‚«ãƒ¼ã®ãŸã®ã—ã¿â€•æœ¬ç‰©ã®ãƒ—ãƒã‚°ãƒ©ãƒžã¯ã„ã‹ã«ã—ã¦å•é¡Œã‚’è§£ãã‹ (Google book search ã§åŽŸè‘— Hacker's delight ãŒèªã‚ãŸã®ã§ãã‚Œã§æ¸ˆã¾ã›ãŸ) ã§ number of trailing zeros (ntz) ã¨ã—ã¦ç´¹ä»‹ã•ã‚Œã¦ã„ã¾ã™ã€‚bit ã§è€ƒãˆãŸã¨ãã«å³å´ã« 0 ãŒã„ãã¤ã‚ã‚‹ã‹ã‚’æ•°ãˆã‚‹ã‚‚ã®ã€‚1 ã ã¨ 0ã€2 ã ã¨ 1ã€0x80 ãªã‚‰ 7ã€12 ãªã‚‰ 2 ã¨ã„ã£ãŸãã‚ã„ã€‚0 ã®ã¨ãã«è¡¨é¡Œã©ãŠã‚Šã®å•é¡Œã¨ã—ã¦è€ƒãˆã‚‹ã¨ã„ãã¤ã‚’è¿”ã™ã®ï¼Ÿã£ã¦ã“ã¨ã«ãªã‚‹ã®ã§ã€
hitode909 2009/07/05
algorithm
ãƒªãƒ³ã‚¯
ãƒ€ã‚¤ã‚¯ã‚¹ãƒˆãƒ©æ³•ï¼ˆæœ€çŸçµŒè·¯å•é¡Œï¼‰
ãƒ€ã‚¤ã‚¯ã‚¹ãƒˆãƒ©æ³• (Dijkstra's Algorithm) ã¯æœ€çŸçµŒè·¯å•é¡Œã‚’åŠ¹çŽ‡çš„ã«è§£ãã‚°ãƒ©ãƒ•ç†è«–ã«ãŠã‘ã‚‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã§ã™ã€‚ ã‚¹ã‚¿ãƒ¼ãƒˆãƒŽãƒ¼ãƒ‰ã‹ã‚‰ã‚´ãƒ¼ãƒ«ãƒŽãƒ¼ãƒ‰ã¾ã§ã®æœ€çŸè·é›¢ã¨ãã®çµŒè·¯ã‚’æ±‚ã‚ã‚‹ã“ã¨ãŒã§ãã¾ã™ã€‚ ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ä»¥ä¸‹ã®ã‚°ãƒ©ãƒ•ã‚’ä¾‹ã«ãƒ€ã‚¤ã‚¯ã‚¹ãƒˆãƒ©ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’è§£èª¬ã—ã¾ã™ã€‚ å††ãŒãƒŽãƒ¼ãƒ‰ï¼Œç·šãŒã‚¨ãƒƒã‚¸ã§ï¼ŒsãŒã‚¹ã‚¿ãƒ¼ãƒˆãƒŽãƒ¼ãƒ‰ï¼ŒgãŒã‚´ãƒ¼ãƒ«ãƒŽãƒ¼ãƒ‰ã‚’è¡¨ã—ã¦ã„ã¾ã™ã€‚ ã‚¨ãƒƒã‚¸ã®è¿‘ãã«æ›¸ã‹ã‚Œã¦ã„ã‚‹æ•°å—ã¯ãã®ã‚¨ãƒƒã‚¸ã‚’é€šã‚‹ã®ã«å¿…è¦ãªã‚³ã‚¹ãƒˆï¼ˆãŸã„ã¦ã„è·é›¢ã¾ãŸã¯æ™‚é–“ï¼‰ã§ã™ã€‚ ã“ã“ã§ã¯ã‚¨ãƒƒã‚¸ã«å‘ããŒå˜åœ¨ã—ãªã„ï¼ˆï¼ã©ã¡ã‚‰ã‹ã‚‰ã§ã‚‚é€šã‚Œã‚‹ï¼‰ç„¡å‘ã‚°ãƒ©ãƒ•ã ã¨ã—ã¦æ‰±ã£ã¦ã„ã¾ã™ãŒï¼Œ ãƒ€ã‚¤ã‚¯ã‚¹ãƒˆãƒ©æ³•ã®å ´åˆã¯ãã‚Œã»ã©ç„¡å‘ã‚°ãƒ©ãƒ•ã¨æœ‰å‘ã‚°ãƒ©ãƒ•ã‚’åŒºåˆ¥ã—ã¦è€ƒãˆã‚‹å¿…è¦ã¯ã‚ã‚Šã¾ã›ã‚“ã€‚ ãƒ€ã‚¤ã‚¯ã‚¹ãƒˆãƒ©æ³•ã¯DPï¼ˆå‹•çš„è¨ˆç”»æ³•ï¼‰çš„ãªã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã§ã™ã€‚ ã¤ã¾ã‚Šï¼Œã€Œæ‰‹è¿‘ã§æ˜Žã‚‰ã‹ãªã“ã¨ã‹ã‚‰é †æ¬¡ç¢ºå®šã—ã¦ã„ãï¼Œãã®ç¢ºå®šã—ãŸæƒ…å ±ã‚’ã‚‚ã¨ã«ã•ã‚‰ã«é ãã¾ã§ç¢ºå®šã—ã¦ã„ã
hitode909 2009/02/27
algorithm
ãƒªãƒ³ã‚¯
ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ for Ruby
ã“ã®ãƒšãƒ¼ã‚¸ã¯ã€ã‚½ãƒ•ãƒˆãƒãƒ³ã‚¯ ãƒ‘ãƒ–ãƒªãƒƒã‚·ãƒ³ã‚°ã‹ã‚‰å‡ºç‰ˆã•ã‚Œã¦ã„ã‚‹ã€Žãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®å®ç®±ã€€ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¨ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã€ã‚’èªã‚“ã§ã„ã‚‹ã¨ãã«ã€ã›ã£ã‹ããªã®ã§ã‚µãƒ³ãƒ—ãƒ«ã‚³ãƒ¼ãƒ‰ã‚’ Ruby ã§æ›¸ãç›´ã—ãŸå ´åˆã€ã©ã†ãªã‚‹ã‚“ã ã‚ã†ã¨æ€ã„ã¤ã¤ä½œã£ã¦ã„ã¾ã™ã€‚ ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã«é–¢ã™ã‚‹è§£èª¬ã¯ç‰¹ã«ã—ã¦ã„ã¾ã›ã‚“ã®ã§ã€å‚è€ƒæ›¸ç±ã‚’ã”è¦§ä¸‹ã•ã„ã€‚ ã¾ãŸã€å†…å®¹ã«ã¯å……åˆ†æ³¨æ„ã—ã¦ã„ã¾ã™ãŒã€ã‚ãã¾ã§ã‚‚åƒ•ã®å‹‰å¼·ãƒ¡ãƒ¢ã«ãªã£ã¦ã„ã‚‹ãŸã‚ã€é–“é•ã„ã‚„å‹˜é•ã„ãŒã‚ã‚‹ã‹ã¨æ€ã„ã¾ã™ã€‚ãã®ç‚¹ã€ã”äº†æ‰¿ã„ãŸã ã‘ã‚Œã°å¹¸ã„ã§ã™ã€‚åŒæ™‚ã«é–“é•ã„ã‚„å‹˜é•ã„ã‚’ç™ºè¦‹ã•ã‚ŒãŸæ–¹ã¯ã€ãƒ¡ãƒ¼ãƒ«ã‚„æŽ²ç¤ºæ¿ã§ã”æŒ‡æ‘˜ã„ãŸã ã‘ã‚‹ã¨ã€ã™ã”ãå¬‰ã—ã„ã§ã™ã€‚ ã€å‚è€ƒæ›¸ç±ã€‘ ç´€å¹³æ‹“ç”·ã€æ˜¥æ—¥ä¼¸å¼¥ã€€ã€Žãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®å®ç®±ã€€ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¨ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã€ï¼ˆã‚½ãƒ•ãƒˆãƒãƒ³ã‚¯ã€€ãƒ‘ãƒ–ãƒªãƒƒã‚·ãƒ³ã‚°ã€€2003ï¼‰ å‚è€ƒURLï¼šhttp://www.cmagazine.jp/books/takarabako/
hitode909 2008/07/03
cool

ruby

algorithm
ãƒªãƒ³ã‚¯
Mersenne Twister: A random number generator (since 1997/10)
English Version News: MTToolBox ã‚’GitHubã§å…¬é–‹ã—ã¾ã—ãŸã€‚(2013/10/04) TinyMTã‚’ãƒªãƒªãƒ¼ã‚¹ã—ã¾ã—ãŸã€‚ (2011/06/20) MTGPã‚’ãƒªãƒªãƒ¼ã‚¹ã—ã¾ã—ãŸã€‚(2009/11/17) SIMD-oriented Fast Mersenne Twister (SFMT) ã‚’ãƒªãƒªãƒ¼ã‚¹ã—ã¾ã—ãŸã€‚ SFMTã¯ã‚ªãƒªã‚¸ãƒŠãƒ«ã®Mersenne Twisterã‚ˆã‚Šç´„äºŒå€é€Ÿãã€ ã‚ˆã‚Šã‚ˆã„å‡ç‰åˆ†å¸ƒç‰¹æ€§ã‚’æŒã¡ã€é›¶è¶…éŽåˆæœŸçŠ¶æ…‹ã‹ã‚‰ã®å›žå¾©ã‚‚é«˜é€Ÿã§ã™ã€‚ SFMTã®ãƒšãƒ¼ã‚¸ã‚’è¦‹ã¦ãã ã•ã„ã€‚ (2007/1/31) ãŠé¡˜ã„ï¼šä½¿ã†æ™‚ã«em ailã‚’ä¸€é€šä¸‹ã•ã‚Œã°ã€ ä»Šå¾Œã®æ”¹è‰¯ã®ã¯ã’ã¿ã«ãªã‚Šã¾ã™ã€‚ ã©ã‚“ãªã•ã•ã„ãªå•é¡Œç‚¹ã§ã‚‚ã€è¦‹ã¤ã‘æ¬¡ç¬¬å¾¡é€£çµ¡ä¸‹ã•ã„ã€‚ m-mat ï¼ math.sci.hiroshima-u.ac.jp (ã“ã®ãƒ¡ãƒ¼ãƒ«ã‚¢ãƒ‰ãƒ¬ã‚¹ã¯ ã‚¹ãƒšãƒ¼ã‚¹ã‚’æŠœã„ã¦æ‰‹ã§æ‰“ã¡ç›´ã—ã¦ãã ã•ã„)
hitode909 2008/06/25
programming

algorithm
ãƒªãƒ³ã‚¯
GC - GCã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ è©³ç´°è§£èª¬ - livedoor Wikiï¼ˆã‚¦ã‚£ã‚ï¼‰
GCã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ è©³ç´°è§£èª¬ æ—¥æœ¬èªžã®è³‡æ–™ãŒã™ããªã„GCã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã«ã¤ã„ã¦è©³ç´°ã«è§£èª¬ã—ã¾ã™ ãƒˆãƒƒãƒ—ãƒšãƒ¼ã‚¸ãƒšãƒ¼ã‚¸ä¸€è¦§ãƒ¡ãƒ³ãƒãƒ¼ç·¨é›† GC æœ€çµ‚æ›´æ–°ï¼š author_nariÂ 2010å¹´03æœˆ14æ—¥(æ—¥) 20:47:11å±¥æ´ Tweet ã“ã®WikiãŒç›®æŒ‡ã™æ‰€ GCã¨ã¯ï¼Ÿ GCã‚’å¦ã¶å‰ã«çŸ¥ã£ã¦ãŠãäº‹ å®Ÿè¡Œæ™‚ãƒ¡ãƒ¢ãƒªæ§‹é€ åŸºæœ¬ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ç·¨ Reference Counter Mark&Sweep Copying å¿œç”¨ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ç·¨ IncrementalGC ä¸–ä»£åˆ¥GC ã‚¹ãƒŠãƒƒãƒ—ã‚·ãƒ§ãƒƒãƒˆåž‹GC LazySweep TwoFinger Lisp2 Partial Mark and Sweep -Cycle Collection- Mostly Parallel GC train gc MostlyCopyingGC(Bartlett 1989) TreadmillGC(Barker 1992) è£œè¶³
hitode909 2008/01/14
programming

algorithm
ãƒªãƒ³ã‚¯
1