Search results

Jump to navigation Jump to search
  • ...haracters each of which represents one of the cellar squares in order from 1 to 25. The meaning of each character is as follows. 1 = Explored / Stairs Up
    849 bytes (113 words) - 04:20, 10 September 2011
  • if (item_amount($item[tree-holed coin]) < 1) { while (item_amount($item[tree-holed coin]) < 1)
    2 KB (271 words) - 03:38, 14 January 2015
  • ...ills" : 1, "whalebone corset" : 1, "whole turkey leg" : 1, "Ze™ goggles" : 1 }
    4 KB (451 words) - 00:10, 26 November 2014
  • while (my_mp()-12>(i*(i+1)*(i+2)/6)-(i*(i-1)/2)-(c*(c+1)*(c+2)/6)-(c*(c-1)/2)) { i=i+1;
    2 KB (250 words) - 22:14, 21 May 2010
  • cli_execute("csend 1 meat to Testudinata"); while(have_effect($effect[Ode to Booze]) < 1 && iterations < 30) {
    1 KB (142 words) - 18:22, 31 December 2010
  • ...}-1. Note that this function aborts with an error if you attempt to supply 1 for {{pspan|range}} (not that a number between 0 and 0 is all that random). int die1 = 1 + random(6);
    965 bytes (137 words) - 01:35, 3 July 2010
  • int i = 1; i += 1;
    1 KB (146 words) - 01:11, 7 November 2018
  • if(item_amount($item[detuned radio]) < 1 && knoll_available() && my_meat() >= 300) buy(1, $item[detuned radio]);
    725 bytes (92 words) - 08:12, 19 May 2011
  • set_property( "choiceAdventure595", "1" ); use( 1, $item[CSA fire-starting kit] );
    871 bytes (104 words) - 00:44, 6 November 2014
  • adventure(1, $location[hedge maze]); maze_trips = maze_trips + 1;
    1 KB (180 words) - 22:19, 21 May 2010
  • if ( stills_available() > 1 ) { set_property( "promptAboutCrafting", 1 );
    2 KB (279 words) - 15:28, 31 December 2020
  • ...characters each of which represents one of the city squares in order from 1 to 25. The meaning of each character is as follows. for i from 1 to length(hiddenCityLayout)
    2 KB (280 words) - 04:10, 10 September 2011
  • buy(1 , $item[hermit permit]); adventure(1 , $location[knob goblin treasury]);
    1 KB (186 words) - 21:44, 21 May 2010
  • ...) and their respective values. A map can have any amount of keys, but only 1 value. Also, keys will always be unique from one another. To understand this, lets take the simplest type of map, a map with 1 key each giving a value and lets use the following analogy of keys and door
    8 KB (1,273 words) - 02:17, 25 January 2015
  • if (in_casual() && available_amount($item[smut orc keepsake box]) < 1) { buy(1, $item[smut orc keepsake box]);
    884 bytes (118 words) - 18:42, 23 June 2022
  • ...Monkee}} for a given {{pspan|round}} of combat. This only works for rounds 1 to 10. ...ent of your next attack should be <syntaxhighlight>dad_sea_monkee_weakness(1)</syntaxhighlight>.|
    2 KB (214 words) - 01:20, 10 March 2020
  • bots_tried = bots_tried + 1; bots_tried = bots_tried + 1;
    1 KB (208 words) - 03:16, 14 January 2014
  • 1: Can I fight that tentacle you saved for science? |{{{1|}}}
    1 KB (171 words) - 07:31, 22 December 2020
  • ...]: element 0 is the entire text matched by the regular expression, element 1 is the text matched by the first set of grouping parentheses within the exp test[0][1] = 134
    4 KB (513 words) - 17:14, 14 October 2014
  • if (my_ascensions() < 1 || in_bad_moon()) return true; if (my_ascensions() < 1) return (my_level() > 4);
    1 KB (165 words) - 10:10, 19 May 2011

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)