Search results

Jump to: navigation, search

Page title matches

  • 0 B (0 words) - 08:21, 5 September 2020

Page text matches

  • ...n [[handicap]] games. For example, in the [[Handicap#Demer_handicap_system|Demer handicap system]], a handicap of 0.5 moves amounts to playing without the s
    2 KB (372 words) - 03:58, 13 September 2021
  • Move 3 is named ''Eric's move'' after Eric Demer, who discovered it. If Red plays there, Blue in theory no longer gets a 5th
    14 KB (2,655 words) - 12:53, 27 April 2024
  • '''Demer:'''
    2 KB (324 words) - 00:04, 7 July 2021
  • ...hat is reasonably well-motivated and seems to be gaining popularity is the Demer handicap system, described below. Some other proposals for handicapping sys == Demer handicap system ==
    11 KB (1,806 words) - 03:07, 5 April 2023
  • ...nger]] ([[User talk:Selinger|talk]]) and [[User:Demer|Demer]] ([[User talk:Demer|talk]]) 00:26, 19 April 2023 (UTC)
    5 KB (946 words) - 00:26, 19 April 2023
  • == [[User:Demer|Eric Demer]] == Eric Demer also has a [[Worst_move_puzzles#Puzzle_3|worst-move puzzle]].
    5 KB (1,001 words) - 12:23, 5 January 2024
  • == Eric Demer ==
    34 KB (6,464 words) - 23:41, 14 February 2024
  • ...FI25_vs._murasawa,_October_2021 | FIFI25 vs. murasawa]] || October 2021 || Demer || ---
    1 KB (195 words) - 01:01, 9 February 2022
  • ...e-book nor here on hexwiki. ​ ​ ​ [[User:Demer|Demer]] ([[User talk:Demer|talk]]) 15:22, 2 January 2024 (UTC)
    983 B (158 words) - 03:37, 3 January 2024
  • Consider the following puzzle, due to Eric Demer. Blue to move and win.
    14 KB (2,723 words) - 01:16, 4 October 2023
  • reply by [[User:Demer|Demer]]:
    1 KB (238 words) - 02:31, 21 February 2023
  • The move is named after Eric Demer, who discovered it.
    7 KB (1,353 words) - 02:02, 17 October 2023
  • * Comments: Eric Demer
    12 KB (2,029 words) - 23:16, 28 August 2022
  • The following theorem is due to Eric Demer.
    29 KB (4,992 words) - 05:51, 21 April 2024
  • replies by [[User:Demer|Demer]]: ...without swap asymptotically requires Θ(n^2) cells, and more generally, a Demer handicap of Θ(f(n)) stones requires Θ(n^2/f(n)) cells, for all f(n) betwe
    13 KB (2,101 words) - 04:16, 25 April 2024
  • ...​ ​ ​ ​ ​ ​ ​ ​ ​ ​ [[User:Demer|Demer]] ([[User talk:Demer|talk]]) 02:32, 2 May 2023 (UTC) [[User:Demer|Demer]] ([[User talk:Demer|talk]]) 05:36, 2 May 2023 (UTC)
    9 KB (1,636 words) - 17:50, 6 May 2023
  • By [[User:Demer|Eric Demer]]. Red to play the unique losing move.
    1 KB (248 words) - 18:08, 4 January 2024
  • ...I created this with just one puzzle. ​ [[User:Demer|Demer]] ([[User talk:Demer|talk]]) 20:41, 2 July 2023 (UTC) . ​ [[User:Demer|Demer]] ([[User talk:Demer|talk]]) 20:54, 2 July 2023 (UTC)
    3 KB (445 words) - 07:43, 8 July 2023
  • ...hink of one. ​ ​ ​ ​ ​ ​ ​ [[User:Demer|Demer]] ([[User talk:Demer|talk]]) 04:00, 27 July 2023 (UTC) ...y talk page. ​ ​ ​ ​ ​ ​ ​ [[User:Demer|Demer]] ([[User talk:Demer|talk]]) 12:02, 4 August 2023 (UTC)
    4 KB (628 words) - 03:04, 6 August 2023
  • The template was discovered by Eric Demer, in answer to an open question from the page [[Open problems about edge tem
    1 KB (209 words) - 01:24, 7 October 2023
  • ...he [[Hex forums|Hex Discord]] in October and November 2023, following Eric Demer's discovery of [[edge template VI1b]]. See [[Seventh row template problem]]
    623 B (100 words) - 13:45, 18 November 2023
  • After Eric Demer's discovery of [[edge template VI1b]] on October 6, Bobson noticed that thi
    6 KB (968 words) - 14:25, 1 December 2023

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