SHARE
TWEET

Untitled

a guest May 19th, 2017 43 Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
  1. Apr 04 05:00:24 <f> hm
  2. Apr 04 05:00:34 <f> i think accessibility tester would definitely not work
  3. Apr 04 05:00:43 <f> (to see if survivor is reachable)
  4. Apr 04 05:01:09 <f> i was just sketching out some ideas, and realized that it would misfire any time it catches a player mid-flight
  5. Apr 04 05:01:12 <f> when falling
  6. Apr 04 05:01:45 <f> unless i try to extrapolate his next position based on position/velocity
  7. Apr 04 05:01:58 <f> that involves raycasting though :P
  8. Apr 04 05:08:21 <Redshift>  hm
  9. Apr 04 05:08:23 <Redshift>  well
  10. Apr 04 05:08:31 <Redshift>  good hack detection needs to be made first
  11. Apr 04 05:09:03 <f> yep
  12. Apr 04 05:09:17 <f> i sketched out an algorithm
  13. Apr 04 05:09:40 <Redshift>  oh?
  14. Apr 04 05:10:26 <f> but its efficiency is in the domain of O(n!)
  15. Apr 04 05:10:28 <f> :P
  16. Apr 04 05:10:34 <Redshift>  shit
  17. Apr 04 05:10:57 <f> i have to check a path from every player
  18. Apr 04 05:11:02 <f> from every zombie
  19. Apr 04 05:11:07 <f> to every player
  20. Apr 04 05:11:15 <f> that's n*n already
  21. Apr 04 05:11:37 <f> then i have to save state per-block for each of those searches
  22. Apr 04 05:12:01 <f> that's (width*height*depth) bytes of memory additional, doubles memory use
  23. Apr 04 05:12:17 <f> then i have to account for all different height jumps
  24. Apr 04 05:12:28 <f> and for possibility of removal of blocks
  25. Apr 04 05:12:37 <Redshift>  oh you are talking about accesability
  26. Apr 04 05:12:41 <f> yea
  27. Apr 04 05:12:49 <Redshift>  @alg
  28. Apr 04 05:13:03 <Redshift>  well what i was thinking is
  29. Apr 04 05:13:35 <Redshift>  determine ground, if theres a path from human to ground
  30. Apr 04 05:13:37 <Redshift>  then good
  31. Apr 04 05:13:41 <f> heh
  32. Apr 04 05:13:45 <f> it's not that easy
  33. Apr 04 05:14:23 <f> there's no set "ground"
  34. Apr 04 05:14:34 <Redshift>  i know
  35. Apr 04 05:14:39 <f> i need a 3D array of the map, with 1 boolean (accessible/not accessible) for each
  36. Apr 04 05:14:51 <f> then, start at the block on which player is standing on
  37. Apr 04 05:14:55 <f> mark it as accessible
  38. Apr 04 05:15:02 <f> then keep marking off nearby blocks
  39. Apr 04 05:15:21 <f> taking into account possibility of jumping from the sides
  40. Apr 04 05:15:23 <f> or from above
  41. Apr 04 05:15:35 <f> and keep going outwards (BFS) until a block with a zombie on it is reached
  42. Apr 04 05:16:28 <f> it might be possible to reduce memory use
  43. Apr 04 05:16:56 <f> if, instead of using one bool for each block, i use a list or tree type structure
  44. Apr 04 05:17:03 <f> but that's a lot of extra allocation
  45. Apr 04 05:17:11 <f> and might, in practice, be even slower
  46. Apr 04 05:17:44 <Redshift>  hmm
  47. Apr 04 05:18:29 <Redshift>  or alternately, we allow zombies to be able to build at most 1 block every 10 seconds
  48. Apr 04 05:18:37 <Redshift>  or something simiular
  49. Apr 04 05:19:07 <Redshift>  :P
RAW Paste Data
Pastebin PRO Summer Special!
Get 60% OFF on Pastebin PRO accounts!
Top